Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th 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 - Jehoshua Bruck
, Robert Cypher, Ching-Tien Ho:
Fault-Tolerant Meshes with Small Degree. 1-10 - Fong Pong, Michel Dubois:
The Verification of Cache Coherence Protocols. 11-20 - 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 - Marc Snir:
Scalable Parallel Computing: The IBM 9076 Scalable POWERparallel 1. 42 - 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 - Edith Cohen:
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. 57-67 - David May:
Components for Computing and Communications. 68 - S. Muthukrishnan, Krishna V. Palem:
Highly Efficient Dictionary Matching in Parallel. 69-78 - Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Pattern Matching. 79-85 - Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. 86-97 - John R. Nickolls, Jochen Reusch:
Autonomous SIMD Flexibility in the MP-1 and MP-2. 98-99 - 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 - Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
An Atomic Model for Message-Passing. 154-163 - 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 - Joe Brandenburg:
Technology Advances in the Intel Paragon System. 182 - 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 - Duncan Roweth:
The Meiko CS-2 System Architecture. 213 - 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 F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. 230-239 - Bernd Wiesen:
Scalable Hardware and Scalable Software : The nCUBE System. 240 - 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 - Greg Barnes:
A Method for Implementing Lock-Free Shared-Data Structures. 261-270 - Wilfried Oed, Martin Walker:
An Overview of Cray Research Computers Including the Y-MP/C90 and the new MPP T3D. 271-272 - Eli Upfal, Sergio A. Felperin, Marc Snir:
Randomized routing with shorter paths. 273-282 - Pierre Kelsen:
Fast Parallel Matching in Expander Graphs. 293-299 - 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 - Falk Langhammer:
Scalable Operating Systems, or What Do a Million Processors Mean? 310 - Lenwood S. Heath:
Lower Bounds for Graph Embeddings via Algebraic Topology. 311-317 - David S. Greenberg:
Efficient Wiring of Reconfigurable Parallel Processors. 318-324 - Christos Kaklamanis, Danny Krizanc, Satish Rao:
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies. 325-334 - Steven Frank:
KRS1: High Performance and Ease of Programming, No Longer an Oxymoron. 335 - Serap A. Savari:
Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms. 336-345 - Torben Hagerup, Rajeev Raman:
Fast Deterministic Approximate and Exact Parallel Sorting. 346-355 - Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters. 356-364 - S. Lennart Johnsson:
The Connection Machine Systems CM-5. 365-366 - Thomas W. Reps:
Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism. 367-376 - 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
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-03 19:46 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:
