ESA
2006
Springer
13 years 7 months ago
2006
Springer
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...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
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...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
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 ...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
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...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
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...