default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SPAA 2001: Heraklion, Crete, Greece
- Arnold L. Rosenberg:
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001. ACM 2001, ISBN 1-58113-409-6
Routing I
- Mikkel Thorup, Uri Zwick
:
Compact routing schemes. 1-10 - Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Routing without flow control. 11-20 - Ami Litman, Shiri Moran-Schein:
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. 21-31
Routing II
- Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
One-to-Many routing on the mesh. 31-37 - Petr Kolman, Christian Scheideler:
Simple on-line algorithms for the maximum disjoint paths problem. 38-47 - Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol. 48-52 - Ellen L. Hahne, Alexander Kesselman, Yishay Mansour:
Competitve buffer management for shared-memory switches. 53-58
Networks
- Anders Dessmark, Andrzej Pelc:
Tradeoffs between knowledge and time of communication in geometric radio networks. 59-66 - Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis:
Attack propagation in networks. 67-76 - Shay Kutten, David Peleg, Uzi Vishkin:
Deterministic resource discovery in distributed networks. 77-83 - Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Latency effects on reachability in large-scale peer-to-peer networks. 84-92
Architecture and Programming Models
- Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin:
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. 93-102 - Francisca Quintana, Jesús Corbal, Roger Espasa, Mateo Valero:
A cost effective architecture for vectorizable numerical and multimedia applications. 103-112 - Anne Condon, Alan J. Hu:
Automatable verification of sequential consistency. 113-121
Data Management and Program Control
- Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons:
Room synchronizations. 122-133 - Philippas Tsigas, Yi Zhang:
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. 134-143 - Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Computational power of pipelined memory hierarchies. 144-152 - Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev:
Optimal semi-oblique tiling. 153-162
Parallel Discrete Algorithms
- Hadas Shachnai, Aravind Srinivasan:
Finding large independent sets of hypergraphs in parallel. 163-168 - Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski:
Columnsort lives! an efficient out-of-core sorting program. 169-178 - Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho:
Efficient parallel exponentiation in GF(2n) using normal basis representations. 179-188
Scheduling
- Panagiota Fatourou:
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. 189-198 - Pierre-François Dutot, Denis Trystram:
Scheduling on hierarchical clusters using malleable tasks. 199-208 - Yanyong Zhang, Anand Sivasubramaniam:
Scheduling best-effort and real-time pipelined applications on time-shared clusters. 209-219
Data Management
- Mahesh Kallahalla, Peter J. Varman:
Optimal prefetching and caching for parallel I/O systems. 219-228 - Myra B. Cohen, Charles J. Colbourn:
Ordering disks for double erasure codes. 229-236 - Christof Krick, Harald Räcke, Matthias Westermann:
Approximation algorithms for data management in networks. 237-246 - Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri:
A data tracking scheme for general networks. 247-254
Parallel Algorithms
- Robert Elsässer, Thomas Lücking, Burkhard Monien:
New spectral bounds on k-partitioning of graphs. 255-262 - Gábor Ivanyos, Frédéric Magniez, Miklos Santha:
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. 263-270 - Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto:
Towards practical deteministic write-all algorithms. 271-280 - Phillip B. Gibbons, Srikanta Tirthapura:
Estimating simple functions on the union of data streams. 281-291
Fault Tolerance
- Achour Mostéfaoui, Michel Raynal:
Randomized k-set agreement. 291-297 - Marek Piotrów:
Periodic, random-fault-tolerant correction networks. 298-305
SPAA Revue I
- Yongbing Zhang, Xiaohua Jia, Sajal K. Das:
D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks. 308-309 - Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot:
A note on cycle covering. 310-311 - Stefan D. Bruda, Selim G. Akl:
Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems. 312-313 - Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling tasks with small communication delays for clusters of processors. 314-315 - Thomas Rauber, Robert Reilein, Gudula Rünger:
Library support for orthogonal processor groups. 316-317 - Frédéric Havet, Marc Wennink:
The push tree problem. 318-319 - Ulf Lorenz:
Parallel controlled conspiracy number search. 320-321
SPAA Revue II
- Martin Griebl:
On tiling space-time mapped loop nests. 322-323 - Jean-Guillaume Dumas, Jean-Louis Roch:
A parallel block algorithm for exact triangularization of rectangular matrices. 324-325 - Mikel Larrea, Antonio Fernández, Sergio Arévalo:
Eventually consistent failure detectors. 326-327 - Will McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger:
Finding strongly connected components in parallel in particle transport sweeps. 328-329 - Thierry Garcia, Jean Frédéric Myoupo, David Semé:
A work-optimal CGM algorithm for the LIS problem. 330-331 - Victor Luchangco:
Modeling weakly consistent memories with locks. 332-333 - David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter:
The power of duality for prefetching and sorting with parallel disks. 334-335
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 2025-02-03 20:02 CET 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:
