Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th SPAA 2005: Las Vegas, Nevada, USA
- Phillip B. Gibbons, Paul G. Spirakis:
SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA. ACM 2005, ISBN 1-58113-986-1
Queuing and scheduling
- Nir Andelman:
Randomized queue management for DiffServ. 1-10 - Hagit Attiya
, David Hay:
Randomization does not reduce the average delay in parallel packet switches. 11-20 - David Chase, Yossi Lev:
Dynamic circular work-stealing deque. 21-28 - Ajay Gulati, Peter J. Varman:
Lexicographic QoS scheduling for parallel I/O. 29-38
Joint session
- Thomas Moscibroda, Roger Wattenhofer:
Coloring unstructured radio networks. 39-48 - Ittai Abraham, Dahlia Malkhi:
Name independent routing for growth bounded networks. 49-55
Scheduling
- Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary length jobs on parallel machines. 56-65 - Grzegorz Malewicz:
Parallel scheduling of complex dags under uncertainty. 66-75 - Ami Litman, Shiri Moran-Schein:
On distributed smooth scheduling. 76-85 - Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. 86-95
Sensor networks and ad hoc networks
- Ioannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas:
An adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeployment. 96-105 - Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio:
Irrigating ad hoc networks in constant time. 106-115 - Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa:
Constant density spanners for wireless ad-hoc networks. 116-125
Peer-to-peer networks
- James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. 126-134 - Krishnaram Kenthapadi, Gurmeet Singh Manku:
Decentralized algorithms using both local and random probes for P2P load balancing. 135-144 - Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin:
Fast construction of overlay networks. 145-154 - Peter Mahlmann, Christian Schindelhauer:
Peer-to-peer networks based on random transformations of connected regular undirected graphs. 155-164
Parallel and quantum algorithms
- Piotr Sankowski:
Processor efficient parallel matching. 165-170 - Ryan Williams:
Parallelizing time with polynomial circuits. 171-175 - Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo:
Finding effective support-tree preconditioners. 176-185 - Lov K. Grover, Jaikumar Radhakrishnan:
Is partial quantum search of a database any easier? 186-194
Game theory
- Guido Proietti, Peter Widmayer:
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. 195-202 - Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish routing with incomplete information. 203-212
Brief announcements
- Bradley C. Kuszmaul:
A segmented parallel-prefix VLSI circuit with small delays for small segments. 213 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas:
A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniques. 214 - Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch:
Autonomous virtual mobile nodes. 215 - Kofi A. Laing, Rajmohan Rajaraman:
A space lower bound for name-independent compact routing in trees. 216 - Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter:
On competitive online read-many parallel disks scheduling. 217
Algorithms and data structures
- Christian Schindelhauer, Gunnar Schomaker:
Weighted distributed hash tables. 218-227 - Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul:
Concurrent cache-oblivious b-trees. 228-237 - Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. 238-244 - Chaiyasit Manovit, Sudheendra Hangal:
Efficient algorithms for verifying memory consistency. 245-252
Joint session
- Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit:
Using elimination to implement scalable and lock-free FIFO queues. 253-262 - Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with strangers to find own preferences. 263-269
Miscellaneous
- Marcin Bienkowski:
Dynamic page migration with stochastic requests. 270-278 - Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Broadcasting on networks of workstations. 279-288 - Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. 289-298 - 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. 299-308
Radio networks
- Robert Elsässer, Leszek Gasieniec:
Radio communication in random graphs: extended abstract. 309-315 - Costas Busch, Malik Magdon-Ismail, Jing Xi:
Oblivious routing on geometric networks. 316-324 - Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. 325-332
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
