S. Rao Kosaraju

Publication Activity (10 Years)

Years Active: 1969-2005
Publications (10 Years): 0

Publications

Ankur Bhargava, S. Rao Kosaraju
Derandomization of Dimensionality Reduction and SDP Based Algorithms. WADS (2005)
Ankur Bhargava, S. Rao Kosaraju
An Algorithm for Computing DNA Walks. ESA (2004)
Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23 (2) (2002)
S. Rao Kosaraju
Mesh Algorithms for Multiplication and Division. HiPC (2001)
S. Rao Kosaraju
Euler paths in series parallel graphs. STOC (2001)
S. Rao Kosaraju
Balanced Suffix Trees (Invited Lecture). CPM (2001)
S. Rao Kosaraju, Giovanni Manzini
Compression of Low Entropy Strings with Lempel-Ziv Algorithms. SIAM J. Comput. 29 (3) (1999)
Michael R. Capalbo, S. Rao Kosaraju
Small Universal Graphs. STOC (1999)
S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom
On an Optimal Split Tree Problem. WADS (1999)
Alok Aggarwal, S. Rao Kosaraju, Mihai Pop
Drawing of Two-Dimensional Irregular Meshes. Graph Drawing (1998)
S. Rao Kosaraju, Mihai Pop
De-amortization of Algorithms. COCOON (1998)
S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
Approximation Algorithms for a Genetic Diagnostics Problem. J. Comput. Biol. 5 (1) (1998)
S. Rao Kosaraju, Giovanni Manzini
Compression of low entropy strings with Lempel-Ziv algorithms. SEQUENCES (1997)
S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
Approximation Algorithms for a Genetic Diagnostics Problem. WADS (1997)
Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner
Emerging opportunities for theoretical computer science. SIGACT News 28 (3) (1997)
David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan
Learning nested concept classes with limited storage. J. Exp. Theor. Artif. Intell. 8 (2) (1996)
S. Rao Kosaraju, Arthur L. Delcher
Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). STOC (1996)
Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Graph Drawing (1996)
Michael T. Goodrich, S. Rao Kosaraju
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. J. ACM 43 (2) (1996)
Paul B. Callahan, S. Rao Kosaraju
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. J. ACM 42 (1) (1995)
S. Rao Kosaraju, Arthur L. Delcher
Large-scale assembly of DNA strings and space-efficient construction of suffix trees. STOC (1995)
S. Rao Kosaraju
Pattern Matching in Compressed Texts. FSTTCS (1995)
Paul B. Callahan, S. Rao Kosaraju
Algorithms for Dynamic Closest Pair and n-Body Potential Fields. SODA (1995)
Arthur L. Delcher, S. Rao Kosaraju
An NC Algorithm for Evaluating Monotone Planar Circuits. SIAM J. Comput. 24 (2) (1995)
S. Rao Kosaraju
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). FOCS (1995)
S. Rao Kosaraju
An Optimal RAM Implementation of Catenable Min Double-ended Queues. SODA (1994)
S. Rao Kosaraju
Computation of Squares in a String (Preliminary Version). CPM (1994)
Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM 41 (6) (1994)
S. Rao Kosaraju, James K. Park, Clifford Stein
Long Tours and Short Superstrings (Preliminary Version) FOCS (1994)
S. Rao Kosaraju
Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). STOC (1994)
Ryan S. Borgstrom, S. Rao Kosaraju
Comparison-based search in the presence of errors. STOC (1993)
Paul B. Callahan, S. Rao Kosaraju
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. SODA (1993)
Paul B. Callahan, S. Rao Kosaraju
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) STOC (1992)
Mikhail J. Atallah, S. Rao Kosaraju
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. J. Algorithms 13 (3) (1992)
Mikhail J. Atallah, S. Rao Kosaraju
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. SODA (1991)
David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan
Learning Nested Concept Classes with Limited Storage. IJCAI (1991)
Alok Aggarwal, J. Lawrence Carter, S. Rao Kosaraju
Optimal Tradeoffs for Addition on Systolic Arrays. Algorithmica 6 (1) (1991)
Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31 (2) (1991)
S. Rao Kosaraju, Arthur L. Delcher
A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract) FOCS (1990)
S. Rao Kosaraju
On Parallel Evaluation of Classes of Circuits. FSTTCS (1990)
Michael T. Goodrich, S. Rao Kosaraju
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) FOCS (1989)
Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan
Locating Faults in a Constant Number of Parallel Testing Rounds. SPAA (1989)
Mikhail J. Atallah, S. Rao Kosaraju
An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4 (2) (1989)
S. Rao Kosaraju
Pipelining Computations in a Tree of Processors (Preliminary Version) FOCS (1989)
S. Rao Kosaraju
Efficient Tree Pattern Matching (Preliminary Version) FOCS (1989)
Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
Constructing Trees in Parallel. SPAA (1989)
Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC (1988)
S. Rao Kosaraju, Mikhail J. Atallah
Optimal simulations between mesh-connected arrays of processors. J. ACM 35 (3) (1988)
Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju
Sorting with Efficient Use of Special-Purpose Sorters. Inf. Process. Lett. 27 (1) (1988)
Mikhail J. Atallah, S. Rao Kosaraju
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. SIAM J. Comput. 17 (5) (1988)
S. Rao Kosaraju, Arthur L. Delcher
Optimal Parallel Evaluation of Tree-Structured Computations by Raking. AWOC (1988)
S. Rao Kosaraju, Gregory F. Sullivan
Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version) STOC (1988)
S. Rao Kosaraju, Mikhail J. Atallah
Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) STOC (1986)
Alok Aggarwal, S. Rao Kosaraju
Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract). Aegean Workshop on Computing (1986)
Vitit Kantabutra, S. Rao Kosaraju
New Algorithms for Multilink Robot Arms. J. Comput. Syst. Sci. 32 (1) (1986)
S. Rao Kosaraju
Parallel Evaluation of Division-Free Arithmetic Expressions STOC (1986)
Mikhail J. Atallah, S. Rao Kosaraju
A Generalized Dictionary Machine for VLSI. IEEE Trans. Computers 34 (2) (1985)
Mikhail J. Atallah, S. Rao Kosaraju
Graph Problems on a Mesh-Connected Processor Array. J. ACM 31 (3) (1984)
Mikhail J. Atallah, S. Rao Kosaraju
Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) STOC (1982)
S. Rao Kosaraju
Decidability of Reachability in Vector Addition Systems (Preliminary Version) STOC (1982)
S. Rao Kosaraju
Localized Search in Sorted Lists STOC (1981)
Mikhail J. Atallah, S. Rao Kosaraju
An Adversary-Based Lower Bound for Sorting. Inf. Process. Lett. 13 (2) (1981)
Paul F. Dietz, S. Rao Kosaraju
Recognition of Topological Equivalence of Patterns by Array Automata. J. Comput. Syst. Sci. 20 (1) (1980)
S. Rao Kosaraju
Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) STOC (1979)
Brenda S. Baker, S. Rao Kosaraju
A Comparison of Multilevel break and next Statements. J. ACM 26 (3) (1979)
S. Rao Kosaraju
On a Multidimensional Search Problem (Preliminary Version) STOC (1979)
S. Rao Kosaraju
Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) STOC (1979)
S. Rao Kosaraju
Insertions and Deletions In One-Sided Height-Balanced Trees. Commun. ACM 21 (3) (1978)
S. Rao Kosaraju
On independent circuits of a digraph. J. Graph Theory 1 (4) (1977)
S. Rao Kosaraju
On Structuring Flowcharts (Preliminary Version) STOC (1976)
S. Rao Kosaraju
Speed of Recognition of Context-Free Languages by Array Automata. SIAM J. Comput. 4 (3) (1975)
S. Rao Kosaraju
Context-free Preserving Functions. Math. Syst. Theory 9 (3) (1975)
S. Rao Kosaraju
Regularity preserving functions. SIGACT News 6 (2) (1974)
S. Rao Kosaraju
A Note on Probabilistic Input-Output Relations Inf. Control. 26 (2) (1974)
S. Rao Kosaraju
Correction to "Regularity preserving functions". SIGACT News 6 (3) (1974)
S. Rao Kosaraju
1-Way Stack Automaton with Jumps. J. Comput. Syst. Sci. 9 (2) (1974)
S. Rao Kosaraju
On Some Open Problems in the Theory of Cellular Automata. IEEE Trans. Computers 23 (6) (1974)
S. Rao Kosaraju
Analysis of Structured Programs. J. Comput. Syst. Sci. 9 (3) (1974)
S. Rao Kosaraju
Probabilistic Automata-A Problem of Paz Inf. Control. 23 (1) (1973)
S. Rao Kosaraju
Limitations of Dijkstra's Semaphore Primitives and Petri Nets. SOSP (1973)
S. Rao Kosaraju
Analysis of Structured Programs STOC (1973)
Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada
String Adjunct Grammars: I. Local and Distributed Adjunction Inf. Control. 21 (2) (1972)
Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada
String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance Inf. Control. 21 (3) (1972)
S. Rao Kosaraju
Recognition of Context-Free and Stack Languages SWAT (1969)
Aravind K. Joshi, S. Rao Kosaraju, H. Yamada
String Adjunct Grammars SWAT (1969)