Abstract is missing.
- Adaptive Deadlock- and Livelock-Free Routing with all Minimal Paths in Torus NetworksPablo E. Berman, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz. 3-12 [doi]
- Designing Broadcasting Algorithms in the Postal Model for Message-Passing SystemsAmotz Bar-Noy, Shlomo Kipnis. 13-22 [doi]
- Simple Path Selection for Optimal Routing on Processor ArraysChristos Kaklamanis, Danny Krizanc, Satish Rao. 23-30 [doi]
- Matching the Bisection Bound for Routing and Sorting on the MeshMichael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn. 31-40 [doi]
- Efficient Optical Communication in Parallel ComputersMihály Geréb-Graus, Thanasis Tsantilas. 41-48 [doi]
- Optimal Sorting on Mesh-Connected Processor ArraysChristos Kaklamanis, Danny Krizanc. 50-59 [doi]
- Layered Cross Product - A Technique to Construct Interconnection NetworksShimon Even, Ami Litman. 60-69 [doi]
- A Lower Bound for Sorting Networks Based on the Shuffle PermutationC. Greg Plaxton, Torsten Suel. 70-79 [doi]
- Universality of Iterated NetworksRobert F. Chamberlain, Charles M. Fiduccia. 80-89 [doi]
- Fast Parallel Discrete Approximation Algorithms for the Radon TransformMartin L. Brady, Whanki Yong. 91-99 [doi]
- Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected ComputerSusanne E. Hambrusch, Xin He, Russ Miller. 100-108 [doi]
- Optimal Routing of Parentheses on the HypercubeErnst W. Mayr, Ralph Werchner. 109-117 [doi]
- Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of ProcessorsChristos Kaklamanis, Giuseppe Persiano. 118-126 [doi]
- Maintaining Dynamic Ordered Sets on Processor NetworksAbhiram G. Ranade. 127-137 [doi]
- Optimal Dynamic Scheduling of Task Tree on Constant-Dimensional ArchitecturesXiangdong Yu, Dipak Ghosal. 138-146 [doi]
- Supporting the Hypercube Programming Model on Mesh Architectures: A Fast Sorter for iWarp ToriThomas Stricker. 148-157 [doi]
- Implementations of Randomized Sorting on Large Parallel MachinesWilliam L. Hightower, Jan Prins, John H. Reif. 158-167 [doi]
- On the Parallel Implementation of Goldberg s Maximum Flow AlgorithmRichard J. Anderson, João C. Setubal. 168-177 [doi]
- Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel AlgorithmB. Narendran, Prasoon Tiwari. 178-187 [doi]
- Primitives for Asynchronous List CompressionRichard J. Anderson. 199-208 [doi]
- Subset Barrier Synchronization on a Private-Memory Parallel SystemAnja Feldmann, Thomas R. Gross, David R. O Hallaron, Thomas Stricker. 209-218 [doi]
- Low Contention Load Balancing on Large-Scale MultiprocessorsMaurice Herlihy, Beng-Hong Lim, Nir Shavit. 219-227 [doi]
- Fault-Tolerant Circuit-Switching NetworksNicholas Pippenger, Geng Lin. 229-235 [doi]
- Competitive Fault-Tolerance in Area-Universal NetworksSivan Toledo. 236-246 [doi]
- Dense Edge-Disjoint Embedding of Binary Trees in the MeshAlan Gibbons, Mike Paterson. 257-263 [doi]
- Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract)David Bruce Wilson. 264-270 [doi]
- The Network Architecture of the Connection Machine CM-5 (Extended Abstract)Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak. 272-285 [doi]
- Design and Performance of Multipath MIN ArchitecturesFrederic T. Chong, Thomas F. Knight Jr.. 286-295 [doi]
- Hardware Combining and ScalabilitySusan R. Dickey, Richard Kenner. 296-305 [doi]
- Specifying Non-Blocking Shared Memories (Extended Abstract)Phillip B. Gibbons, Michael Merritt. 306-315 [doi]
- Splash 2Jeffrey M. Arnold, Duncan A. Buell, Elaine G. Davis. 316-322 [doi]
- Approximate Algorithms Scheduling Parallelizable TasksJohn Turek, Joel L. Wolf, Philip S. Yu. 323-332 [doi]
- Analysis of Free Schedule in Periodic GraphsWolfgang Backes, Uwe Schwiegelshohn, Lothar Thiele. 333-342 [doi]
- Space and Time Efficient Implementations of Parallel Nested DissectionDeganit Armon, John H. Reif. 344-352 [doi]
- Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed GraphsYijie Han, Victor Y. Pan, John H. Reif. 353-362 [doi]
- A Parallel Algorithm for Computing Minimum Spanning TreesDonald B. Johnson, Panagiotis Takis Metaxas. 363-372 [doi]
- Fast Connected Components Algorithms for the EREW PRAMDavid R. Karger, Noam Nisan, Michal Parnas. 373-381 [doi]
- Connected Components and the Interval GraphEdward F. Grove. 382-391 [doi]
- An Efficient Expected Time Parallel Algorithm for Voronoi ConstructionBaba C. Vemuri, R. Varadarajan, Niranjan Mayya. 392-401 [doi]
- Supereffective Slow-Down of Parallel ComputationsVictor Y. Pan, Franco P. Preparata. 402-409 [doi]
- O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar GraphsMartin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari. 410-419 [doi]
- Separator Based Parallel Divide and Conquer in Computational GeometryAlan M. Frieze, Gary L. Miller, Shang-Hua Teng. 420-429 [doi]
- A Contraction Procedure for Planar Directed GraphsStephen Guattery, Gary L. Miller. 431-441 [doi]