Vijaya Ramachandran

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

A Shortest Path Algorithm for Real-Weighted Undirected Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Pattern Identification in Biogeography.

[BibT_eX]

[DOI]

Ganeshkumar Ganapathy

Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

External-memory exact and approximate all-pairs shortest-paths in undirected graphs.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Cache-oblivious shortest paths in graphs using buffer heap.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On contract-and-refine transformations between phylogenetic trees.

[BibT_eX]

[DOI]

Ganeshkumar Ganapathy

Tandy J. Warnow

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies.

[BibT_eX]

[DOI]

Amit Prakash

Adnan Aziz

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003

Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design.

[BibT_eX]

[DOI]

Brian Grayson

Michael Dahlin

J. Parallel Distributed Comput., 2003

Better Hill-Climbing Searches for Parsimony.

[BibT_eX]

[DOI]

Ganeshkumar Ganapathy

Tandy J. Warnow

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

A near optimal scheduler for switch-memory-switch routers.

[BibT_eX]

[DOI]

Adnan Aziz

Amit Prakash

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

SPAA 1999 - Guest Editors' Foreword.

[BibT_eX]

[DOI]

Ramesh K. Sitaraman

Theory Comput. Syst., 2002

An optimal minimum spanning tree algorithm.

[BibT_eX]

[DOI]

J. ACM, 2002

Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence.

[BibT_eX]

[DOI]

Madhukar R. Korupolu

Algorithmica, 2002

Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution.

[BibT_eX]

[DOI]

Xiaoyu Zhang

Chandrajit Bajaj

Proceedings of the 4th Joint Eurographics - IEEE TCVG Symposium on Visualization, 2002

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Computing shortest paths with comparisons and additions.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Distance Oracles for Avoiding Link-Failure.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Experimental Evaluation of a New Shortest Path Algorithm.

[BibT_eX]

[DOI]

Srinath Sridhar

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Parallel Algorithm Design with Coarse-Grained Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

1999

Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

Modeling Parallel Bandwidth: Local versus Global Restrictions.

[BibT_eX]

[DOI]

Algorithmica, 1999

Experimental Evaluation of QSM, a Simple Shared-Memory Model.

[BibT_eX]

[DOI]

Brian Grayson

Michael Dahlin

Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998

ERCW PRAMs and Optical Communication.

[BibT_eX]

[DOI]

Philip D. MacKenzie

Theor. Comput. Sci., 1998

The Queue-Read Queue-Write Asynchronous PRAM Model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Computational Bounds for Fundamental Problems on General-Purpose Parallel Models.

[BibT_eX]

[DOI]

Philip D. MacKenzie

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

Parallel Algorithms for Reducible Flow Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1997

An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.

[BibT_eX]

[DOI]

Honghua Yang

Algorithmica, 1997

Modeling Parallel Bandwidth: Local vs. Global Restrictions.

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.

[BibT_eX]

[DOI]

Chung Keung Poon

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

QSM: A General Purpose Shared-Memory Model for Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems.

[BibT_eX]

[DOI]

Madhukar R. Korupolu

Proceedings of the Algorithms, 1997

1996

Efficient Massively Parallel Implementation of some Combinatorial Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem.

[BibT_eX]

[DOI]

Honghua Yang

SIAM J. Comput., 1996

Efficient Low-Contention Parallel Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Computing Minimal Spanning Subgraphs in Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

On Finding Minimal Two-Connected Subgraphs.

[BibT_eX]

[DOI]

Pierre Kelsen

J. Algorithms, 1995

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing.

[BibT_eX]

[DOI]

Nathaniel Dean

Proceedings of IPPS '95, 1995

1994

Parallel Random Access Machines with both Multiplication and Shifts

[BibT_eX]

[DOI]

Jerry L. Trahan

Michael C. Loui

Inf. Comput., April, 1994

Planarity Testing in Parallel.

[BibT_eX]

[DOI]

John H. Reif

J. Comput. Syst. Sci., 1994

Finding the Closed Partition of a Planar Graph.

[BibT_eX]

[DOI]

Honghua Yang

Algorithmica, 1994

The QRQW PRAM: Accounting for Contention in Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Parallel implementation of algorithms for finding connected components in graphs.

[BibT_eX]

[DOI]

Nathaniel Dean

Proceedings of the Parallel Algorithms, 1994

The Design and Evaluation of Parallel Algorithms (Abstract).

[BibT_eX]

[DOI]

Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993

Finding a Smallest Augmentation to Biconnect a Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Finding Triconnected Components by Local Replacement.

[BibT_eX]

[DOI]

Donald S. Fussell

Ramakrishna Thurimella

SIAM J. Comput., 1993

1992

Multiplication, Division and Shift Instructions in Parallel Random Access Machines.

[BibT_eX]

[DOI]

Jerry L. Trahan

Michael C. Loui

Theor. Comput. Sci., 1992

A new graph triconnectivity algorithm and its parallelization.

[BibT_eX]

[DOI]

Gary L. Miller

Comb., 1992

Implementation of Parallel Graph Algorithms on the MasPar.

[BibT_eX]

[DOI]

Nathaniel Dean

Proceedings of the Computational Support for Discrete Mathematics, 1992

1991

Improved Algorithms for Graph Four-Connectivity.

[BibT_eX]

[DOI]

Arkady Kanevsky

J. Comput. Syst. Sci., 1991

Transitive Compaction in Parallel via Branchings.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Parallel algorithm and complexity results for telephone link simulation.

[BibT_eX]

[DOI]

Li-Chung Wang

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

On Finding Minimal 2-Connected Subgraphs.

[BibT_eX]

[DOI]

Pierre Kelsen

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A Minimax Arc Theorem for Reducible Flow Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Linear Programming with Two Variables per Inequality in Poly-Log Time.

[BibT_eX]

[DOI]

George S. Lueker

Nimrod Megiddo

SIAM J. Comput., 1990

Lower Bounds for Parallel Computation on Linked Structures.

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Parallel Algorithms for Shared-Memory Machines.

[BibT_eX]

Richard M. Karp

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

A Framework for Parallel Graph Algorithm Design.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Finding Triconnected Components by Local Replacements.

[BibT_eX]

[DOI]

Donald S. Fussell

Ramakrishna Thurimella

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)

[BibT_eX]

[DOI]

John H. Reif

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

The Power of Parallel Random Access Machines with Augmented Instruction Sets.

[BibT_eX]

[DOI]

Jerry L. Trahan

Michael C. Loui

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits.

[BibT_eX]

[DOI]

Gary L. Miller

Erich L. Kaltofen

SIAM J. Comput., 1988

Finding a Minimum Feedback Arc Set in Reducible Flow Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1988

Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles.

[BibT_eX]

[DOI]

Paul Czerwinski

Algorithmica, 1988

Efficient Parallel Triconnectivity in Logarithmic Time.

[BibT_eX]

[DOI]

Uzi Vishkin

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

The complexity of minimum cut and maximum flow problems in an acyclic network.

[BibT_eX]

[DOI]

Networks, 1987

1986

Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1986

On driving many long wires in a VLSI layout.

[BibT_eX]

[DOI]

J. ACM, 1986

Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version)

[BibT_eX]

[DOI]

George S. Lueker

Nimrod Megiddo

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits.

[BibT_eX]

[DOI]

Gary L. Miller

Erich L. Kaltofen

Proceedings of the VLSI Algorithms and Architectures, 1986

1983

Single Residue Error Correction in Residue Number Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

An improved switch-level simulator for MOS circuits.

[BibT_eX]

[DOI]

Proceedings of the 20th Design Automation Conference, 1983

1982

On Driving Many Long Lines in a VLSI Layout

[BibT_eX]

[DOI]