Table of Contents

• Average Case Analysis of Greedy Routing algorithms on ArraysFrank Thomson Leighton. 2-10 [doi]
• Message-Passing Algorithms for a SIMD Torus with CoteriesMartin C. Herbordt, Charles C. Weems, James C. Corbett. 11-20 [doi]
• The Chaos Router: A Practical Application of Randomization in Network RoutingSmaragda Konstantinidou, Lawrence Snyder. 21-30 [doi]
• Tight Bounds for Oblivious Routing in the HypercubeChristos Kaklamanis, Danny Krizanc, Thanasis Tsantilas. 31-36 [doi]
• Running Algorithms Efficiently on Faulty HypercubesJehoshua Bruck, Robert Cypher, Danny Soroker. 37-44 [doi]
• Routing Multiple Paths in HypercubesDavid S. Greenberg, Sandeep N. Bhatt. 45-54 [doi]
• Fast Algorithms for Bit-Serial Routing on a HypercubeWilliam Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman. 55-64 [doi]
• Low Overhead Parallel Schedules for Task GraphsRichard J. Anderson, Paul Beame, Walter L. Ruzzo. 66-75 [doi]
• Asynchronous Shared Memory Parallel ComputationNaomi Nishimura. 76-84 [doi]
• The Expected Advantage of AsynchronyRichard Cole, Ofer Zajicek. 85-94 [doi]
• Parallel Algorithms for Generating Random Permutations on a Shared memory MachineRichard J. Anderson. 95-102 [doi]
• Processor Networks and Alternating MachinesJonathan F. Buss. 103-108 [doi]
• Lower Bounds for Parallel Computation on Linked StructuresFaith E. Fich, V. Ramachandran. 109-116 [doi]
• Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAMTorben Hagerup, Tomasz Radzik. 117-124 [doi]
• Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous WritesMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk. 125-135 [doi]
• Hardware Speedups in Long Integer MultiplicationMark Shand, Patrice Bertin, Jean Vuillemin. 138-145 [doi]
• Optimal-Time Multipliers and C-TestabilityBernd Becker, Joachim Hartmann. 146-154 [doi]
• Cache Coherence for Large Scale Shared Memory MultiprocessorsManu Thapar, Bruce Delagi. 155-160 [doi]
• FLIP-FLOP: A Stack-Oriented Multiprocessing SystemPeter Grabienski. 161-168 [doi]
• Analysis of Multithreaded Architectures for Parallel ComputingRafael H. Saavedra-Barrera, David E. Culler, Thorsten von Eicken. 169-178 [doi]
• Architectural Support for the Efficient Data-Driven Evaluation SchemeHarrick M. Vin, Francine Berman. 179-187 [doi]
• Utilizing Virtual Shared Memory in a Topology Independent, Multicomputer EnvironmentC. Maples. 188-198 [doi]
• High-Probability Parallel Transitive Closure AlgorithmsJeffrey D. Ullman, Mihalis Yannakakis. 200-209 [doi]
• A Randomized Parallel Algorithm for Planar Graph IsomorphismHillel Gazit, John H. Reif. 210-219 [doi]
• A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz SystemsDario Bini, Fabio Di Benedetto. 220-223 [doi]
• Disjoint Paths Through a 3-Dimensional GridMartin L. Brady, Donna J. Brown, P. McGuinness. 224-233 [doi]
• Parallel Construction of near Optimal binary TreesDavid G. Kirkpatrick, Teresa M. Przytycka. 234-243 [doi]
• Parallel Least-Squares Solution of General and Toeplitz SystemsVictor Y. Pan. 244-253 [doi]
• On the Euclidean Scheme for Polynomials Having Interlaced Real ZerosDario Bini, Luca Gemignani. 254-258 [doi]
• Parallel Rectilinear Shortest Paths with Rectangular ObstaclesMikhail J. Atallah, Danny Z. Chen. 270-279 [doi]
• Generalized Sweep Methods for Parallel Computational GeometryMichael T. Goodrich, Mujtaba R. Ghouse, J. Bright. 280-289 [doi]
• Efficient Parallel Computation of Arrangements of Hyperplanes in d DimensionsTorben Hagerup, H. Jung, Emo Welzl. 290-297 [doi]
• Parallel Algorithms for ArrangementsRichard J. Anderson, Paul Beame, Erik Brisson. 298-306 [doi]
• Optimal Cooperative Search in Fractional Cascaded Data StructuresRoberto Tamassia, Jeffrey Scott Vitter. 307-316 [doi]
• P-Complete Geometric ProblemsMikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich. 317-326 [doi]
• Randomized Algorithms for Binary Search and Load Balancing with Geometric ApplicationsJohn H. Reif, Sandeep Sen. 327-339 [doi]
• Wait-Free Data Structures in the Asynchronous PRAM ModelJames Aspnes, Maurice Herlihy. 340-349 [doi]
• A Foundation for Sequentializing Parallel CodeBeth Simon, D. Alpern, Jeanne Ferrante. 350-359 [doi]
• Preconditioning Index Set Transformations for Time-Optimal Affine SchedulingBjörn Lisper. 360-366 [doi]
• Fast-Fault-Tolerant Parallel Communication and On-Line Maintenance Using Information DispersalYuh-Dauh Lyuu. 378-387 [doi]
• On the Computational Equivalence of Hypercube-Derived NetworksEric J. Schwabe. 388-397 [doi]
• A Unified Approach to Off-Line Permutation Routing on Parallel NetworksFred S. Annexstein, Marc Baumslag. 398-406 [doi]
• Space-Efficient Representations of Shared Data for Parallel ComputersKieran T. Herley. 407-416 [doi]