Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SPAA 2004: Barcelona, Catalonia, Spain
- Phillip B. Gibbons, Micah Adler:
SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain. ACM 2004, ISBN 1-58113-840-7
Routing 1
- Adi Rosén, Michael S. Tsirkin:
On delivery times in packet networks under adversarial traffic. 1-10 - Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles:
Adaptive channel queue routing on k-ary n-cubes. 11-19 - Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan
, Mikkel Thorup:
Compact name-independent routing with minimum stretch. 20-24
Peer-To-peer systems
- Kirsten Hildrum, Robert Krauthgamer, John Kubiatowicz:
Object location in realistic networks. 25-35 - David R. Karger, Matthias Ruhl:
Simple efficient load balancing algorithms for peer-to-peer systems. 36-43 - Baruch Awerbuch, Christian Scheideler:
Consistent and compact data management in distributed storage systems. 44-53 - John W. Byers, Jeffrey Considine, Michael Mitzenmacher:
Geometric generalizations of the power of two choices. 54-63
Caching I
- Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Fighting against two adversaries: page migration in dynamic networks. 64-73 - Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani:
Online hierarchical cooperative caching. 74-83 - Susanne Albers:
New results on web caching with request reordering. 84-92
Routing II
- Dan Guez, Alexander Kesselman, Adi Rosén:
Packet-mode policies for input-queued switches. 93-102 - Fan R. K. Chung, Ronald L. Graham, George Varghese:
Parallelism versus memory allocation in pipelined router forwarding engines. 103-111 - Gary L. Miller, Peter C. Richter:
Lower bounds for graph embeddings and combinatorial preconditioners. 112-119
Algorithms
- Konstantin Andreev, Harald Räcke:
Balanced graph partitioning. 120-124 - Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram:
Bi-criteria algorithm for scheduling jobs on cluster platforms. 125-132 - Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson:
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. 133-144 - Aaron Windsor:
An NC algorithm for finding a maximal acyclic set in a graph. 145-150
Networks I
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide:
Scheduling against an adversarial network. 151-159 - Yi Cui, Baochun Li, Klara Nahrstedt:
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions. 160-169 - Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober:
Pagoda: a dynamic overlay network for routing, data management, and multicasting. 170-179
Algorithmic game theory
- Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo:
Sharing the cost of multicast transmissions in wireless networks. 180-187 - Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish load balancing and atomic congestion games. 188-195 - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano:
How to route and tax selfish unsplittable traffic. 196-205
Shared memory and architecture
- Danny Hendler, Nir Shavit, Lena Yerushalmi:
A scalable lock-free stack algorithm. 206-215 - Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS is not a silver bullet for nonblocking algorithm design. 216-224 - John Y. Oliver, Venkatesh Akella, Frederic T. Chong:
Efficient orchestration of sub-word parallelism in media processors. 225-234
Caching II
- Guy E. Blelloch, Phillip B. Gibbons:
Effectively sharing a cache among threads. 235-244 - Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious shortest paths in graphs using buffer heap. 245-254 - Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter:
Online algorithms for prefetching and caching on parallel disks. 255-264
SPAA revue
- David P. Bunde, Yishay Mansour:
Improved combination of online algorithms for acceptance and rejection. 265-266 - Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms. 267-268 - Hagit Attiya, David Hay:
The inherent queuing delay of parallel packet switches. 269-270 - Vicent Cholvi, Pascal Felber, Ernst W. Biersack:
Efficient search in unstructured peer-to-peer networks. 271-272 - Yuu Tanaka, Toshinori Sato, Takenori Koushiro:
The potential in energy efficiency of a speculative chip-multiprocessor. 273-274
Networks II
- Adam Meyerson:
Online algorithms for network design. 275-280 - Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. 281-285 - Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The effect of faults on network expansion. 286-293
Distributed computation
- Fabian Kuhn, Roger Wattenhofer:
Dynamic analysis of the arrow distributed protocol. 294-301 - Philippe Raipin Parvédy, Michel Raynal:
Optimal early stopping uniform consensus in synchronous systems with process omission failures. 302-310 - Dariusz R. Kowalski, Alexander A. Shvartsman:
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. 311-320
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-05-10 18:45 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:
