Conferences in DBLP
Mikhail J. Atallah , Michael T. Goodrich , S. Rao Kosaraju Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Moti Yung Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Optimal Parallel Algorithms on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Vijaya Ramachandran , Uzi Vishkin Efficient Parallel Triconnectivity in Logarithmic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Phillip B. Gibbons , Richard M. Karp , Gary L. Miller , Danny Soroker Subtree Isomorphism is in Random NC. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Tao Jiang , Bala Ravikumar , Jik H. Chang On Some Languages in NC. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce E. Litow , George I. Davida O(log(n)) Parallel Time Finite Field Inversion. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Anderson , Gary L. Miller Deterministic Parallel List Ranking. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Uzi Vishkin Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju , Arthur L. Delcher Optimal Parallel Evaluation of Tree-Structured Computations by Raking. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Schieber , Uzi Vishkin On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Anderson , Ashfaq A. Munshi , Barbara Simons A Scheduling Problem Arising From Loop Parallelization on MIMD Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Foto N. Afrati , Christos H. Papadimitriou , George Papageorgiou Scheduling Dags to Minimize Time and Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor Computing a Perfect Matching in a Line Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Donald S. Fussell , Ramakrishna Thurimella Separation Pair Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Arnold L. Rosenberg GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien , Ivan Hal Sudborough Simulating Binary Trees on Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] John A. Ellis Embedding Rectangular Grids into Square Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Roberto Tamassia Efficient Reconfiguration of VLSI Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Saïd Bettayeb , Zevi Miller , Ivan Hal Sudborough Embedding Grids into Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Wolfgang Rülling Compaction on the Torus. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaufmann , Ioannis G. Tollis Channel Routing with Short Wires. [Citation Graph (0, 0)][DBLP ] Conf ] Teofilo F. Gonzalez , Si-Qing Zheng Simple Three-Layer Channel Routing Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Larry Finkelstein , Daniel J. Kleitman , Frank Thomson Leighton Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis G. Tollis A New Algorithm for Wiring Layouts. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak D. Sherlekar , Joseph JáJá Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael A. Langston Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Becker , Uwe Sparmann Regular Structures and Testing: RCC-Adders. [Citation Graph (0, 0)][DBLP ] Conf ] Pradip Bose Parallel Simulation and Test of VLSI Array Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Universal Hashing in VLSI. [Citation Graph (0, 0)][DBLP ] Conf ] Yoav Yaacoby , Peter R. Cappello Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Marc Snir Better Computing on the Anonymous Ring. [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Ming-Deh A. Huang Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Malka , Shlomo Moran , Shmuel Zaks Analysis of a Distributed Scheduler for Communication Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Paul M. B. Vitányi Weighted Distributed Match-Making. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Oded Goldreich , David Peleg , Ronen Vainish A Tradeoff between Information and Communication in Broadcast Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Danny Dolev Families of Consensus Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] James E. Burns , Jan K. Pachl Uniform Self-Stabilizing Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Charles U. Martel , Thomas P. Vayda The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Krizanc , Sanguthevar Rajasekaran , Thanasis Tsantilas Optimal Routing Algorithms for Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kunde Routing and Sorting on Mesh-Connected Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Yijie Han , Yoshihide Igarashi Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Schimmler , Christoph Starke A Correction Network for N-Sorters. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Cypher , Jorge L. C. Sanz Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Lodi , Fabrizio Luccio , Linda Pagli A 4D Channel Router for a Two Layer Diagonal Model. [Citation Graph (0, 0)][DBLP ] Conf ] 