2924 search results - page 82 / 585 » Lower Bounds in Distributed Computing |
VECPAR
2000
Springer
14 years 15 days ago
2000
Springer
CONCUR
2008
Springer
13 years 10 months ago
2008
Springer
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
FCT
2005
Springer
14 years 2 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 ...
MST
2002
13 years 8 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...