| 2005 | WADS | Derandomization of Dimensionality Reduction and SDP Based Algorithms. | Ankur Bhargava, S. Rao Kosaraju |
| 2004 | ESA | An Algorithm for Computing DNA Walks. | Ankur Bhargava, S. Rao Kosaraju |
| 2001 | CPM | Balanced Suffix Trees (Invited Lecture). | S. Rao Kosaraju |
| 2001 | HiPC | Mesh Algorithms for Multiplication and Division. | S. Rao Kosaraju |
| 2001 | STOC | Euler paths in series parallel graphs. | S. Rao Kosaraju |
| 1999 | STOC | Small Universal Graphs. | Michael R. Capalbo, S. Rao Kosaraju |
| 1999 | WADS | On an Optimal Split Tree Problem. | S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom |
| 1998 | COCOON | De-amortization of Algorithms. | S. Rao Kosaraju, Mihai Pop |
| 1998 | GD | Drawing of Two-Dimensional Irregular Meshes. | Alok Aggarwal, S. Rao Kosaraju, Mihai Pop |
| 1997 | WADS | Approximation Algorithms for a Genetic Diagnostics Problem. | S. Rao Kosaraju, Alejandro A. Schffer, Leslie G. Biesecker |
| 1996 | GD | Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia |
| 1996 | STOC | Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). | S. Rao Kosaraju, Arthur L. Delcher |
| 1995 | FOCS | Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). | S. Rao Kosaraju |
| 1995 | SODA | Algorithms for Dynamic Closest Pair and n-Body Potential Fields. | Paul B. Callahan, S. Rao Kosaraju |
| 1995 | STOC | Large-scale assembly of DNA strings and space-efficient construction of suffix trees. | S. Rao Kosaraju, Arthur L. Delcher |
| 1994 | CPM | Computation of Squares in a String (Preliminary Version). | S. Rao Kosaraju |
| 1994 | FOCS | Long Tours and Short Superstrings (Preliminary Version) | S. Rao Kosaraju, James K. Park, Clifford Stein |
| 1994 | SODA | An Optimal RAM Implementation of Catenable Min Double-ended Queues. | S. Rao Kosaraju |
| 1994 | STOC | Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). | S. Rao Kosaraju |
| 1993 | SODA | Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. | Paul B. Callahan, S. Rao Kosaraju |
| 1993 | STOC | Comparison-based search in the presence of errors. | Ryan S. Borgstrom, S. Rao Kosaraju |
| 1992 | STOC | 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 |
| 1991 | IJCAI | Learning Nested Concept Classes with Limited Storage. | David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan |
| 1991 | SODA | An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. | Mikhail J. Atallah, S. Rao Kosaraju |
| 1990 | FOCS | A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract) | S. Rao Kosaraju, Arthur L. Delcher |
| 1989 | FOCS | Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) | Michael T. Goodrich, S. Rao Kosaraju |
| 1989 | FOCS | Efficient Tree Pattern Matching (Preliminary Version) | S. Rao Kosaraju |
| 1989 | FOCS | Pipelining Computations in a Tree of Processors (Preliminary Version) | S. Rao Kosaraju |
| 1989 | SPAA | Constructing Trees in Parallel. | Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng |
| 1989 | SPAA | Locating Faults in a Constant Number of Parallel Testing Rounds. | Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan |
| 1988 | STOC | Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version) | S. Rao Kosaraju, Gregory F. Sullivan |
| 1986 | STOC | Parallel Evaluation of Division-Free Arithmetic Expressions | S. Rao Kosaraju |
| 1986 | STOC | Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) | S. Rao Kosaraju, Mikhail J. Atallah |
| 1982 | STOC | Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) | Mikhail J. Atallah, S. Rao Kosaraju |
| 1982 | STOC | Decidability of Reachability in Vector Addition Systems (Preliminary Version) | S. Rao Kosaraju |
| 1981 | STOC | Localized Search in Sorted Lists | S. Rao Kosaraju |
| 1979 | STOC | On a Multidimensional Search Problem (Preliminary Version) | S. Rao Kosaraju |
| 1979 | STOC | Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) | S. Rao Kosaraju |
| 1979 | STOC | Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) | S. Rao Kosaraju |
| 1976 | STOC | On Structuring Flowcharts (Preliminary Version) | S. Rao Kosaraju |
| 1973 | STOC | Analysis of Structured Programs | S. Rao Kosaraju |
| 1973 | SOSP | Limitations of Dijkstra's Semaphore Primitives and Petri Nets. | S. Rao Kosaraju |
| 1969 | FOCS | String Adjunct Grammars | Aravind K. Joshi, S. Rao Kosaraju, H. Yamada |
| 1969 | FOCS | Recognition of Context-Free and Stack Languages | S. Rao Kosaraju |