1. SPAA 1989:
Santa Fe,
New Mexico,
USA
SPAA '89:
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures,
June 18-21,
1989,
Santa Fe,
New Mexico,
USA. ACM Press,
1989
- J. Y. Ngai, C. L. Setiz:
A Framework for Adaptive Routing in Multicomputer Networks.
1-9
Electronic Edition (ACM DL) BibTeX
- Alok Aggarwal, Ashok K. Chandra, Marc Snir:
On Communication Latency in PRAM Computations.
11-21
Electronic Edition (ACM DL) BibTeX
- Jeff I. Chu, Georg Schnitger:
The Communication Complexity of Several Problems in Matrix Computation.
22-31
Electronic Edition (ACM DL) BibTeX
- Clyde P. Kruskal, Marc Snir:
Cost-Bandwidth Tradeoffs for Communication Networks.
32-41
Electronic Edition (ACM DL) BibTeX
- C. P. Beigel, Clyde P. Kruskal:
Processor Networks and Interconnection Networks Without Long Wires.
42-51
Electronic Edition (ACM DL) BibTeX
- M. Y. Chan:
Embedding of d-Dimensional Grids into Optimal Hypercubes.
52-57
Electronic Edition (ACM DL) BibTeX
- Robert Cypher:
A Lower Bound on the Size of Shellsort Networks.
58-63
Electronic Edition (ACM DL) BibTeX
- C. Greg Plaxton:
Load Balancing, Selection Sorting on the Hypercube.
64-73
Electronic Edition (ACM DL) BibTeX
- Faith E. Fich, Avi Wigderson:
Towards Understanding Exclusive Read.
76-82
Electronic Edition (ACM DL) BibTeX
- Stephen J. Bellantoni:
Parallel RAMs with Bounded Memory Wordsize.
83-91
Electronic Edition (ACM DL) BibTeX
- Tak Wah Lam, Walter L. Ruzzo:
The Power of Parallel Pointer Manipulation.
92-102
Electronic Edition (ACM DL) BibTeX
- Scot W. Hornick, Franco P. Preparata:
Deterministic P-RAM Simulation with Constant Redundancy.
103-109
Electronic Edition (ACM DL) BibTeX
- Xiaotie Deng:
On the Parallel Complexity of Integer Programming.
110-116
Electronic Edition (ACM DL) BibTeX
- Dennis Shasha, Kaizhong Zhang:
Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees.
117-126
Electronic Edition (ACM DL) BibTeX
- Michael T. Goodrich:
Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors.
127-137
Electronic Edition (ACM DL) BibTeX
- Amotz Bar-Noy, Danny Peleg:
Square Meshes Are Not Always Optimal.
138-147
Electronic Edition (ACM DL) BibTeX
- C. A. Philips:
Parallel Graph Contraction.
148-157
Electronic Edition (ACM DL) BibTeX
- Phillip B. Gibbons:
A More practical PRAM Model.
158-168
Electronic Edition (ACM DL) BibTeX
- Richard Cole, Ofer Zajicek:
The APRAM: Incorporating Asynchrony into the PRAM Model.
169-178
Electronic Edition (ACM DL) BibTeX
- Fred S. Annexstein:
Fault Tolerance in Hypercube-Derivative Networks.
179-188
Electronic Edition (ACM DL) BibTeX
- Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan:
Locating Faults in a Constant Number of Parallel Testing Rounds.
189-198
Electronic Edition (ACM DL) BibTeX
- Richard Fujimoto:
The Virtual Time Machine.
199-208
Electronic Edition (ACM DL) BibTeX
- Yehuda Afek, Geoffrey M. Brown, Michael Merritt:
A Lazy Cache Algorithm.
209-222
Electronic Edition (ACM DL) BibTeX
- Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
Dynamic Tree Embeddings in Butterflies and Hypercubes.
224-234
Electronic Edition (ACM DL) BibTeX
- Gregory E. Shannon:
Optimal On-Line Load Balancing.
235-245
Electronic Edition (ACM DL) BibTeX
- Yijie Han:
Matching Partition a Linked List and Its Optimization.
246-253
Electronic Edition (ACM DL) BibTeX
- Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays.
254-264
Electronic Edition (ACM DL) BibTeX
- Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh:
Optimal VLSI Architectures for Multidimensional DFT.
265-272
Electronic Edition (ACM DL) BibTeX
- Shaodi Gao, Michael Kaufmann, F. Miller Maley:
Advances in Homotopic Layout Compaction.
273-282
Electronic Edition (ACM DL) BibTeX
- Clark D. Thomborson, Belle W. Y. Wei:
Systolic Implementations of a Move-to-Front Text Compressor.
283-290
Electronic Edition (ACM DL) BibTeX
- A. Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips:
Four Vector-Matrix Primitives.
292-302
Electronic Edition (ACM DL) BibTeX
- Doug Baxter, Ravi Mirchandaney, Joel H. Saltz:
Run-Time Parallelization and Scheduling of Loops.
303-312
Electronic Edition (ACM DL) BibTeX
- De-Lei Lee, Y. H. Wang:
Conflict-Free Access of Arrays in a Parallel Processor.
313-317
Electronic Edition (ACM DL) BibTeX
- Shimon Even, Burkhard Monien:
On the Number of Rounds Necessary to Disseminate Information.
318-327
Electronic Edition (ACM DL) BibTeX
- Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis:
A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues.
328-335
Electronic Edition (ACM DL) BibTeX
- Manfred Kunde, Thomas Tensi:
Multi-Packet-Routing on Mesh Connected Arrays.
336-343
Electronic Edition (ACM DL) BibTeX
- Prabhakar Raghavan:
Robust Algorithms for Packet Routing in a Mesh.
344-350
Electronic Edition (ACM DL) BibTeX
- Thomas F. Knight Jr.:
Technologies for Low Latency Interconnection Switches.
351-358
Electronic Edition (ACM DL) BibTeX
- Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary.
360-368
Electronic Edition (ACM DL) BibTeX
- Joan M. Lucas, Marian Gunsher Sackrowitz:
Efficient Parallel Algorithms for Path Problems in Directed Graphs.
369-377
Electronic Edition (ACM DL) BibTeX
- Marek Chrobak, Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph.
379-387
Electronic Edition (ACM DL) BibTeX
- Zvi M. Kedem, Gad M. Landau, Krishna V. Palem:
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
388-398
Electronic Edition (ACM DL) BibTeX
- Roberto Tamassia, Jeffrey Scott Vitter:
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.
399-408
Electronic Edition (ACM DL) BibTeX
- Richard M. Karp, Yanjun Zhang:
On Parallel Evaluation of Game Trees.
409-420
Electronic Edition (ACM DL) BibTeX
- Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
Constructing Trees in Parallel.
421-431
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:42:06 2009
by Michael Ley (ley@uni-trier.de)
