S. Rao Kosaraju

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

An Algorithm for Computing DNA Walks.

[BibT_eX]

[DOI]

Ankur Bhargava

Proceedings of the Algorithms, 2004

2002

Optimizing area and aspect ration in straight-line orthogonal tree drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2002

2001

Euler paths in series parallel graphs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Mesh Algorithms for Multiplication and Division.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

Balanced Suffix Trees (Invited Lecture).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

1999

Compression of Low Entropy Strings with Lempel-Ziv Algorithms.

[BibT_eX]

[DOI]

Giovanni Manzini

SIAM J. Comput., 1999

On an Optimal Split Tree Problem.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Ryan S. Borgstrom

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Small Universal Graphs.

[BibT_eX]

[DOI]

Michael R. Capalbo

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

Approximation Algorithms for a Genetic Diagnostics Problem.

[BibT_eX]

[DOI]

Alejandro A. Schäffer

Leslie G. Biesecker

J. Comput. Biol., 1998

Drawing of Two-Dimensional Irregular Meshes.

[BibT_eX]

[DOI]

Alok Aggarwal

Mihai Pop

Proceedings of the Graph Drawing, 6th International Symposium, 1998

De-amortization of Algorithms.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Mihai Pop

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Emerging opportunities for theoretical computer science.

[BibT_eX]

[DOI]

Pavel A. Pevzner

SIGACT News, 1997

1996

Learning nested concept classes with limited storage.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1996

Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation.

[BibT_eX]

[DOI]

Michael T. Goodrich

J. ACM, 1996

Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

An NC Algorithm for Evaluating Monotone Planar Circuits.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields.

[BibT_eX]

[DOI]

J. ACM, 1995

Large-scale assembly of DNA strings and space-efficient construction of suffix trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Algorithms for Dynamic Closest Pair and n-Body Potential Fields.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Pattern Matching in Compressed Texts.

[BibT_eX]

[DOI]

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

Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations.

[BibT_eX]

[DOI]

Michael T. Goodrich

J. ACM, 1994

Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An Optimal RAM Implementation of Catenable Min Double-ended Queues.

[BibT_eX]

[DOI]

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

Long Tours and Short Superstrings (Preliminary Version)

[BibT_eX]

[DOI]

James K. Park

Clifford Stein

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Computation of Squares in a String (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Comparison-based search in the presence of errors.

[BibT_eX]

[DOI]

Ryan S. Borgstrom

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix.

[BibT_eX]

[DOI]

J. Algorithms, 1992

A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Computing external farthest neighbors for a simple polygon.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Optimal Tradeoffs for Addition on Systolic Arrays.

[BibT_eX]

[DOI]

Alok Aggarwal

J. Lawrence Carter

Algorithmica, 1991

1990

On Parallel Evaluation of Classes of Circuits.

[BibT_eX]

[DOI]

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

A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

An Efficient Algorithm for Maxdominance, with Applications.

[BibT_eX]

[DOI]

Algorithmica, 1989

Locating Faults in a Constant Number of Parallel Testing Rounds.

[BibT_eX]

[DOI]

Richard Beigel

Gregory F. Sullivan

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Constructing Trees in Parallel.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Pipelining Computations in a Tree of Processors (Preliminary Version)

[BibT_eX]

[DOI]

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

Efficient Tree Pattern Matching (Preliminary Version)

[BibT_eX]

[DOI]

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

Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version)

[BibT_eX]

[DOI]

Michael T. Goodrich

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

1988

Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Optimal simulations between mesh-connected arrays of processors.

[BibT_eX]

[DOI]

J. ACM, 1988

Sorting with Efficient Use of Special-Purpose Sorters.

[BibT_eX]

[DOI]

Greg N. Frederickson

Inf. Process. Lett., 1988

Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version)

[BibT_eX]

[DOI]

Gregory F. Sullivan

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Parallel Evaluation of Tree-Structured Computations by Raking.

[BibT_eX]

[DOI]

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

1986

New Algorithms for Multilink Robot Arms.

[BibT_eX]

[DOI]

Vitit Kantabutra

J. Comput. Syst. Sci., 1986

Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version)

[BibT_eX]

[DOI]

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

Parallel Evaluation of Division-Free Arithmetic Expressions

[BibT_eX]

[DOI]

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

Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract).

[BibT_eX]

[DOI]

Alok Aggarwal

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

A Generalized Dictionary Machine for VLSI.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1985

1984

Graph Problems on a Mesh-Connected Processor Array.

[BibT_eX]

[DOI]

J. ACM, 1984

1982

Decidability of Reachability in Vector Addition Systems (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Graph Problems on a Mesh-Connected Processor Array (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

An Adversary-Based Lower Bound for Sorting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Localized Search in Sorted Lists

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Recognition of Topological Equivalence of Patterns by Array Automata.

[BibT_eX]

[DOI]

Paul F. Dietz

J. Comput. Syst. Sci., 1980

1979

A Comparison of Multilevel break and next Statements.

[BibT_eX]

[DOI]

Brenda S. Baker

J. ACM, 1979

Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

On a Multidimensional Search Problem (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

Insertions and Deletions In One-Sided Height-Balanced Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1978

1977

On independent circuits of a digraph.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

1976

On Structuring Flowcharts (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

Speed of Recognition of Context-Free Languages by Array Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

Context-free Preserving Functions.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1975

1974

A Note on Probabilistic Input-Output Relations

[BibT_eX]

[DOI]

Inf. Control., October, 1974

On Some Open Problems in the Theory of Cellular Automata.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1974

Correction to "Regularity preserving functions".

[BibT_eX]

[DOI]

SIGACT News, 1974

Regularity preserving functions.

[BibT_eX]

[DOI]

SIGACT News, 1974

Analysis of Structured Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1974

1-Way Stack Automaton with Jumps.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1974

1973

Probabilistic Automata-A Problem of Paz

[BibT_eX]

[DOI]

Inf. Control., August, 1973

Limitations of Dijkstra's Semaphore Primitives and Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Fourth Symposium on Operating System Principles, 1973

1972

String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance

[BibT_eX]

[DOI]

Aravind K. Joshi

H. M. Yamada

Inf. Control., October, 1972

String Adjunct Grammars: I. Local and Distributed Adjunction

[BibT_eX]

[DOI]

Aravind K. Joshi

H. M. Yamada

Inf. Control., September, 1972

1969

Recognition of Context-Free and Stack Languages

[BibT_eX]

[DOI]

Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

String Adjunct Grammars

[BibT_eX]

[DOI]

Aravind K. Joshi