ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
µKlaim is a process language that permits programming distributed systems made up of several mobile components interacting through multiple distributed tuple spaces. We present th...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...