String Adjunct Grammars - Aravind K. Joshi; S. Rao Kosaraju; H. Yamada (SWAT, 1969)

Recognition of Context-Free and Stack Languages - S. Rao Kosaraju (SWAT, 1969)

String Adjunct Grammars: I. Local and Distributed Adjunction - Aravind K. Joshi; S. Rao Kosaraju; H. M. Yamada (Inf. Control., 1972)

String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance - Aravind K. Joshi; S. Rao Kosaraju; H. M. Yamada (Inf. Control., 1972)

Limitations of Dijkstra's Semaphore Primitives and Petri Nets. - S. Rao Kosaraju (SOSP, 1973)

Probabilistic Automata-A Problem of Paz - S. Rao Kosaraju (Inf. Control., 1973)

1-Way Stack Automaton with Jumps. - S. Rao Kosaraju (J. Comput. Syst. Sci., 1974)

Analysis of Structured Programs. - S. Rao Kosaraju (J. Comput. Syst. Sci., 1974)

Regularity preserving functions. - S. Rao Kosaraju (SIGACT News, 1974)

Correction to "Regularity preserving functions". - S. Rao Kosaraju (SIGACT News, 1974)

On Some Open Problems in the Theory of Cellular Automata. - S. Rao Kosaraju (IEEE Trans. Computers, 1974)

A Note on Probabilistic Input-Output Relations - S. Rao Kosaraju (Inf. Control., 1974)

Context-free Preserving Functions. - S. Rao Kosaraju (Math. Syst. Theory, 1975)

Speed of Recognition of Context-Free Languages by Array Automata. - S. Rao Kosaraju (SIAM J. Comput., 1975)

On Structuring Flowcharts (Preliminary Version) - S. Rao Kosaraju (STOC, 1976)

On independent circuits of a digraph. - S. Rao Kosaraju (J. Graph Theory, 1977)

Insertions and Deletions In One-Sided Height-Balanced Trees. - S. Rao Kosaraju (Commun. ACM, 1978)

On a Multidimensional Search Problem (Preliminary Version) - S. Rao Kosaraju (STOC, 1979)

Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) - S. Rao Kosaraju (STOC, 1979)

Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) - S. Rao Kosaraju (STOC, 1979)

A Comparison of Multilevel break and next Statements. - Brenda S. Baker; S. Rao Kosaraju (J. ACM, 1979)

Recognition of Topological Equivalence of Patterns by Array Automata. - Paul F. Dietz; S. Rao Kosaraju (J. Comput. Syst. Sci., 1980)

Localized Search in Sorted Lists - S. Rao Kosaraju (STOC, 1981)

An Adversary-Based Lower Bound for Sorting. - Mikhail J. Atallah; S. Rao Kosaraju (Inf. Process. Lett., 1981)

Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) - Mikhail J. Atallah; S. Rao Kosaraju (STOC, 1982)

Decidability of Reachability in Vector Addition Systems (Preliminary Version) - S. Rao Kosaraju (STOC, 1982)

Graph Problems on a Mesh-Connected Processor Array. - Mikhail J. Atallah; S. Rao Kosaraju (J. ACM, 1984)

A Generalized Dictionary Machine for VLSI. - Mikhail J. Atallah; S. Rao Kosaraju (IEEE Trans. Computers, 1985)

Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract). - Alok Aggarwal; S. Rao Kosaraju (Aegean Workshop on Computing, 1986)

Parallel Evaluation of Division-Free Arithmetic Expressions - S. Rao Kosaraju (STOC, 1986)

Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) - S. Rao Kosaraju; Mikhail J. Atallah (STOC, 1986)

New Algorithms for Multilink Robot Arms. - Vitit Kantabutra; S. Rao Kosaraju (J. Comput. Syst. Sci., 1986)

Optimal Parallel Evaluation of Tree-Structured Computations by Raking. - S. Rao Kosaraju; Arthur L. Delcher (AWOC, 1988)

Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version) - S. Rao Kosaraju; Gregory F. Sullivan (STOC, 1988)

Sorting with Efficient Use of Special-Purpose Sorters. - Mikhail J. Atallah; Greg N. Frederickson; S. Rao Kosaraju (Inf. Process. Lett., 1988)

Optimal simulations between mesh-connected arrays of processors. - S. Rao Kosaraju; Mikhail J. Atallah (J. ACM, 1988)

Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. - Mikhail J. Atallah; S. Rao Kosaraju (SIAM J. Comput., 1988)

Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) - Michael T. Goodrich; S. Rao Kosaraju (FOCS, 1989)

Efficient Tree Pattern Matching (Preliminary Version) - S. Rao Kosaraju (FOCS, 1989)

Pipelining Computations in a Tree of Processors (Preliminary Version) - S. Rao Kosaraju (FOCS, 1989)

Constructing Trees in Parallel. - Mikhail J. Atallah; S. Rao Kosaraju; Lawrence L. Larmore; Gary L. Miller; Shang-Hua Teng (SPAA, 1989)

Locating Faults in a Constant Number of Parallel Testing Rounds. - Richard Beigel; S. Rao Kosaraju; Gregory F. Sullivan (SPAA, 1989)

An Efficient Algorithm for Maxdominance, with Applications. - Mikhail J. Atallah; S. Rao Kosaraju (Algorithmica, 1989)

A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract) - S. Rao Kosaraju; Arthur L. Delcher (FOCS, 1990)

On Parallel Evaluation of Classes of Circuits. - S. Rao Kosaraju (FSTTCS, 1990)

Optimal Tradeoffs for Addition on Systolic Arrays. - Alok Aggarwal; J. Lawrence Carter; S. Rao Kosaraju (Algorithmica, 1991)

Computing external farthest neighbors for a simple polygon. - Pankaj K. Agarwal; Alok Aggarwal; Boris Aronov; S. Rao Kosaraju; Baruch Schieber; Subhash Suri (Discret. Appl. Math., 1991)

A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) - Paul B. Callahan; S. Rao Kosaraju (STOC, 1992)

An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. - Mikhail J. Atallah; S. Rao Kosaraju (J. Algorithms, 1992)

Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. - Paul B. Callahan; S. Rao Kosaraju (SODA, 1993)

Comparison-based search in the presence of errors. - Ryan S. Borgstrom; S. Rao Kosaraju (STOC, 1993)

Computation of Squares in a String (Preliminary Version). - S. Rao Kosaraju (CPM, 1994)

Long Tours and Short Superstrings (Preliminary Version) - S. Rao Kosaraju; James K. Park; Clifford Stein 001 (FOCS, 1994)

An Optimal RAM Implementation of Catenable Min Double-ended Queues. - S. Rao Kosaraju (SODA, 1994)

Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). - S. Rao Kosaraju (STOC, 1994)

Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. - Mikhail J. Atallah; Michael T. Goodrich; S. Rao Kosaraju (J. ACM, 1994)

Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). - S. Rao Kosaraju (FOCS, 1995)

Pattern Matching in Compressed Texts. - S. Rao Kosaraju (FSTTCS, 1995)

Algorithms for Dynamic Closest Pair and n-Body Potential Fields. - Paul B. Callahan; S. Rao Kosaraju (SODA, 1995)

Large-scale assembly of DNA strings and space-efficient construction of suffix trees. - S. Rao Kosaraju; Arthur L. Delcher (STOC, 1995)

A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. - Paul B. Callahan; S. Rao Kosaraju (J. ACM, 1995)

An NC Algorithm for Evaluating Monotone Planar Circuits. - Arthur L. Delcher; S. Rao Kosaraju (SIAM J. Comput., 1995)

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. - Timothy M. Chan; Michael T. Goodrich; S. Rao Kosaraju; Roberto Tamassia (GD, 1996)

Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). - S. Rao Kosaraju; Arthur L. Delcher (STOC, 1996)

Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. - Michael T. Goodrich; S. Rao Kosaraju (J. ACM, 1996)

Learning nested concept classes with limited storage. - David G. Heath; Simon Kasif; S. Rao Kosaraju; Steven Salzberg; Gregory F. Sullivan (J. Exp. Theor. Artif. Intell., 1996)

Emerging opportunities for theoretical computer science. - Alfred V. Aho; David S. Johnson 001; Richard M. Karp; S. Rao Kosaraju; Catherine C. McGeoch; Christos H. Papadimitriou; Pavel A. Pevzner (SIGACT News, 1997)

De-amortization of Algorithms. - S. Rao Kosaraju; Mihai Pop (COCOON, 1998)

Drawing of Two-Dimensional Irregular Meshes. - Alok Aggarwal; S. Rao Kosaraju; Mihai Pop (GD, 1998)

Approximation Algorithms for a Genetic Diagnostics Problem. - S. Rao Kosaraju; Alejandro A. Schäffer; Leslie G. Biesecker (J. Comput. Biol., 1998)

Small Universal Graphs. - Michael R. Capalbo; S. Rao Kosaraju (STOC, 1999)

On an Optimal Split Tree Problem. - S. Rao Kosaraju; Teresa M. Przytycka; Ryan S. Borgstrom (WADS, 1999)

Compression of Low Entropy Strings with Lempel-Ziv Algorithms. - S. Rao Kosaraju; Giovanni Manzini (SIAM J. Comput., 1999)

Balanced Suffix Trees (Invited Lecture). - S. Rao Kosaraju (CPM, 2001)

Mesh Algorithms for Multiplication and Division. - S. Rao Kosaraju (HiPC, 2001)

Euler paths in series parallel graphs. - S. Rao Kosaraju (STOC, 2001)

Optimizing area and aspect ration in straight-line orthogonal tree drawings. - Timothy M. Chan; Michael T. Goodrich; S. Rao Kosaraju; Roberto Tamassia (Comput. Geom., 2002)

An Algorithm for Computing DNA Walks. - Ankur Bhargava; S. Rao Kosaraju (ESA, 2004)

Derandomization of Dimensionality Reduction and SDP Based Algorithms. - Ankur Bhargava; S. Rao Kosaraju (WADS, 2005)