S. Srinivasa Rao

发表

Encodings for Range Selection and Top-k Queries

Rajeev Raman, Gonzalo Navarro, Roberto Grossi, 2013, ESA.

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries

Rajeev Raman, Gonzalo Navarro, Roberto Grossi, 2017, ACM Trans. Algorithms.

On the Redundancy of Succinct Data Structures

Rajeev Raman, S. Srinivasa Rao, Alexander Golynski, 2008, SWAT.

SBH: Super byte-aligned hybrid bitmap compression

S. Srinivasa Rao, Bongki Moon, Junhee Lee, 2016, Inf. Syst..

Theory and Implementation of Online Multiselection Algorithms

S. Srinivasa Rao, Jérémy Barbay, Ankur Gupta, 2013, ESA.

Sorting and Selection with Equality Comparisons

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 2015, WADS.

Rank/select operations on large alphabets: a tool for text indexing

S. Srinivasa Rao, J. Ian Munro, Alexander Golynski, 2006, SODA '06.

Computing Refined Buneman Trees in Cubic Time

S. Srinivasa Rao, Anna Pagh, Christian N. S. Pedersen, 2002, WABI.

Selection from read-only memory with limited workspace

Amr Elmasry, S. Srinivasa Rao, Jyrki Katajainen, 2013, Theor. Comput. Sci..

Longest increasing subsequences in sliding windows

Alejandro López-Ortiz, S. Srinivasa Rao, Alexander Golynski, 2004, Theor. Comput. Sci..

Compressing and Indexing Structured Text

S. Srinivasa Rao, Paolo Ferragina, P. Ferragina, 2016, Encyclopedia of Algorithms.

Succinct Representation for (Non)Deterministic Finite Automata pdf

Roberto Grossi, S. Srinivasa Rao, Kunihiko Sadakane, 2019, J. Comput. Syst. Sci..

Two dimensional range minimum queries and Fibonacci lattices

Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao, 2012, Theor. Comput. Sci..

Synergistic Solutions on MultiSets

S. Srinivasa Rao, Jérémy Barbay, Carlos Ochoa, 2017, CPM.

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds

S. Srinivasa Rao, Venkatesh Raman, Niranka Banerjee, 2018, CSR.

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS

S. Srinivasa Rao, Sankardeep Chakraborty, 2019, J. Comb. Optim..

Succinct ordinal trees based on tree covering

S. Srinivasa Rao, J. Ian Munro, Meng He, 2012, TALG.

Succinct Dynamic Data Structures

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2001, WADS.

Two dimensional range minimum queries and Fibonacci lattices

Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao, 2016, Theor. Comput. Sci..

Tree Compression and Indexing

S. Srinivasa Rao, Paolo Ferragina, P. Ferragina, 2008, Encyclopedia of Algorithms.

Encoding Two-Dimensional Range Top-k Queries

S. Srinivasa Rao, Seungbum Jo, Rahul Lingala, 2016, CPM.

Random access to grammar-compressed strings pdf

Gad M. Landau, Philip Bille, S. Srinivasa Rao, 2010, SODA '11.

Succinct Data Structures for Families of Interval Graphs pdf

S. Srinivasa Rao, Seungbum Jo, Hüseyin Acan, 2019, WADS.

Space Efficient Linear Time Algorithms for BFS, DFS and Applications

S. Srinivasa Rao, Venkatesh Raman, Sankardeep Chakraborty, 2017, Theory of Computing Systems.

Compressed Bit vectors Based on Variable-to-Fixed Encodings

Stelios Joannou, Rajeev Raman, S. Srinivasa Rao, 2017, Comput. J..

Static Dictionaries Supporting Rank

S. Srinivasa Rao, Venkatesh Raman, 1999, ISAAC.

Succinct representations of permutations and functions

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2011, Theor. Comput. Sci..

Set and array based hybrid data structure solution for Frequent Pattern Mining

S. Srinivasa Rao, Neha Dwivedi, S. S. Rao, 2015, 2015 Tenth International Conference on Digital Information Management (ICDIM).

Space efficient data structures for nearest larger neighbor

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2016, J. Discrete Algorithms.

Succinct Representations of Binary Trees for Range Minimum Queries

Rajeev Raman, S. Srinivasa Rao, Pooya Davoodi, 2012, COCOON.

Path Minima Queries in Dynamic Weighted Trees

S. Srinivasa Rao, Gerth Stølting Brodal, Pooya Davoodi, 2011, WADS.

Full-Text Indexes in External Memory

S. Srinivasa Rao, Juha Kärkkäinen, 2002, Algorithms for Memory Hierarchies.

On Space Efficient Two Dimensional Range Minimum Data Structures

S. Srinivasa Rao, Gerth Stølting Brodal, Pooya Davoodi, 2010, ESA.

A compact data structure for representing a dynamic multiset

S. Srinivasa Rao, Jyrki Katajainen, 2010, Inf. Process. Lett..

Compressing Binary Decision Diagrams

S. Srinivasa Rao, Esben Rune Hansen, Peter Tiedemann, 2008, ECAI.

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications

S. Srinivasa Rao, Sankardeep Chakraborty, Sankardeep Chakraborty, 2017, COCOON.

Succinct Representations of Permutations

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2003, ICALP.

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2009, STACS.

External Memory Planar Point Location with Logarithmic Updates

S. Srinivasa Rao, Lars Arge, Gerth Stølting Brodal, 2008, Algorithmica.

Selection from read-only memory with limited workspace

Amr Elmasry, S. Srinivasa Rao, Jyrki Katajainen, 2014, Theor. Comput. Sci..

Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2007, ACM Trans. Algorithms.

Adaptive searching in succinctly encoded binary relations and tree-structured documents

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2007, Theor. Comput. Sci..

On Space Efficient Two Dimensional Range Minimum Data Structures

S. Srinivasa Rao, Gerth Stølting Brodal, Pooya Davoodi, 2011, Algorithmica.

Encoding 2-D Range Maximum Queries

John Iacono, S. Srinivasa Rao, Danny Krizanc, 2016, Theor. Comput. Sci..

Explicit Deterministic Constructions for Membership in the Bitprobe Model

Jaikumar Radhakrishnan, S. Srinivasa Rao, Venkatesh Raman, 2001, ESA.

A Survey of Data Structures in the Bitprobe Model

S. Srinivasa Rao, Venkatesh Raman, Patrick K. Nicholson, 2013, Space-Efficient Data Structures, Streams, and Algorithms.

Compressed Bit Vectors Based on Variable-to-Fixed Encodings

Stelios Joannou, Rajeev Raman, S. Srinivasa Rao, 2014, 2014 Data Compression Conference.

A Simplified NP-Complete MAXSAT Problem

S. Srinivasa Rao, Venkatesh Raman, Bala Ravikumar, 1998, Inf. Process. Lett..

Dynamic Online Multiselection in Internal and External Memory

S. Srinivasa Rao, Jérémy Barbay, Ankur Gupta, 2015, WALCOM.

Finding modes with equality comparisons

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 2017, Theor. Comput. Sci..

Encoding Range Minimum Queries pdf

Rajeev Raman, Gonzalo Navarro, S. Srinivasa Rao, 2013, ArXiv.

On the Size of Succinct Indices

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2007, ESA.

Enumerating Range Modes pdf

S. Srinivasa Rao, Kunihiko Sadakane, Sankardeep Chakraborty, 2020, ISAAC.

Space Efficient Suffix Trees

S. Srinivasa Rao, J. Ian Munro, Venkatesh Raman, 1998, J. Algorithms.

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems pdf

S. Srinivasa Rao, Seungbum Jo, Sankardeep Chakraborty, 2017, ArXiv.

On Succinct Representations of Binary Trees

Rajeev Raman, S. Srinivasa Rao, Pooya Davoodi, 2017, Math. Comput. Sci..

Optimal Indexes for Sparse Bit Vectors

Rajeev Raman, S. Srinivasa Rao, Alexander Golynski, 2013, Algorithmica.

Integer Representations towards Efficient Counting in the Bit Probe Model

S. Srinivasa Rao, Gerth Stølting Brodal, Vineet Pandey, 2011, TAMC.

Succinct Representation of Data Structures

S. Srinivasa Rao, J. Ian Munro, J. I. Munro, 2018, Handbook of Data Structures and Applications.

Encoding 2D Range Maximum Queries

Rajeev Raman, John Iacono, S. Srinivasa Rao, 2011, ISAAC.

Integer representations towards efficient counting in the bit probe model

S. Srinivasa Rao, Gerth Stølting Brodal, Vineet Pandey, 2014, J. Discrete Algorithms.

Secondary indexing in one dimension: beyond b-trees and bitmap indexes

S. Srinivasa Rao, Rasmus Pagh, 2009, PODS.

Frameworks for Designing In-place Graph Algorithms pdf

S. Srinivasa Rao, Venkatesh Raman, Sankardeep Chakraborty, 2017, J. Comput. Syst. Sci..

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem

Rajeev Raman, S. Srinivasa Rao, Seungbum Jo, 2015, WALCOM.

Succinct Dynamic Cardinal Trees

S. Srinivasa Rao, Diego Arroyuelo, Pooya Davoodi, 2016, Algorithmica.

A Framework for In-place Graph Algorithms

S. Srinivasa Rao, Venkatesh Raman, Sankardeep Chakraborty, 2018, ESA.

Succinct Ordinal Trees Based on Tree Covering

S. Srinivasa Rao, J. Ian Munro, Meng He, 2007, ICALP.

Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries

S. Srinivasa Rao, Seungbum Jo, 2015, COCOON.

SJSON: A succinct representation for JavaScript object notation documents

S. Srinivasa Rao, Junhee Lee, Edman Anjos, 2016, 2016 Eleventh International Conference on Digital Information Management (ICDIM).

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments

S. Srinivasa Rao, Arindam Biswas, Venkatesh Raman, 2017, FAW.

An optimal Bloom filter replacement

S. Srinivasa Rao, Anna Pagh, Rasmus Pagh, 2005, SODA '05.

Space Efficient Algorithms for Breadth-Depth Search

S. Srinivasa Rao, Sankardeep Chakraborty, Anish Mukherjee, 2019, FCT.

Succinct indexes for strings, binary relations and multilabeled trees

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2011, TALG.

Simultaneous encodings for range and next/previous larger/smaller value queries pdf

S. Srinivasa Rao, Seungbum Jo, 2016, Theor. Comput. Sci..

Competitive Online Selection in Main and External Memory pdf

S. Srinivasa Rao, Jérémy Barbay, Ankur Gupta, 2012, arXiv.org.

Optimal In-place Algorithms for Basic Graph Problems

S. Srinivasa Rao, Kunihiko Sadakane, Sankardeep Chakraborty, 2019, IWOCA.

Representing Trees of Higher Degree

Rajeev Raman, Erik D. Demaine, S. Srinivasa Rao, 2005, Algorithmica.

Performance of Optimal Feedback Controller for Unified Power Quality Conditioner

S. Srinivasa Rao, P. Snigdha Tejaswi, 2015 .

Succinct Representations of Ordinal Trees

Rajeev Raman, S. Srinivasa Rao, 2013, Space-Efficient Data Structures, Streams, and Algorithms.

Finding Mode Using Equality Comparisons

S. Srinivasa Rao, Venkatesh Raman, Varunkumar Jayapaul, 2016, WALCOM.

Approximate Query Processing over Static Sets and Sliding Windows pdf

S. Srinivasa Rao, Seungbum Jo, Ran Ben-Basat, 2018, ISAAC.

Asymptotically Optimal Encodings for Range Selection

Rajeev Raman, Gonzalo Navarro, S. Srinivasa Rao, 2014, FSTTCS.

Biconnectivity, st-numbering and other applications of DFS using O(n) bits

S. Srinivasa Rao, Venkatesh Raman, Sankardeep Chakraborty, 2016, J. Comput. Syst. Sci..

Succinct indexes for strings, binary relations and multi-labeled trees

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2007, SODA '07.

Succinct Dynamic Dictionaries and Trees

Rajeev Raman, S. Srinivasa Rao, R. Raman, 2003, ICALP.

Space Efficient Data Structures for Nearest Larger Neighbor

S. Srinivasa Rao, Venkatesh Raman, Varunkumar Jayapaul, 2014, IWOCA.

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2002, SODA '02.

Synergistic Sorting and Deferred Data Structures on MultiSets pdf

S. Srinivasa Rao, Jérémy Barbay, Carlos Ochoa, 2016, ArXiv.

Space Efficient Suffix Trees

S. Srinivasa Rao, Venkatesh Raman, J. Ian Munro, 1998, FSTTCS.

Dynamic Compressed Strings with Random Access

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2013, ICALP.

Succinct Navigational Oracles for Families of Intersection Graphs on a Circle pdf

S. Srinivasa Rao, Hüseyin Acan, Sankardeep Chakraborty, 2020, ArXiv.

A categorization theorem on suffix arrays with applications to space efficient text indexes

S. Srinivasa Rao, J. Ian Munro, Meng He, 2005, SODA '05.

Universal Succinct Representations of Trees?

Rajeev Raman, S. Srinivasa Rao, Arash Farzan, 2009, ICALP.

Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet

S. Srinivasa Rao, Pooya Davoodi, P. Davoodi, 2011, TAMC.

Random Access to Grammar-Compressed Strings and Trees

Gad M. Landau, Philip Bille, Rajeev Raman, 2015, SIAM J. Comput..

Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits pdf

S. Srinivasa Rao, Venkatesh Raman, Sankardeep Chakraborty, 2016, ISAAC.

Near-optimal online multiselection in internal and external memory

S. Srinivasa Rao, Jérémy Barbay, Ankur Gupta, 2016, J. Discrete Algorithms.

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro, 2006, CPM.

Succinct Representations of Functions

S. Srinivasa Rao, J. Ian Munro, J. Munro, 2004, ICALP.

Computer Vision for Brain Tissue Segmentation

S. Srinivasa Rao, Chinmay Chakraborty, M. Sucharitha, 2020 .

Minimum Transactions Problem

S. Srinivasa Rao, Varunkumar Jayapaul, Niranka Banerjee, 2018, COCOON.

Encoding two-dimensional range top-k queries revisited

S. Srinivasa Rao, Seungbum Jo, 2018, ISAAC.

Time-space trade-offs for compressed suffix arrays

S. Srinivasa Rao, 2002, Inf. Process. Lett..

Early Detection of Dementia Disease Using Data Mining Techniques

S. Srinivasa Rao, Chinmay Chakraborty, V. S. K. Reddy, 2021 .

Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)

Stefan Kratsch, S. Srinivasa Rao, Jérémy Barbay, 2018, Dagstuhl Reports.