default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. AWOC 1988: Corfu, Greece
- John H. Reif:
VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings. Lecture Notes in Computer Science 319, Springer 1988, 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 - Vijaya Ramachandran, Uzi Vishkin:
Efficient Parallel Triconnectivity in Logarithmic Time. 33-42
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 - Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang:
On Some Languages in NC. 64-73 - Bruce E. Litow, George I. Davida:
O(log(n)) Parallel Time Finite Field Inversion. 74-80
Parallel Tree Contraction
- Richard J. Anderson, Gary L. Miller:
Deterministic Parallel List Ranking. 81-90 - 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 - Donald S. Fussell, Ramakrishna Thurimella:
Separation Pair Detection. 149-159
Simulation and Embedding of Parallel Networks
- Arnold L. Rosenberg:
GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. 160-169 - Burkhard Monien, Ivan Hal Sudborough:
Simulating Binary Trees on Hypercubes. 170-180 - John A. Ellis:
Embedding Rectangular Grids into Square Grids. 181-190 - Bruno Codenotti, Roberto Tamassia:
Efficient Reconfiguration of VLSI Arrays. 191-200 - Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough:
Embedding Grids into Hypercubes. 201-211
Compaction and Channel Routing
- Kurt Mehlhorn, Wolfgang Rülling:
Compaction on the Torus. 212-225 - Michael Kaufmann, Ioannis G. Tollis:
Channel Routing with Short Wires. 226-236 - Teofilo F. Gonzalez, Si-Qing Zheng:
Simple Three-Layer Channel Routing Algorithms. 237-246
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 F. 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
- Bernd Becker, Uwe Sparmann:
Regular Structures and Testing: RCC-Adders. 288-300 - 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
- Hagit Attiya, Marc Snir:
Better Computing on the Anonymous Ring. 329-338 - 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 - Evangelos Kranakis, Paul M. B. Vitányi:
Weighted Distributed Match-Making. 361-368 - Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish:
A Tradeoff between Information and Communication in Broadcast Protocols. 369-379 - Amotz Bar-Noy, Danny Dolev:
Families of Consensus Algorithms. 380-390 - James E. Burns, Jan K. Pachl:
Uniform Self-Stabilizing Rings. 391-400 - 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 - Manfred Schimmler, Christoph Starke:
A Correction Network for N-Sorters. 444-455 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-12 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
