S. Srinivasa Rao

52 papers A* 9A 5B 5C 2Journal 21Unranked 8

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