Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar5th SPAA 1993: Velen, Germany
Lawrence Snyder:
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '93, Velen, Germany, June 30 - July 2, 1993. ACM 1993, ISBN 0-89791-599-2- Richard Beigel, Grigorii Margulis, Daniel A. Spielman:
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds. 21-29 - Frank Thomson Leighton, Yuan Ma:
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults. 30-41 - Philip N. Klein:
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling. 43-49 - Joseph Cheriyan, John H. Reif:
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. 50-56 - Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. 86-97 - Andrea Pietracaprina, Franco P. Preparata:
A Practical Constructive Scheme for Deterministic Shared-Memory Access. 100-109 - Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Simple, Efficient Shared Memory Simulations. 110-119 - Mark H. Nodine, Jeffrey Scott Vitter:
Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors. 120-129 - Thomas H. Cormen, Leonard F. Wisniewski:
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. 130-139 - 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 - Richard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser:
Optimal Broadcast and Summation in the LogP Model. 142-153 - Reinhard Lüling, Burkhard Monien:
A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. 164-172 - Robert Cypher, Smaragda Konstantinidou:
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers. 173-181 - B. Narendran, Renato De Leone, Prasoon Tiwari:
An Implementation of the epsilon-Relaxation Algorithm on the CM-5. 183-192 - Albert G. Greenberg, Boris D. Lubachevsky, Li-C. Wang:
Experience in Massively Parallel Discrete Event Simulation. 193-202 - Anja Feldmann, Thomas Stricker, Thomas E. Warfel:
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches. 203-212 - Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter:
Parallel Construction of Optimal Alphabetic Trees. 214-223 - Philip D. MacKenzie, Quentin F. Stout:
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs. 224-229 - Joseph JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. 230-239 - Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch:
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. 241-250 - Mustaque Ahamad, Rida A. Bazzi, Ranjit John, Prince Kohli, Gil Neiger:
The Power of Processor Consistency. 251-260 - Wilfried Oed, Martin Walker:
An Overview of Cray Research Computers Including the Y-MP/C90 and the new MPP T3D. 271-272 - 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 - Christos Kaklamanis, Danny Krizanc, Satish Rao:
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. 325-334 - Thomas J. Sheffler:
Implementing the Multiprefix Operation on Parallel and Vector Computers. 377-386 - Richard E. Ladner, Jordan Lampe, Richard A. Rogers:
Vector Prefix Addition on Sub-Bus Mesh Computers. 387-396
maintained by 
, founded at 
, founded at 
last updated on 2019-03-24 23:04 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
