|
|
Conferences in DBLP
- Nir Andelman
Randomized queue management for DiffServ. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:1-10 [Conf]
- Hagit Attiya, David Hay
Randomization does not reduce the average delay in parallel packet switches. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:11-20 [Conf]
- David Chase, Yossi Lev
Dynamic circular work-stealing deque. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:21-28 [Conf]
- Ajay Gulati, Peter J. Varman
Lexicographic QoS scheduling for parallel I/O. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:29-38 [Conf]
- Thomas Moscibroda, Roger Wattenhofer
Coloring unstructured radio networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:39-48 [Conf]
- Ittai Abraham, Dahlia Malkhi
Name independent routing for growth bounded networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:49-55 [Conf]
- Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift
Windows scheduling of arbitrary length jobs on parallel machines. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:56-65 [Conf]
- Grzegorz Malewicz
Parallel scheduling of complex dags under uncertainty. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:66-75 [Conf]
- Ami Litman, Shiri Moran-Schein
On distributed smooth scheduling. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:76-85 [Conf]
- Klaus Jansen, Hu Zhang
Scheduling malleable tasks with precedence constraints. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:86-95 [Conf]
- Ioannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas
An adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeployment. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:96-105 [Conf]
- Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio
Irrigating ad hoc networks in constant time. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:106-115 [Conf]
- Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa
Constant density spanners for wireless ad-hoc networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:116-125 [Conf]
- James Aspnes, Udi Wieder
The expansion and mixing time of skip graphs with applications. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:126-134 [Conf]
- Krishnaram Kenthapadi, Gurmeet Singh Manku
Decentralized algorithms using both local and random probes for P2P load balancing. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:135-144 [Conf]
- Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin
Fast construction of overlay networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:145-154 [Conf]
- Peter Mahlmann, Christian Schindelhauer
Peer-to-peer networks based on random transformations of connected regular undirected graphs. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:155-164 [Conf]
- Piotr Sankowski
Processor efficient parallel matching. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:165-170 [Conf]
- Ryan Williams
Parallelizing time with polynomial circuits. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:171-175 [Conf]
- Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo
Finding effective support-tree preconditioners. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:176-185 [Conf]
- Lov K. Grover, Jaikumar Radhakrishnan
Is partial quantum search of a database any easier? [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:186-194 [Conf]
- Guido Proietti, Peter Widmayer
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:195-202 [Conf]
- Martin Gairing, Burkhard Monien, Karsten Tiemann
Selfish routing with incomplete information. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:203-212 [Conf]
- Bradley C. Kuszmaul
A segmented parallel-prefix VLSI circuit with small delays for small segments. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:213- [Conf]
- Ioannis Chatzigiannakis, Sotiris E. Nikoletseas
A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniques. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:214- [Conf]
- Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch
Autonomous virtual mobile nodes. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:215- [Conf]
- Kofi A. Laing, Rajmohan Rajaraman
A space lower bound for name-independent compact routing in trees. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:216- [Conf]
- Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
On competitive online read-many parallel disks scheduling. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:217- [Conf]
- Christian Schindelhauer, Gunnar Schomaker
Weighted distributed hash tables. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:218-227 [Conf]
- Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul
Concurrent cache-oblivious b-trees. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:228-237 [Conf]
- Noga Alon, Yossi Azar, Shai Gutner
Admission control to minimize rejections and online set cover with repetitions. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:238-244 [Conf]
- Chaiyasit Manovit, Sudheendra Hangal
Efficient algorithms for verifying memory consistency. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:245-252 [Conf]
- Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
Using elimination to implement scalable and lock-free FIFO queues. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:253-262 [Conf]
- Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
Collaborate with strangers to find own preferences. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:263-269 [Conf]
- Marcin Bienkowski
Dynamic page migration with stochastic requests. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:270-278 [Conf]
- Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
Broadcasting on networks of workstations. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:279-288 [Conf]
- Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber
Traffic engineering of management flows by link augmentations on confluent trees. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:289-298 [Conf]
- Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou
Value-maximizing deadline scheduling and its application to animation rendering. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:299-308 [Conf]
- Robert Elsässer, Leszek Gasieniec
Radio communication in random graphs: extended abstract. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:309-315 [Conf]
- Costas Busch, Malik Magdon-Ismail, Jing Xi
Oblivious routing on geometric networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:316-324 [Conf]
- Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
Adversarial contention resolution for simple channels. [Citation Graph (0, 0)][DBLP]
SPAA, 2005, pp:325-332 [Conf]
|
