2924 search results - page 118 / 585 » Lower Bounds in Distributed Computing |
107
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
131
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
118
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
119
click to vote
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
147
click to vote
DC
2010
15 years 2 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...