Sciweavers

SPAA
2005
ACM
14 years 5 months ago
On distributed smooth scheduling
Ami Litman, Shiri Moran-Schein
SPAA
2005
ACM
14 years 5 months ago
Constant density spanners for wireless ad-hoc networks
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...
Kishore Kothapalli, Christian Scheideler, Melih On...
SPAA
2005
ACM
14 years 5 months ago
Broadcasting on networks of workstations
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
SPAA
2005
ACM
14 years 5 months ago
Decentralized algorithms using both local and random probes for P2P load balancing
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 (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
SPAA
2005
ACM
14 years 5 months ago
Irrigating ad hoc networks in constant time
Devdatt P. Dubhashi, C. Johansson, Olle Häggs...
SPAA
2005
ACM
14 years 5 months ago
Autonomous virtual mobile nodes
Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexand...
SPAA
2005
ACM
14 years 5 months ago
Dynamic circular work-stealing deque
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...
David Chase, Yossi Lev
SPAA
2005
ACM
14 years 5 months ago
Oblivious routing on geometric networks
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 ...
Costas Busch, Malik Magdon-Ismail, Jing Xi