Abstract is missing.
- Efficient Detection of Determinacy Races in Cilk ProgramsMingdong Feng, Charles E. Leiserson. 1-11 [doi]
- Space-Efficient Scheduling of Parallelism with Synchronization VariablesGuy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias. 12-23 [doi]
- HARP: A Fast Spectral PartitionerHorst D. Simon, Andrew Sohn, Rupak Biswas. 43-52 [doi]
- Three-Dimensional Pattern MatchingZvi Galil, Jong Geun Park, Kunsoo Park. 53-62 [doi]
- On the Parallel Complexity of Matrix Factorization AlgorithmsMauro Leoncini, Giovanni Manzini, Luciano Margara. 63-71 [doi]
- Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation?Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran. 72-83 [doi]
- Efficient Computations on Fault-Prone BSP MachinesSpyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis. 84-93 [doi]
- Modeling Parallel Bandwidth: Local vs. Global RestrictionsMicah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias. 94-105 [doi]
- Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel AlgorithmsFrank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson. 106-115 [doi]
- System Area Network MappingBrent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson. 116-126 [doi]
- Bounds to the Throughput of an Interconnection NetworkLudek Kucera. 139-148 [doi]
- The Performance of Simple Routing Algorithms That Drop PacketsSuprakash Datta, Ramesh K. Sitaraman. 159-169 [doi]
- Simple, Efficient Routing Schemes for All-Optical NetworksMichele Flammini, Christian Scheideler. 170-179 [doi]
- Fine-Grain Multithreading with the EM-X MultiprocessorAndrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato, Hirofumi Sakane, Hayato Yamana, Shuichi Sakai, Yoshinori Yamaguchi. 189-198 [doi]
- Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency ModelsParthasarathy Ranganathan, Vijay S. Pai, Sarita V. Adve. 199-210 [doi]
- Temporal Notions of Synchronization and Consistency in BeehiveAman Singla, Umakishore Ramachandran, Jessica K. Hodgins. 211-220 [doi]
- Better Trade-Offs for Parallel List RankingJop F. Sibeyn. 221-230 [doi]
- Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed ComputersGene Cooperman, Michael Tselman. 231-238 [doi]
- Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation AlgorithmJonathan C. Hardwick. 239-248 [doi]
- Pipelining with FuturesGuy E. Blelloch, Margaret Reid-Miller. 249-259 [doi]
- From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-SumUzi Vishkin. 260-271 [doi]
- Thread Partitioning and Scheduling Based on Cost ModelXinan Tang, Jing Wang, Kevin B. Theobald, Guang R. Gao. 272-281 [doi]
- Optimal Weighted Loop Fusion for Parallel ProgramsNimrod Megiddo, Vivek Sarkar. 282-291 [doi]
- Allocating Weighted Jobs in ParallelPetra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder. 302-310 [doi]
- Accessing Nearby Copies of Replicated Objects in a Distributed EnvironmentC. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa. 311-320 [doi]
- A Localized Algorithm for Parallel Association MiningMohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li. 321-330 [doi]