| 2012 | ESA | Two Dimensional Range Minimum Queries and Fibonacci Lattices. | Gerth Stlting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao |
| 2011 | ISAAC | Encoding 2D Range Maximum Queries. | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
| 2011 | TAMC | Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. | Pooya Davoodi, S. Srinivasa Rao |
| 2011 | WADS | Path Minima Queries in Dynamic Weighted Trees. | Gerth Stlting Brodal, Pooya Davoodi, S. Srinivasa Rao |
| 2010 | ESA | On Space Efficient Two Dimensional Range Minimum Data Structures. | Gerth Stlting Brodal, Pooya Davoodi, S. Srinivasa Rao |
| 2009 | ICALP | Universal Succinct Representations of Trees? | Arash Farzan, Rajeev Raman, S. Srinivasa Rao |
| 2009 | STACS | More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
| 2008 | ECAI | Compressing Binary Decision Diagrams. | Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann |
| 2007 | ESA | On the Size of Succinct Indices. | Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao |
| 2007 | ICALP | Succinct Ordinal Trees Based on Tree Covering. | Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2007 | SODA | Succinct indexes for strings, binary relations and multi-labeled trees. | Jrmy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2006 | CPM | Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. | Jrmy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao |
| 2006 | SODA | Rank/select operations on large alphabets: a tool for text indexing. | Alexander Golynski, J. Ian Munro, S. Srinivasa Rao |
| 2005 | SODA | A categorization theorem on suffix arrays with applications to space efficient text indexes. | Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2005 | SODA | An optimal Bloom filter replacement. | Anna Pagh, Rasmus Pagh, S. Srinivasa Rao |
| 2004 | ICALP | Succinct Representations of Functions. | J. Ian Munro, S. Srinivasa Rao |
| 2003 | ICALP | Succinct Representations of Permutations. | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2003 | ICALP | Succinct Dynamic Dictionaries and Trees. | Rajeev Raman, S. Srinivasa Rao |
| 2003 | WABI | Computing Refined Buneman Trees in Cubic Time. | Gerth Stlting Brodal, Rolf Fagerberg, Anna stlin, Christian N. S. Pedersen, S. Srinivasa Rao |
| 2002 | SODA | Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | ESA | Explicit Deterministic Constructions for Membership in the Bitprobe Model. | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | WADS | Succinct Dynamic Data Structures. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 1999 | ISAAC | Static Dictionaries Supporting Rank. | Venkatesh Raman, S. Srinivasa Rao |