| 2022 | DCC | On Dynamic Bitvector Implementations. | Saska Dnges, Simon J. Puglisi, Rajeev Raman |
| 2021 | CPM | Weighted Ancestors in Suffix Trees Revisited. | Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman |
| 2021 | DCC | On Elias-Fano for Rank Queries in FM-Indexes. | Danyang Ma, Simon J. Puglisi, Rajeev Raman, Bella Zhukova |
| 2020 | DCC | Compressing and Randomly Accessing Sequences (note). | Laith Ali Abdusahib, Diego Arroyuelo, Rajeev Raman |
| 2019 | DEXA | Succinct BWT-Based Sequence Prediction. | Rafael Ktistakis, Philippe Fournier-Viger, Simon J. Puglisi, Rajeev Raman |
| 2019 | SPIRE | Adaptive Succinctness. | Diego Arroyuelo, Rajeev Raman |
| 2018 | DEXA | Frequent Itemset Mining on Correlated Probabilistic Databases. | Yasemin Asan Kalaz, Rajeev Raman |
| 2018 | PODS | In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract. | Rajeev Raman |
| 2017 | ALENEX | Compact Dynamic Rewritable (CDRW) Arrays. | Andreas Poyias, Simon J. Puglisi, Rajeev Raman |
| 2017 | SPIRE | LZ78 Compression in Low Main Memory Space. | Diego Arroyuelo, Rodrigo Cnovas, Gonzalo Navarro, Rajeev Raman |
| 2015 | CADE | SEPIA: Search for Proofs Using Inferred Automata. | Thomas Gransden, Neil Walkinshaw, Rajeev Raman |
| 2015 | CPM | Encoding Nearest Larger Values. | Patrick K. Nicholson, Rajeev Raman |
| 2015 | PAKDD | CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree. | Ted Gueniche, Philippe Fournier-Viger, Rajeev Raman, Vincent S. Tseng |
| 2015 | SPIRE | Improved Practical Compact Dynamic Tries. | Andreas Poyias, Rajeev Raman |
| 2015 | WALCOM | Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. | Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti |
| 2015 | WALCOM | Encoding Data Structures. | Rajeev Raman |
| 2014 | DCC | Compressed Bit Vectors Based on Variable-to-Fixed Encodings. | Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti |
| 2013 | ESA | Encodings for Range Selection and Top-k Queries. | Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti |
| 2013 | ICALP | Dynamic Compressed Strings with Random Access. | Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini |
| 2012 | COCOON | Succinct Representations of Binary Trees for Range Minimum Queries. | Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti |
| 2012 | ESA | Two Dimensional Range Minimum Queries and Fibonacci Lattices. | Gerth Stlting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao |
| 2012 | ICALP | Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. | Arash Farzan, J. Ian Munro, Rajeev Raman |
| 2012 | IWOCA | Range Extremum Queries. | Rajeev Raman |
| 2011 | ISAAC | Encoding 2D Range Maximum Queries. | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
| 2011 | PAKDD | Mining Sequential Patterns from Probabilistic Databases. | Muhammad Muzammal, Rajeev Raman |
| 2011 | SODA | Random Access to grammar-Compressed Strings. | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
| 2010 | ADMA | On Probabilistic Models for Uncertain Sequential Pattern Mining. | Muhammad Muzammal, Rajeev Raman |
| 2010 | ICALP | Optimal Trade-Offs for Succinct String Indexes. | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
| 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 | EDBT | Engineering succinct DOM. | O'Neil Delpratt, Rajeev Raman, Naila Rahman |
| 2008 | STACS | Computing Minimum Spanning Trees with Uncertainty. | Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Mats Mihalk, Rajeev Raman |
| 2007 | ESA | On the Size of Succinct Indices. | Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao |
| 2007 | SOFSEM | Compressed Prefix Sums. | O'Neil Delpratt, Naila Rahman, Rajeev Raman |
| 2004 | CPM | A Simple Optimal Representation for Balanced Parentheses. | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
| 2004 | SODA | Succinct ordinal trees with level-ancestor queries. | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
| 2003 | CIAC | Efficient Update Strategies for Geometric Computing with Uncertainty. | Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman |
| 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 |
| 2002 | ICALP | Exponential Structures for Efficient Cache-Oblivious Algorithms. | Michael A. Bender, Richard Cole, Rajeev Raman |
| 2002 | SODA | Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | WADS | Succinct Dynamic Data Structures. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2000 | ESA | Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. | Naila Rahman, Rajeev Raman |
| 1996 | ESA | Priority Queues: Small, Monotone and Trans-dichotomous. | Rajeev Raman |
| 1995 | STOC | Sorting in linear time? | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
| 1994 | SODA | Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. | Rajeev Raman, Uzi Vishkin |
| 1993 | ESA | Randomized Routing on Meshes with Buses. | Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman |
| 1993 | MFCS | Approximate and Exact Deterministic Parallel Selection. | Shiva Chaudhuri, Torben Hagerup, Rajeev Raman |
| 1993 | SODA | Lower Bounds for Set Intersection Queries. | Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig |
| 1993 | SODA | Randomized Data Structures for the Dynamic Closest-Pair Problem. | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
| 1993 | SPAA | Fast Deterministic Approximate and Exact Parallel Sorting. | Torben Hagerup, Rajeev Raman |
| 1993 | WADS | Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). | Paul F. Dietz, Rajeev Raman |
| 1992 | FOCS | Waste Makes Haste: Tight Bounds for Loose Parallel Sorting | Torben Hagerup, Rajeev Raman |
| 1991 | ICCI | Generating Random Graphs Efficiently. | Rajeev Raman |
| 1991 | SODA | Persistence, Amortization and Randomization. | Paul F. Dietz, Rajeev Raman |
| 1990 | ICCI | A Constant Update Time Finger Search Tree. | Paul F. Dietz, Rajeev Raman |