5. SPAA 1993:
Velen,
Germany
SPAA '93:
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures,
June 30 - July 2,
1993,
Velen,
Germany. ACM Press,
1993
- Jehoshua Bruck, Robert Cypher, Ching-Tien Ho:
Fault-Tolerant Meshes with Small Degree.
1-10
Electronic Edition (ACM DL) BibTeX
- Fong Pong, Michel Dubois:
The Verification of Cache Coherence Protocols.
11-20
Electronic Edition (ACM DL) BibTeX
- Richard Beigel, Grigorii Margulis, Daniel A. Spielman:
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds.
21-29
Electronic Edition (ACM DL) BibTeX
- Frank Thomson Leighton, Yuan Ma:
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults.
30-41
Electronic Edition (ACM DL) BibTeX
- Marc Snir:
Scalable Parallel Computing: The IBM 9076 Scalable POWERparallel 1.
42
Electronic Edition (ACM DL) BibTeX
- Philip N. Klein:
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling.
43-49
Electronic Edition (ACM DL) BibTeX
- Joseph Cheriyan, John H. Reif:
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems.
50-56
Electronic Edition (ACM DL) BibTeX
- Edith Cohen:
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition.
57-67
Electronic Edition (ACM DL) BibTeX
- David May:
Components for Computing and Communications.
68
Electronic Edition (ACM DL) BibTeX
- S. Muthukrishnan, Krishna V. Palem:
Highly Efficient Dictionary Matching in Parallel.
69-78
Electronic Edition (ACM DL) BibTeX
- Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Pattern Matching.
79-85
Electronic Edition (ACM DL) BibTeX
- Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices.
86-97
Electronic Edition (ACM DL) BibTeX
- John R. Nickolls, Jochen Reusch:
Autonomous SIMD Flexibility in the MP-1 and MP-2.
98-99
Electronic Edition (ACM DL) BibTeX
- Andrea Pietracaprina, Franco P. Preparata:
A Practical Constructive Scheme for Deterministic Shared-Memory Access.
100-109
Electronic Edition (ACM DL) BibTeX
- Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Simple, Efficient Shared Memory Simulations.
110-119
Electronic Edition (ACM DL) BibTeX
- Mark H. Nodine, Jeffrey Scott Vitter:
Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors.
120-129
Electronic Edition (ACM DL) BibTeX
- Thomas H. Cormen, Leonard F. Wisniewski:
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems.
130-139
Electronic Edition (ACM DL) BibTeX
- Andreas Nowatzyk, M. Monger, Michael Parkin, Edmund J. Kelly, Michael C. Browne, Gunes Aybay, David Lee:
The S3.mp Architecture: A Local Area Multiprocessor.
140-141
Electronic Edition (ACM DL) BibTeX
- Richard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser:
Optimal Broadcast and Summation in the LogP Model.
142-153
Electronic Edition (ACM DL) BibTeX
- Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
An Atomic Model for Message-Passing.
154-163
Electronic Edition (ACM DL) BibTeX
- Reinhard Lüling, Burkhard Monien:
A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance.
164-172
Electronic Edition (ACM DL) BibTeX
- Robert Cypher, Smaragda Konstantinidou:
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers.
173-181
Electronic Edition (ACM DL) BibTeX
- Joe Brandenburg:
Technology Advances in the Intel Paragon System.
182
Electronic Edition (ACM DL) BibTeX
- B. Narendran, Renato De Leone, Prasoon Tiwari:
An Implementation of the epsilon-Relaxation Algorithm on the CM-5.
183-192
Electronic Edition (ACM DL) BibTeX
- Albert G. Greenberg, Boris D. Lubachevsky, Li-C. Wang:
Experience in Massively Parallel Discrete Event Simulation.
193-202
Electronic Edition (ACM DL) BibTeX
- Anja Feldmann, Thomas Stricker, Thomas E. Warfel:
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches.
203-212
Electronic Edition (ACM DL) BibTeX
- Duncan Roweth:
The Meiko CS-2 System Architecture.
213
Electronic Edition (ACM DL) BibTeX
- Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter:
Parallel Construction of Optimal Alphabetic Trees.
214-223
Electronic Edition (ACM DL) BibTeX
- Philip D. MacKenzie, Quentin F. Stout:
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs.
224-229
Electronic Edition (ACM DL) BibTeX
- Joseph JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem.
230-239
Electronic Edition (ACM DL) BibTeX
- Bernd Wiesen:
Scalable Hardware and Scalable Software : The nCUBE System.
240
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch:
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.
241-250
Electronic Edition (ACM DL) BibTeX
- Mustaque Ahamad, Rida A. Bazzi, Ranjit John, Prince Kohli, Gil Neiger:
The Power of Processor Consistency.
251-260
Electronic Edition (ACM DL) BibTeX
- Greg Barnes:
A Method for Implementing Lock-Free Shared-Data Structures.
261-270
Electronic Edition (ACM DL) BibTeX
- Wilfried Oed, Martin Walker:
An Overview of Cray Research Computers Including the Y-MP/C90 and the new MPP T3D.
271-272
Electronic Edition (ACM DL) BibTeX
- Eli Upfal, Sergio Feleprin, Marc Snir:
Randomized routing with shorter paths.
273-282
Electronic Edition (ACM DL) BibTeX
- Pierre Kelsen:
Fast Parallel Matching in Expander Graphs.
293-299
Electronic Edition (ACM DL) BibTeX
- Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao:
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.
300-309
Electronic Edition (ACM DL) BibTeX
- Falk Langhammer:
Scalable Operating Systems, or What Do a Million Processors Mean?
310
Electronic Edition (ACM DL) BibTeX
- Lenwood S. Heath:
Lower Bounds for Graph Embeddings via Algebraic Topology.
311-317
Electronic Edition (ACM DL) BibTeX
- David S. Greenberg:
Efficient Wiring of Reconfigurable Parallel Processors.
318-324
Electronic Edition (ACM DL) BibTeX
- Christos Kaklamanis, Danny Krizanc, Satish Rao:
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.
325-334
Electronic Edition (ACM DL) BibTeX
- Steven Frank:
KRS1: High Performance and Ease of Programming, No Longer an Oxymoron.
335
Electronic Edition (ACM DL) BibTeX
- Serap A. Savari:
Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms.
336-345
Electronic Edition (ACM DL) BibTeX
- Torben Hagerup, Rajeev Raman:
Fast Deterministic Approximate and Exact Parallel Sorting.
346-355
Electronic Edition (ACM DL) BibTeX
- Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters.
356-364
Electronic Edition (ACM DL) BibTeX
- S. Lennart Johnsson:
The Connection Machine Systems CM-5.
365-366
Electronic Edition (ACM DL) BibTeX
- Thomas W. Reps:
Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism.
367-376
Electronic Edition (ACM DL) BibTeX
- Thomas J. Sheffler:
Implementing the Multiprefix Operation on Parallel and Vector Computers.
377-386
Electronic Edition (ACM DL) BibTeX
- Richard E. Ladner, Jordan Lampe, Richard A. Rogers:
Vector Prefix Addition on Sub-Bus Mesh Computers.
387-396
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:42:07 2009
by Michael Ley (ley@uni-trier.de)
