Sciweavers

Share
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
9 years 9 days ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
9 years 2 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
ESA
2006
Springer
146views Algorithms» more  ESA 2006»
9 years 2 months ago
Balancing Applied to Maximum Network Flow Problems
Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhon...
ESA
2006
Springer
113views Algorithms» more  ESA 2006»
9 years 2 months ago
An LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Alexander D. Scott, Gregory B. Sorkin
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
9 years 2 months ago
Minimum Transversals in Posi-modular Systems
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamoc...
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
9 years 2 months ago
The Price of Resiliency: A Case Study on Sorting with Memory Faults
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and ...
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
9 years 2 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
9 years 2 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
books