S. Srinivasa Rao

Publication Activity (10 Years)

Years Active: 1998-2017
Publications (10 Years): 2

Top Topics

Complex Queries

External Memory

Multiple Representations

Top Venues

Space-Efficient Data Structures, Streams, and Algorithms

Theor. Comput. Sci.

Publications

Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Finding modes with equality comparisons. Theor. Comput. Sci. 704 (2017)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Queries. ACM Trans. Algorithms 13 (2) (2017)
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69 (4) (2014)
Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao
A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Rajeev Raman, S. Srinivasa Rao
Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Encoding Range Minimum Queries. CoRR (2013)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63 (4) (2012)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63 (1-2) (2012)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct representations of permutations and functions. Theor. Comput. Sci. 438 (2012)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA (2012)
Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson
Competitive Online Selection in Main and External Memory CoRR (2012)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
Encoding 2D Range Maximum Queries. ISAAC (2011)
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
Optimal Indexes for Sparse Bit Vectors CoRR (2011)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
Encoding 2-D Range Maximum Queries CoRR (2011)
Pooya Davoodi, S. Srinivasa Rao
Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. TAMC (2011)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
Path Minima Queries in Dynamic Weighted Trees. WADS (2011)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Representations of Permutations and Functions CoRR (2011)
Jyrki Katajainen, S. Srinivasa Rao
A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110 (23) (2010)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
On Space Efficient Two Dimensional Range Minimum Data Structures. ESA (2) (2010)
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS (2009)
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
Universal Succinct Representations of Trees? ICALP (1) (2009)
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries CoRR (2009)
Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
On the Redundancy of Succinct Data Structures. SWAT (2008)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External memory planar point location with logarithmic updates. SCG (2008)
Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann
Compressing Binary Decision Diagrams. ECAI (2008)
Rasmus Pagh, S. Srinivasa Rao
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes CoRR (2008)
Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann
Compressing Binary Decision Diagrams CoRR (2008)
Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
Succinct indexes for strings, binary relations and multi-labeled trees. SODA (2007)
Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
On the Size of Succinct Indices. ESA (2007)
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387 (3) (2007)
Meng He, J. Ian Munro, S. Srinivasa Rao
Succinct Ordinal Trees Based on Tree Covering. ICALP (2007)
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM (2006)
Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
Rank/select operations on large alphabets: a tool for text indexing. SODA (2006)
David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Representing Trees of Higher Degree. Algorithmica 43 (4) (2005)
Anna Pagh, Rasmus Pagh, S. Srinivasa Rao
An optimal Bloom filter replacement. SODA (2005)
Meng He, J. Ian Munro, S. Srinivasa Rao
A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA (2005)
J. Ian Munro, S. Srinivasa Rao
Succinct Representations of Functions. ICALP (2004)
Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari
Longest increasing subsequences in sliding windows. Theor. Comput. Sci. 321 (2-3) (2004)
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao
Computing Refined Buneman Trees in Cubic Time. WABI (2003)
Rajeev Raman, S. Srinivasa Rao
Succinct Dynamic Dictionaries and Trees. ICALP (2003)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Representations of Permutations. ICALP (2003)
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA (2002)
Juha Kärkkäinen, S. Srinivasa Rao
Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies (2002)
S. Srinivasa Rao
Time-space trade-offs for compressed suffix arrays. Inf. Process. Lett. 82 (6) (2002)
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Dynamic Data Structures. WADS (2001)
Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA (2001)
J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Space Efficient Suffix Trees. J. Algorithms 39 (2) (2001)
Venkatesh Raman, S. Srinivasa Rao
Static Dictionaries Supporting Rank. ISAAC (1999)
Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65 (1) (1998)
J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Space Efficient Suffix Trees. FSTTCS (1998)