Table of Contents

• The Verification of Cache Coherence ProtocolsFong Pong, Michel Dubois. 11-20 [doi]
• Fault Diagnosis in a Small Constant Number of Parallel Testing RoundsRichard Beigel, Grigorii Margulis, Daniel A. Spielman. 21-29 [doi]
• Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive FaultsFrank Thomson Leighton, Yuan Ma. 30-41 [doi]
• Scalable Parallel Computing: The IBM 9076 Scalable POWERparallel 1Marc Snir. 42 [doi]
• On Gazit and Miller s Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random SamplingPhilip N. Klein. 43-49 [doi]
• Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra ProblemsJoseph Cheriyan, John H. Reif. 50-56 [doi]
• Efficient Parallel Shortest-Paths in Digraphs with a Separator DecompositionEdith Cohen. 57-67 [doi]
• Components for Computing and CommunicationsDavid May. 68 [doi]
• Highly Efficient Dictionary Matching in ParallelS. Muthukrishnan, Krishna V. Palem. 69-78 [doi]
• Optimal Parallel Two Dimensional Pattern MatchingAmihood Amir, Gary Benson, Martin Farach. 79-85 [doi]
• Parallel Construction and Query of Suffix Trees for Two-Dimensional MatricesRaffaele Giancarlo, Roberto Grossi. 86-97 [doi]
• Autonomous SIMD Flexibility in the MP-1 and MP-2John R. Nickolls, Jochen Reusch. 98-99 [doi]
• Simple, Efficient Shared Memory SimulationsMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. 110-119 [doi]
• Deterministic Distribution Sort in Shared and Distributed Memory MultiprocessorsMark H. Nodine, Jeffrey Scott Vitter. 120-129 [doi]
• Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk SystemsThomas H. Cormen, Leonard F. Wisniewski. 130-139 [doi]
• The S3.mp Architecture: A Local Area MultiprocessorAndreas Nowatzyk, M. Monger, Michael Parkin, Edmund J. Kelly, Michael C. Browne, Gunes Aybay, David Lee. 140-141 [doi]
• Optimal Broadcast and Summation in the LogP ModelRichard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser. 142-153 [doi]
• An Atomic Model for Message-PassingPangfeng Liu, William Aiello, Sandeep N. Bhatt. 154-163 [doi]
• A Dynamic Distributed Load Balancing Algorithm with Provable Good PerformanceReinhard Lüling, Burkhard Monien. 164-172 [doi]
• Bounds on the Efficiency of Message-Passing Protocols for Parallel ComputersRobert Cypher, Smaragda Konstantinidou. 173-181 [doi]
• An Implementation of the epsilon-Relaxation Algorithm on the CM-5B. Narendran, Renato De Leone, Prasoon Tiwari. 183-192 [doi]
• Experience in Massively Parallel Discrete Event SimulationAlbert G. Greenberg, Boris D. Lubachevsky, Li-C. Wang. 193-202 [doi]
• Supporting Sets of Arbitrary Connections on iWarp Through Communication Context SwitchesAnja Feldmann, Thomas Stricker, Thomas E. Warfel. 203-212 [doi]
• The Meiko CS-2 System ArchitectureDuncan Roweth. 213 [doi]
• Parallel Construction of Optimal Alphabetic TreesLawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter. 214-223 [doi]
• Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random GraphsPhilip D. MacKenzie, Quentin F. Stout. 224-229 [doi]
• An Efficient Parallel Algorithm for the Single Function Coarsest Partition ProblemJoseph JáJá, Kwan Woo Ryu. 230-239 [doi]
• Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming StrategiesHagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch. 241-250 [doi]
• The Power of Processor ConsistencyMustaque Ahamad, Rida A. Bazzi, Ranjit John, Prince Kohli, Gil Neiger. 251-260 [doi]
• A Method for Implementing Lock-Free Shared-Data StructuresGreg Barnes. 261-270 [doi]
• An Overview of Cray Research Computers Including the Y-MP/C90 and the new MPP T3DWilfried Oed, Martin Walker. 271-272 [doi]
• Randomized routing with shorter pathsEli Upfal, Sergio Feleprin, Marc Snir. 273-282 [doi]
• Fast Parallel Matching in Expander GraphsPierre Kelsen. 293-299 [doi]
• A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel ComputerLeslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao. 300-309 [doi]
• Scalable Operating Systems, or What Do a Million Processors Mean?Falk Langhammer. 310 [doi]
• Lower Bounds for Graph Embeddings via Algebraic TopologyLenwood S. Heath. 311-317 [doi]
• Efficient Wiring of Reconfigurable Parallel ProcessorsDavid S. Greenberg. 318-324 [doi]
• New Graph Decompositions and Fast Emulations in Hypercubes and ButterfliesChristos Kaklamanis, Danny Krizanc, Satish Rao. 325-334 [doi]
• KRS1: High Performance and Ease of Programming, No Longer an OxymoronSteven Frank. 335 [doi]
• Average Case Analysis of Five Two-Dimensional Bubble Sorting AlgorithmsSerap A. Savari. 336-345 [doi]
• Fast Deterministic Approximate and Exact Parallel SortingTorben Hagerup, Rajeev Raman. 346-355 [doi]
• The New Class of g-Chain Periodic SortersRonald I. Becker, David Nassimi, Yehoshua Perl. 356-364 [doi]
• The Connection Machine Systems CM-5S. Lennart Johnsson. 365-366 [doi]
• Scan Grammars: Parallel Attribute Evaluation via Data-ParallelismThomas W. Reps. 367-376 [doi]
• Implementing the Multiprefix Operation on Parallel and Vector ComputersThomas J. Sheffler. 377-386 [doi]
• Vector Prefix Addition on Sub-Bus Mesh ComputersRichard E. Ladner, Jordan Lampe, Richard A. Rogers. 387-396 [doi]