3. SPAA 1991: Hilton Head, South Carolina, USA

• Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha:
  A Comparison of Sorting Algorithms for the Connection Machine CM-2. 3-16
  
• Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas:
  Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). 17-28
  
• Mark H. Nodine, Jeffrey Scott Vitter:
  Large-Scale Sorting in Parallel Memories (Extended Abstract). 29-39
  
• Abhiram G. Ranade:
  Optimal Speedup for Backtrack Search on a butterfly Network. 40-48
  
• Holger Bast, Torben Hagerup:
  Fast and Reliable Parallel Hashing. 50-61
  
• Shiva Chaudhuri:
  Tight Bounds for the Chaining Problem. 62-70
  
• Lawrence L. Larmore, Teresa M. Przytycka:
  Parallel Construction of Trees with Optimal Weighted Path Length. 71-80
  
• Thomas H. Spencer:
  More Time-Work Tradeoffs for Parallel Graph Algorithms. 81-93
  
• Richard N. Draper:
  An Overview of Supertoroidal Networks. 95-102
  
• Joonwon Lee, Umakishore Ramachandran:
  Architectural Primitives for a Scalable Shared Memory Multiprocessor. 103-114
  
• Fung F. Lee, Michael J. Flynn:
  Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations. 115-122
  
• William Aiello, Frank Thomson Leighton:
  Coding Theory, Hypercube Embeddings, and Fault Tolerance. 125-136
  
• Bojana Obrenic:
  Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version). 137-146
  
• Burkhard Monien:
  Simulating Binary Trees on X-Trees (Extended Abstract). 147-158
  
• Bojana Obrenic:
  An Approach to Emulating Separable Graphs (preliminary Version). 159-167
  
• Michael T. Goodrich:
  Constructing Arrangements Optimally in Parallel (Preliminary Version). 169-179
  
• Erich Kaltofen, Victor Y. Pan:
  Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. 180-191
  
• Mujtaba R. Ghouse, Michael T. Goodrich:
  In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). 192-203
  
• Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay:
  Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). 204-214
  
• G. N. Srinivasa Prasanna, Bruce R. Musicus:
  Generalised Multiprocessor Scheduling Using Optimal Control. 216-228
  
• Maurice Herlihy, J. Eliot B. Moss:
  Lock-Free garbage Collection for Multiprocessors. 229-236
  
• Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal:
  A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. 237-245
  
• George D. Stamoulis, John N. Tsitsiklis:
  The Efficiency of Greedy Routing in Hypercubes and Butterflies. 248-259
  
• Manfred Kunde:
  Balanced Routing: Towards the Distance Bound on Grids. 260-271
  
• Geng Lin, Nicholas Pippenger:
  Parallel Algorithms for Routing in Non-Blocking Networks. 272-277
  
• Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz:
  Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks. 278-290
  
• Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo:
  Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). 292-303
  
• Hagit Attiya, Jennifer L. Welch:
  Sequential Consistency Versus Linearizability (Extended Abstract). 304-315
  
• Kourosh Gharachorloo, Phillip B. Gibbons:
  Detecting Violations of Sequential Consistency. 316-326
  
• Maurice Herlihy:
  Impossibility Results for Asynchronous PRAM (Extended Abstract). 327-336
  
• Marios C. Papaefthymiou:
  Understanding Retiming Through Maximum Average-Weight Cycles. 338-348
  
• Matthias F. M. Stallmann:
  A One-Way Array Algorithm for Matroid Scheduling. 349-356
  
• Shimon Even, Ami Litman:
  On the Capabilities of Systolic Systems (Extended Abstract). 357-367
  

Last update Sat May 18 19:49:30 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page