2924 search results - page 70 / 585 » Lower Bounds in Distributed Computing |
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
ANTS
2006
Springer
14 years 20 days ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
TCC
2007
Springer
14 years 3 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
GCC
2003
Springer
14 years 2 months ago
2003
Springer