6. SPAA 1994: Cape May, New Jersey, USA

• Shay Halperin, Uri Zwick:
  An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). 1-10
  
• John Greiner:
  A Comparison of Parallel Algorithms for Connected Components. 16-25
  
• Torsten Suel:
  Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes. 26-35
  
• Doug Ierardi:
  2d-Bubblesorting in Average time O(N lg N). 36-45
  
• Hui Li, Kenneth C. Sevcik:
  Parallel Sorting by Over Partitioning. 46-56
  
• Dan Suciu, Val Tannen:
  Efficient Compilation of High-Level Data Parallel Algorithms. 57-66
  
• Todd E. Rockoff:
  SIMD Instruction Cache. 67-75
  
• Eric J. Schwabe, Ian M. Sutherland:
  Improved Parity-Declustered Layouts for Disk Arrays. 76-84
  
• Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
  Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. 85-93
  
• Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
  Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. 94-103
  
• Margaret Reid-Miller:
  List Ranking and List Scan on the Cray C-90. 104-113
  
• John H. Reif, Stephen R. Tate:
  Dynamic Parallel Tree Contraction (Extended Abstract). 114-121
  
• Pangfeng Liu, Sandeep N. Bhatt:
  Experiences with Parallel N-Body Simulation. 122-131
  
• Clyde P. Kruskal, Kevin J. Rappoport:
  Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks. 132-139
  
• Micah Adler, John W. Byers:
  AT² Bounds for a Class of VLSI Problems and String Matching. 140-146
  
• Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
  An W(log log n) Lower Bound for Routing in Optical Networks. 147-156
  
• Hagit Attiya, Roy Friedman:
  Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). 157-166
  
• Nir Shavit, Asaph Zemach:
  Diffracting Trees (Preliminary Version). 167-176
  
• Phillip B. Gibbons, Ephraim Korach:
  On Testing Cache-Coherent Shared Memories. 177-188
  
• Jaswinder Pal Singh, Edward Rothberg, Anoop Gupta:
  Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems? 189-199
  
• John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu:
  Scheduling Parallelizable Tasks to Minimize Average Response Time. 200-209
  
• Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein:
  Job Scheduling in Rings. 210-219
  
• Raghu Subramanian, Isaac D. Scherson:
  An Analysis of Diffusive Load-Balancing. 220-225
  
• Bhaskar Ghosh, S. Muthukrishnan:
  Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). 226-235
  
• Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
  Efficient Low-Contention Parallel Algorithms. 236-247
  
• Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
  Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. 248-256
  
• Leslie Ann Goldberg, Yossi Matias, Satish Rao:
  An Optical Simulation of Shared Memory. 257-267
  
• Hisao Tamaki:
  Construction of the Mesh and the Torus Tolerating a Large Number of Faults. 268-277
  
• John H. Reif:
  O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices. 278-289
  
• Mauro Leoncini:
  How Much Can We Speedup Gaussian Elimination with Pivoting? 290-297
  
• Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby:
  Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems. 298-309
  
• Susan Hinrichs, Corey Kosak, David R. O'Hallaron, Thomas Stricker, Riichiro Take:
  An Architecture for Optimal All-to-All Personalized Communication. 310-319
  
• Himanshu Gupta, P. Sadayappan:
  Communication Efficient Matrix Multiplication on Hypercubes. 320-329
  
• John E. Savage:
  A Model for Multi-Grained Parallelism (Extended Abstract). 330-335
  
• Jerry Stamatopoulos, Jon A. Solworth:
  Increasing Network Bandwidth on Meshes. 336-345
  
• Michael Mitzenmacher:
  Bounds on the Greedy Routing Algorithm for Array Networks. 346-353
  
• Donald D. Chinn, Frank Thomson Leighton, Martin Tompa:
  Minimal Adaptive Routing on the Mesh with Bounded Queue Size. 354-363
  
• Smaragda Konstantinidou:
  Segment Router: A Novel Router Design for Parallel Computers. 364-373