1. SPAA 1989: Santa Fe, New Mexico, USA

• J. Y. Ngai, C. L. Setiz:
  A Framework for Adaptive Routing in Multicomputer Networks. 1-9
  
• Alok Aggarwal, Ashok K. Chandra, Marc Snir:
  On Communication Latency in PRAM Computations. 11-21
  
• Jeff I. Chu, Georg Schnitger:
  The Communication Complexity of Several Problems in Matrix Computation. 22-31
  
• Clyde P. Kruskal, Marc Snir:
  Cost-Bandwidth Tradeoffs for Communication Networks. 32-41
  
• C. P. Beigel, Clyde P. Kruskal:
  Processor Networks and Interconnection Networks Without Long Wires. 42-51
  
• M. Y. Chan:
  Embedding of d-Dimensional Grids into Optimal Hypercubes. 52-57
  
• Robert Cypher:
  A Lower Bound on the Size of Shellsort Networks. 58-63
  
• C. Greg Plaxton:
  Load Balancing, Selection Sorting on the Hypercube. 64-73
  
• Faith E. Fich, Avi Wigderson:
  Towards Understanding Exclusive Read. 76-82
  
• Stephen J. Bellantoni:
  Parallel RAMs with Bounded Memory Wordsize. 83-91
  
• Tak Wah Lam, Walter L. Ruzzo:
  The Power of Parallel Pointer Manipulation. 92-102
  
• Scot W. Hornick, Franco P. Preparata:
  Deterministic P-RAM Simulation with Constant Redundancy. 103-109
  
• Xiaotie Deng:
  On the Parallel Complexity of Integer Programming. 110-116
  
• Dennis Shasha, Kaizhong Zhang:
  Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees. 117-126
  
• Michael T. Goodrich:
  Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. 127-137
  
• Amotz Bar-Noy, Danny Peleg:
  Square Meshes Are Not Always Optimal. 138-147
  
• C. A. Philips:
  Parallel Graph Contraction. 148-157
  
• Phillip B. Gibbons:
  A More practical PRAM Model. 158-168
  
• Richard Cole, Ofer Zajicek:
  The APRAM: Incorporating Asynchrony into the PRAM Model. 169-178
  
• Fred S. Annexstein:
  Fault Tolerance in Hypercube-Derivative Networks. 179-188
  
• Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan:
  Locating Faults in a Constant Number of Parallel Testing Rounds. 189-198
  
• Richard Fujimoto:
  The Virtual Time Machine. 199-208
  
• Yehuda Afek, Geoffrey M. Brown, Michael Merritt:
  A Lazy Cache Algorithm. 209-222
  
• Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe:
  Dynamic Tree Embeddings in Butterflies and Hypercubes. 224-234
  
• Gregory E. Shannon:
  Optimal On-Line Load Balancing. 235-245
  
• Yijie Han:
  Matching Partition a Linked List and Its Optimization. 246-253
  
• Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
  Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. 254-264
  
• Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh:
  Optimal VLSI Architectures for Multidimensional DFT. 265-272
  
• Shaodi Gao, Michael Kaufmann, F. Miller Maley:
  Advances in Homotopic Layout Compaction. 273-282
  
• Clark D. Thomborson, Belle W. Y. Wei:
  Systolic Implementations of a Move-to-Front Text Compressor. 283-290
  
• A. Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips:
  Four Vector-Matrix Primitives. 292-302
  
• Doug Baxter, Ravi Mirchandaney, Joel H. Saltz:
  Run-Time Parallelization and Scheduling of Loops. 303-312
  
• De-Lei Lee, Y. H. Wang:
  Conflict-Free Access of Arrays in a Parallel Processor. 313-317
  
• Shimon Even, Burkhard Monien:
  On the Number of Rounds Necessary to Disseminate Information. 318-327
  
• Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis:
  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues. 328-335
  
• Manfred Kunde, Thomas Tensi:
  Multi-Packet-Routing on Mesh Connected Arrays. 336-343
  
• Prabhakar Raghavan:
  Robust Algorithms for Packet Routing in a Mesh. 344-350
  
• Thomas F. Knight Jr.:
  Technologies for Low Latency Interconnection Switches. 351-358
  
• Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
  An Optimal Parallel Dictionary. 360-368
  
• Joan M. Lucas, Marian Gunsher Sackrowitz:
  Efficient Parallel Algorithms for Path Problems in Directed Graphs. 369-377
  
• Marek Chrobak, Joseph Naor:
  An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. 379-387
  
• Zvi M. Kedem, Gad M. Landau, Krishna V. Palem:
  Optimal Parallel Suffix-Prefix Matching Algorithm and Applications. 388-398
  
• Roberto Tamassia, Jeffrey Scott Vitter:
  Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures. 399-408
  
• Richard M. Karp, Yanjun Zhang:
  On Parallel Evaluation of Game Trees. 409-420
  
• Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
  Constructing Trees in Parallel. 421-431
  

Last update Fri May 24 19:51:08 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page