4. SPAA 1992: San Diego, California, USA

• Pablo E. Berman, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz:
  Adaptive Deadlock- and Livelock-Free Routing with all Minimal Paths in Torus Networks. 3-12
  
• Amotz Bar-Noy, Shlomo Kipnis:
  Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. 13-22
  
• Christos Kaklamanis, Danny Krizanc, Satish Rao:
  Simple Path Selection for Optimal Routing on Processor Arrays. 23-30
  
• Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn:
  Matching the Bisection Bound for Routing and Sorting on the Mesh. 31-40
  
• Mihály Geréb-Graus, Thanasis Tsantilas:
  Efficient Optical Communication in Parallel Computers. 41-48
  
• Christos Kaklamanis, Danny Krizanc:
  Optimal Sorting on Mesh-Connected Processor Arrays. 50-59
  
• Shimon Even, Ami Litman:
  Layered Cross Product - A Technique to Construct Interconnection Networks. 60-69
  
• C. Greg Plaxton, Torsten Suel:
  A Lower Bound for Sorting Networks Based on the Shuffle Permutation. 70-79
  
• Robert F. Chamberlain, Charles M. Fiduccia:
  Universality of Iterated Networks. 80-89
  
• Martin L. Brady, Whanki Yong:
  Fast Parallel Discrete Approximation Algorithms for the Radon Transform. 91-99
  
• Susanne E. Hambrusch, Xin He, Russ Miller:
  Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer. 100-108
  
• Ernst W. Mayr, Ralph Werchner:
  Optimal Routing of Parentheses on the Hypercube. 109-117
  
• Christos Kaklamanis, Giuseppe Persiano:
  Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. 118-126
  
• Abhiram G. Ranade:
  Maintaining Dynamic Ordered Sets on Processor Networks. 127-137
  
• Xiangdong Yu, Dipak Ghosal:
  Optimal Dynamic Scheduling of Task Tree on Constant-Dimensional Architectures. 138-146
  
• Thomas Stricker:
  Supporting the Hypercube Programming Model on Mesh Architectures: A Fast Sorter for iWarp Tori. 148-157
  
• William L. Hightower, Jan Prins, John H. Reif:
  Implementations of Randomized Sorting on Large Parallel Machines. 158-167
  
• Richard J. Anderson, João C. Setubal:
  On the Parallel Implementation of Goldberg's Maximum Flow Algorithm. 168-177
  
• B. Narendran, Prasoon Tiwari:
  Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm. 178-187
  
• Ramesh Subramonian:
  Designing Synchronous Algorithms for Asynchronous Processors. 189-198
  
• Richard J. Anderson:
  Primitives for Asynchronous List Compression. 199-208
  
• Anja Feldmann, Thomas R. Gross, David R. O'Hallaron, Thomas Stricker:
  Subset Barrier Synchronization on a Private-Memory Parallel System. 209-218
  
• Maurice Herlihy, Beng-Hong Lim, Nir Shavit:
  Low Contention Load Balancing on Large-Scale Multiprocessors. 219-227
  
• Nicholas Pippenger, Geng Lin:
  Fault-Tolerant Circuit-Switching Networks. 229-235
  
• Sivan Toledo:
  Competitive Fault-Tolerance in Area-Universal Networks. 236-246
  
• Hisao Tamaki:
  Robust Bounded-Degree Networks with Small Diameters. 247-256
  
• Alan Gibbons, Mike Paterson:
  Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. 257-263
  
• David Bruce Wilson:
  Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract). 264-270
  
• Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak:
  The Network Architecture of the Connection Machine CM-5 (Extended Abstract). 272-285
  
• Frederic T. Chong, Thomas F. Knight Jr.:
  Design and Performance of Multipath MIN Architectures. 286-295
  
• Susan R. Dickey, Richard Kenner:
  Hardware Combining and Scalability. 296-305
  
• Phillip B. Gibbons, Michael Merritt:
  Specifying Non-Blocking Shared Memories (Extended Abstract). 306-315
  
• Jeffrey M. Arnold, Duncan A. Buell, Elaine G. Davis:
  Splash 2. 316-322
  
• John Turek, Joel L. Wolf, Philip S. Yu:
  Approximate Algorithms Scheduling Parallelizable Tasks. 323-332
  
• Wolfgang Backes, Uwe Schwiegelshohn, Lothar Thiele:
  Analysis of Free Schedule in Periodic Graphs. 333-342
  
• Deganit Armon, John H. Reif:
  Space and Time Efficient Implementations of Parallel Nested Dissection. 344-352
  
• Yijie Han, Victor Y. Pan, John H. Reif:
  Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. 353-362
  
• Donald B. Johnson, Panagiotis Takis Metaxas:
  A Parallel Algorithm for Computing Minimum Spanning Trees. 363-372
  
• David R. Karger, Noam Nisan, Michal Parnas:
  Fast Connected Components Algorithms for the EREW PRAM. 373-381
  
• Edward F. Grove:
  Connected Components and the Interval Graph. 382-391
  
• Baba C. Vemuri, R. Varadarajan, Niranjan Mayya:
  An Efficient Expected Time Parallel Algorithm for Voronoi Construction. 392-401
  
• Victor Y. Pan, Franco P. Preparata:
  Supereffective Slow-Down of Parallel Computations. 402-409
  
• Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari:
  O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. 410-419
  
• Alan M. Frieze, Gary L. Miller, Shang-Hua Teng:
  Separator Based Parallel Divide and Conquer in Computational Geometry. 420-429
  
• Stephen Guattery, Gary L. Miller:
  A Contraction Procedure for Planar Directed Graphs. 431-441