9. SPAA 1997: Newport, RI, USA

• Mingdong Feng, Charles E. Leiserson:
  Efficient Detection of Determinacy Races in Cilk Programs. 1-11
  
• Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias:
  Space-Efficient Scheduling of Parallelism with Synchronization Variables. 12-23
  
• Giovanni Della-Libera, Nir Shavit:
  Reactive Diffracting Trees. 24-32
  
• Leonid Oliker, Rupak Biswas:
  Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations. 33-42
  
• Horst D. Simon, Andrew Sohn, Rupak Biswas:
  HARP: A Fast Spectral Partitioner. 43-52
  
• Zvi Galil, Jong Geun Park, Kunsoo Park:
  Three-Dimensional Pattern Matching. 53-62
  
• Mauro Leoncini, Giovanni Manzini, Luciano Margara:
  On the Parallel Complexity of Matrix Factorization Algorithms. 63-71
  
• Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
  Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? 72-83
  
• Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis:
  Efficient Computations on Fault-Prone BSP Machines. 84-93
  
• Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias:
  Modeling Parallel Bandwidth: Local vs. Global Restrictions. 94-105
  
• Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
  Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. 106-115
  
• Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson:
  System Area Network Mapping. 116-126
  
• Melanie L. Fulgham, Lawrence Snyder:
  Triplex: A Multi-Class Routing Algorithm. 127-138
  
• Ludek Kucera:
  Bounds to the Throughput of an Interconnection Network. 139-148
  
• Loren Schwiebert:
  Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies. 149-158
  
• Suprakash Datta, Ramesh K. Sitaraman:
  The Performance of Simple Routing Algorithms That Drop Packets. 159-169
  
• Michele Flammini, Christian Scheideler:
  Simple, Efficient Routing Schemes for All-Optical Networks. 170-179
  
• Dominique Barth, Pierre Fraigniaud:
  Approximation Algorithms for Structured Communication Problems. 180-188
  
• Andrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato, Hirofumi Sakane, Hayato Yamana, Shuichi Sakai, Yoshinori Yamaguchi:
  Fine-Grain Multithreading with the EM-X Multiprocessor. 189-198
  
• Parthasarathy Ranganathan, Vijay S. Pai, Sarita V. Adve:
  Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency Models. 199-210
  
• Aman Singla, Umakishore Ramachandran, Jessica K. Hodgins:
  Temporal Notions of Synchronization and Consistency in Beehive. 211-220
  
• Jop F. Sibeyn:
  Better Trade-Offs for Parallel List Ranking. 221-230
  
• Gene Cooperman, Michael Tselman:
  Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers. 231-238
  
• Jonathan C. Hardwick:
  Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm. 239-248
  
• Guy E. Blelloch, Margaret Reid-Miller:
  Pipelining with Futures. 249-259
  
• Uzi Vishkin:
  From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum. 260-271
  
• Xinan Tang, Jing Wang, Kevin B. Theobald, Guang R. Gao:
  Thread Partitioning and Scheduling Based on Cost Model. 272-281
  
• Nimrod Megiddo, Vivek Sarkar:
  Optimal Weighted Loop Fusion for Parallel Programs. 282-291
  
• Michael Mitzenmacher:
  On the Analysis of Randomized Load Balancing Schemes. 292-301
  
• Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder:
  Allocating Weighted Jobs in Parallel. 302-310
  
• C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
  Accessing Nearby Copies of Replicated Objects in a Distributed Environment. 311-320
  
• Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li:
  A Localized Algorithm for Parallel Association Mining. 321-330
  

Last update Sun May 26 03:27:07 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page