Abstract is missing.
- A Comparison of Sorting Algorithms for the Connection Machine CM-2Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha. 3-16 [doi]
- Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version)Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas. 17-28 [doi]
- Large-Scale Sorting in Parallel Memories (Extended Abstract)Mark H. Nodine, Jeffrey Scott Vitter. 29-39 [doi]
- Optimal Speedup for Backtrack Search on a butterfly NetworkAbhiram G. Ranade. 40-48 [doi]
- Fast and Reliable Parallel HashingHolger Bast, Torben Hagerup. 50-61 [doi]
- Tight Bounds for the Chaining ProblemShiva Chaudhuri. 62-70 [doi]
- Parallel Construction of Trees with Optimal Weighted Path LengthLawrence L. Larmore, Teresa M. Przytycka. 71-80 [doi]
- More Time-Work Tradeoffs for Parallel Graph AlgorithmsThomas H. Spencer. 81-93 [doi]
- Architectural Primitives for a Scalable Shared Memory MultiprocessorJoonwon Lee, Umakishore Ramachandran. 103-114 [doi]
- Architectural Mechanisms to Support Three-Dimensional Lattice Gas SimulationsFung F. Lee, Michael J. Flynn. 115-122 [doi]
- Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version)Bojana Obrenic. 137-146 [doi]
- Simulating Binary Trees on X-Trees (Extended Abstract)Burkhard Monien. 147-158 [doi]
- An Approach to Emulating Separable Graphs (preliminary Version)Bojana Obrenic. 159-167 [doi]
- Constructing Arrangements Optimally in Parallel (Preliminary Version)Michael T. Goodrich. 169-179 [doi]
- Processor Efficient Parallel Solution of Linear Systems over an Abstract FieldErich Kaltofen, Victor Y. Pan. 180-191 [doi]
- In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version)Mujtaba R. Ghouse, Michael T. Goodrich. 192-203 [doi]
- Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version)Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay. 204-214 [doi]
- Generalised Multiprocessor Scheduling Using Optimal ControlG. N. Srinivasa Prasanna, Bruce R. Musicus. 216-228 [doi]
- Lock-Free garbage Collection for MultiprocessorsMaurice Herlihy, J. Eliot B. Moss. 229-236 [doi]
- A Simple Load Balancing Scheme for Task Allocation in Parallel MachinesLarry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal. 237-245 [doi]
- The Efficiency of Greedy Routing in Hypercubes and ButterfliesGeorge D. Stamoulis, John N. Tsitsiklis. 248-259 [doi]
- Balanced Routing: Towards the Distance Bound on GridsManfred Kunde. 260-271 [doi]
- Parallel Algorithms for Routing in Non-Blocking NetworksGeng Lin, Nicholas Pippenger. 272-277 [doi]
- Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other NetworksGustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz. 278-290 [doi]
- Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract)Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo. 292-303 [doi]
- Sequential Consistency Versus Linearizability (Extended Abstract)Hagit Attiya, Jennifer L. Welch. 304-315 [doi]
- Detecting Violations of Sequential ConsistencyKourosh Gharachorloo, Phillip B. Gibbons. 316-326 [doi]
- Impossibility Results for Asynchronous PRAM (Extended Abstract)Maurice Herlihy. 327-336 [doi]
- Understanding Retiming Through Maximum Average-Weight CyclesMarios C. Papaefthymiou. 338-348 [doi]
- A One-Way Array Algorithm for Matroid SchedulingMatthias F. M. Stallmann. 349-356 [doi]
- On the Capabilities of Systolic Systems (Extended Abstract)Shimon Even, Ami Litman. 357-367 [doi]