2924 search results - page 82 / 585 » Lower Bounds in Distributed Computing |
CONCUR
2008
Springer
15 years 4 months ago
2008
Springer
IPPS
2010
IEEE
15 years 11 days ago
2010
IEEE
146
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
111
click to vote
MST
2002
15 years 2 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...