Abstract is missing.
- Parallel Algorithms for Evaluating Sequences of Set-Manipulation OperationsMikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju. 1-10
- Fast Parallel and Sequential Algorithms for Edge-Coloring Planar GraphsMarek Chrobak, Moti Yung. 11-23
- Optimal Parallel Algorithms on Planar GraphsTorben Hagerup. 24-32
- Efficient Parallel Triconnectivity in Logarithmic TimeVijaya Ramachandran, Uzi Vishkin. 33-42
- Subtree Isomorphism is in Random NCPhillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker. 43-52
- All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNCMing-Yang Kao. 53-63
- On Some Languages in NCOscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang. 64-73
- O(log(n)) Parallel Time Finite Field InversionBruce E. Litow, George I. Davida. 74-80
- Deterministic Parallel List RankingRichard J. Anderson, Gary L. Miller. 81-90
- Optimal Parallel Algorithms for Expression Tree Evaluation and List RankingRichard Cole, Uzi Vishkin. 91-100
- Optimal Parallel Evaluation of Tree-Structured Computations by RakingS. Rao Kosaraju, Arthur L. Delcher. 101-110
- On Finding Lowest Common Ancestors: Simplification and ParallelizationBaruch Schieber, Uzi Vishkin. 111-123
- A Scheduling Problem Arising From Loop Parallelization on MIMD MachinesRichard J. Anderson, Ashfaq A. Munshi, Barbara Simons. 124-133
- Scheduling Dags to Minimize Time and CommunicationFoto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. 134-138
- Computing a Perfect Matching in a Line GraphJoseph Naor. 139-148
- Separation Pair DetectionDonald S. Fussell, Ramakrishna Thurimella. 149-159
- GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New DirectionsArnold L. Rosenberg. 160-169
- Simulating Binary Trees on HypercubesBurkhard Monien, Ivan Hal Sudborough. 170-180
- Embedding Rectangular Grids into Square GridsJohn A. Ellis. 181-190
- Efficient Reconfiguration of VLSI ArraysBruno Codenotti, Roberto Tamassia. 191-200
- Embedding Grids into HypercubesSaïd Bettayeb, Zevi Miller, Ivan Hal Sudborough. 201-211
- Compaction on the TorusKurt Mehlhorn, Wolfgang Rülling. 212-225
- Channel Routing with Short WiresMichael Kaufmann, Ioannis G. Tollis. 226-236
- Simple Three-Layer Channel Routing AlgorithmsTeofilo F. Gonzalez, Si-Qing Zheng. 237-246
- Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation ArchitecturesLarry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton. 247-256
- A New Algorithm for Wiring LayoutsIoannis G. Tollis. 257-267
- Input Sensitive VLSI Layouts for Graphs of Arbitrary DegreeDeepak D. Sherlekar, Joseph JáJá. 268-277
- Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-DesignMichael R. Fellows, Michael A. Langston. 278-287
- Regular Structures and Testing: RCC-AddersBernd Becker, Uwe Sparmann. 288-300
- Parallel Simulation and Test of VLSI Array LogicPradip Bose. 301-311
- Universal Hashing in VLSIMartin Fürer. 312-318
- Converting Affine Recurrence Equations to Quasi-Uniform Recurrence EquationsYoav Yaacoby, Peter R. Cappello. 319-328
- Better Computing on the Anonymous RingHagit Attiya, Marc Snir. 329-338
- Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection NetworksAlok Aggarwal, Ming-Deh A. Huang. 339-350
- Analysis of a Distributed Scheduler for Communication NetworksYossi Malka, Shlomo Moran, Shmuel Zaks. 351-360
- Weighted Distributed Match-MakingEvangelos Kranakis, Paul M. B. Vitányi. 361-368
- A Tradeoff between Information and Communication in Broadcast ProtocolsBaruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish. 369-379
- Families of Consensus AlgorithmsAmotz Bar-Noy, Danny Dolev. 380-390
- Uniform Self-Stabilizing RingsJames E. Burns, Jan K. Pachl. 391-400
- The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access ChannelsCharles U. Martel, Thomas P. Vayda. 401-410
- Optimal Routing Algorithms for Mesh-Connected Processor ArraysDanny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas. 411-422
- Routing and Sorting on Mesh-Connected ArraysManfred Kunde. 423-433
- Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor ArrayYijie Han, Yoshihide Igarashi. 434-443
- A Correction Network for N-SortersManfred Schimmler, Christoph Starke. 444-455
- Cubesort: An Optimal Sorting Algorithm for Feasible Parallel ComputersRobert Cypher, Jorge L. C. Sanz. 456-464
- A 4D Channel Router for a Two Layer Diagonal ModelElena Lodi, Fabrizio Luccio, Linda Pagli. 465-476