141
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
127
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
147
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
134
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...