- 2005
- Ittai Abraham, Dahlia Malkhi:
Name independent routing for growth bounded networks. SPAA 2005: 49-55 - Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. SPAA 2005: 238-244 - Nir Andelman:
Randomized queue management for DiffServ. SPAA 2005: 1-10 - Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou:
Value-maximizing deadline scheduling and its application to animation rendering. SPAA 2005: 299-308 - Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin:
Fast construction of overlay networks. SPAA 2005: 145-154 - James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134 - Hagit Attiya, David Hay:
Randomization does not reduce the average delay in parallel packet switches. SPAA 2005: 11-20 - Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with strangers to find own preferences. SPAA 2005: 263-269 - Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary length jobs on parallel machines. SPAA 2005: 56-65 - Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul:
Concurrent cache-oblivious b-trees. SPAA 2005: 228-237 - Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298 - Marcin Bienkowski:
Dynamic page migration with stochastic requests. SPAA 2005: 270-278 - Costas Busch, Malik Magdon-Ismail, Jing Xi:
Oblivious routing on geometric networks. SPAA 2005: 316-324 - David Chase, Yossi Lev:
Dynamic circular work-stealing deque. SPAA 2005: 21-28 - Ioannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas:
An adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeployment. SPAA 2005: 96-105 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas:
A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniques. SPAA 2005: 214 - Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Autonomous virtual mobile nodes. SPAA 2005: 215 - Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio:
Irrigating ad hoc networks in constant time. SPAA 2005: 106-115 - Robert Elsässer, Leszek Gasieniec:
Radio communication in random graphs: extended abstract. SPAA 2005: 309-315 - Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish routing with incomplete information. SPAA 2005: 203-212 - Lov K. Grover, Jaikumar Radhakrishnan:
Is partial quantum search of a database any easier? SPAA 2005: 186-194 - Ajay Gulati, Peter J. Varman:
Lexicographic QoS scheduling for parallel I/O. SPAA 2005: 29-38 - Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. SPAA 2005: 86-95 - Krishnaram Kenthapadi, Gurmeet Singh Manku:
Decentralized algorithms using both local and random probes for P2P load balancing. SPAA 2005: 135-144 - Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Broadcasting on networks of workstations. SPAA 2005: 279-288 - Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa:
Constant density spanners for wireless ad-hoc networks. SPAA 2005: 116-125 - Bradley C. Kuszmaul:
A segmented parallel-prefix VLSI circuit with small delays for small segments. SPAA 2005: 213 - Kofi A. Laing, Rajmohan Rajaraman:
A space lower bound for name-independent compact routing in trees. SPAA 2005: 216 - Ami Litman, Shiri Moran-Schein:
On distributed smooth scheduling. SPAA 2005: 76-85