3. AWOC 1988: Corfu, Greece
John H. Reif (Ed.): VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings. Springer 1988 Lecture Notes in Computer Science ISBN 3-540-96818-0
Parallel Set and Graph Algorithms
- Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. 1-10
- Marek Chrobak, Moti Yung: Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. 11-23
- Torben Hagerup: Optimal Parallel Algorithms on Planar Graphs. 24-32
NC Algorithms
- Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker: Subtree Isomorphism is in Random NC. 43-52
- Ming-Yang Kao: All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC. 53-63
Parallel Tree Contraction
- Richard Cole, Uzi Vishkin: Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. 91-100
- S. Rao Kosaraju, Arthur L. Delcher: Optimal Parallel Evaluation of Tree-Structured Computations by Raking. 101-110
- Baruch Schieber, Uzi Vishkin: On Finding Lowest Common Ancestors: Simplification and Parallelization. 111-123
- Richard J. Anderson, Ashfaq A. Munshi, Barbara Simons: A Scheduling Problem Arising From Loop Parallelization on MIMD Machines. 124-133
- Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou: Scheduling Dags to Minimize Time and Communication. 134-138
- Joseph Naor: Computing a Perfect Matching in a Line Graph. 139-148
Simulation and Embedding of Parallel Networks
- Arnold L. Rosenberg: GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. 160-169
- John A. Ellis: Embedding Rectangular Grids into Square Grids. 181-190
Compaction and Channel Routing
VLSI Layout
- Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton: Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. 247-256
- Ioannis G. Tollis: A New Algorithm for Wiring Layouts. 257-267
- Deepak D. Sherlekar, Joseph JáJá: Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree. 268-277
- Michael R. Fellows, Michael A. Langston: Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. 278-287
VLSI Testing and Derivation
- Pradip Bose: Parallel Simulation and Test of VLSI Array Logic. 301-311
- Martin Fürer: Universal Hashing in VLSI. 312-318
- Yoav Yaacoby, Peter R. Cappello: Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations. 319-328
Distributed Computing
- Alok Aggarwal, Ming-Deh A. Huang: Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks. 339-350
- Yossi Malka, Shlomo Moran, Shmuel Zaks: Analysis of a Distributed Scheduler for Communication Networks. 351-360
- Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish: A Tradeoff between Information and Communication in Broadcast Protocols. 369-379
- Charles U. Martel, Thomas P. Vayda: The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels. 401-410
Parallel Routing and Sorting
- Danny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. 411-422
- Manfred Kunde: Routing and Sorting on Mesh-Connected Arrays. 423-433
- Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. 434-443
- Robert Cypher, Jorge L. C. Sanz: Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers. 456-464
Late Paper
- Elena Lodi, Fabrizio Luccio, Linda Pagli: A 4D Channel Router for a Two Layer Diagonal Model. 465-476
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team