S. Srinivasa Rao

According to our database1, S. Srinivasa Rao authored at least 98 papers between 1998 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
SJSON: A succinct representation for JSON documents.
Inf. Syst., 2021

Succinct Encodings for Families of Interval Graphs.
Algorithmica, 2021

Succinct Representations for (Non)Deterministic Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2021

2020
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle.
CoRR, 2020

Optimal In-place Algorithms for Basic Graph Problems.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Enumerating Range Modes.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS.
J. Comb. Optim., 2019

Succinct Representation for (Non)Deterministic Finite Automata.
CoRR, 2019

Succinct Data Structures for Families of Interval Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Space Efficient Algorithms for Breadth-Depth Search.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Space Efficient Linear Time Algorithms for BFS, DFS and Applications.
Theory Comput. Syst., 2018

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

Encoding Two-Dimensional Range Top-k Queries Revisited.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Approximate Query Processing over Static Sets and Sliding Windows.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

A Framework for In-place Graph Algorithms.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.
Proceedings of the Computer Science - Theory and Applications, 2018

Minimum Transactions Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Finding modes with equality comparisons.
Theor. Comput. Sci., 2017

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-<i>k</i> Queries.
ACM Trans. Algorithms, 2017

On Succinct Representations of Binary Trees.
Math. Comput. Sci., 2017

Biconnectivity, st-numbering and other applications of DFS using O(n) bits.
J. Comput. Syst. Sci., 2017

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems.
CoRR, 2017

Frameworks for Designing In-place Graph Algorithms.
CoRR, 2017

Compressed Bit vectors Based on Variable-to-Fixed Encodings.
Comput. J., 2017

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Synergistic Solutions on MultiSets.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Compressing and Indexing Structured Text.
Encyclopedia of Algorithms, 2016

Simultaneous encodings for range and next/previous larger/smaller value queries.
Theor. Comput. Sci., 2016

Encoding 2D range maximum queries.
Theor. Comput. Sci., 2016

Two dimensional range minimum queries and Fibonacci lattices.
Theor. Comput. Sci., 2016

Space efficient data structures for nearest larger neighbor.
J. Discrete Algorithms, 2016

Near-optimal online multiselection in internal and external memory.
J. Discrete Algorithms, 2016

SBH: Super byte-aligned hybrid bitmap compression.
Inf. Syst., 2016

Synergistic Sorting and Deferred Data Structures on MultiSets.
CoRR, 2016

Succinct Dynamic Cardinal Trees.
Algorithmica, 2016

Finding Mode Using Equality Comparisons.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

SJSON: A succinct representation for JavaScript object notation documents.
Proceedings of the Eleventh International Conference on Digital Information Management, 2016

Encoding Two-Dimensional Range Top-k Queries.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Random Access to Grammar-Compressed Strings and Trees.
SIAM J. Comput., 2015

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Dynamic Online Multiselection in Internal and External Memory.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Sorting and Selection with Equality Comparisons.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Set and array based hybrid data structure solution for Frequent Pattern Mining.
Proceedings of the Tenth International Conference on Digital Information Management, 2015

2014
Selection from read-only memory with limited workspace.
Theor. Comput. Sci., 2014

Integer representations towards efficient counting in the bit probe model.
J. Discrete Algorithms, 2014

Optimal Indexes for Sparse Bit Vectors.
Algorithmica, 2014

Space Efficient Data Structures for Nearest Larger Neighbor.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Asymptotically Optimal Encodings for Range Selection.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Encoding Range Minimum Queries.
CoRR, 2013

Dynamic Compressed Strings with Random Access.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Encodings for Range Selection and Top-k Queries.
Proceedings of the Algorithms - ESA 2013, 2013

Theory and Implementation of Online Multiselection Algorithms.
Proceedings of the Algorithms - ESA 2013, 2013

Succinct Representations of Ordinal Trees.
Proceedings of the Space-Efficient Data Structures, 2013

A Survey of Data Structures in the Bitprobe Model.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Succinct representations of permutations and functions.
Theor. Comput. Sci., 2012

Succinct ordinal trees based on tree covering.
ACM Trans. Algorithms, 2012

Competitive Online Selection in Main and External Memory
CoRR, 2012

On Space Efficient Two Dimensional Range Minimum Data Structures.
Algorithmica, 2012

External Memory Planar Point Location with Logarithmic Updates.
Algorithmica, 2012

Succinct Representations of Binary Trees for Range Minimum Queries.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Succinct indexes for strings, binary relations and multilabeled trees.
ACM Trans. Algorithms, 2011

Encoding 2-D Range Maximum Queries
CoRR, 2011

Path Minima Queries in Dynamic Weighted Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet.
Proceedings of the Theory and Applications of Models of Computation, 2011

Random Access to grammar-Compressed Strings.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Encoding 2D Range Maximum Queries.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
A compact data structure for representing a dynamic multiset.
Inf. Process. Lett., 2010

2009
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Secondary indexing in one dimension: beyond b-trees and bitmap indexes.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Universal Succinct Representations of Trees?
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Tree Compression and Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the Redundancy of Succinct Data Structures.
Proceedings of the Algorithm Theory, 2008

Compressing Binary Decision Diagrams.
Proceedings of the ECAI 2008, 2008

2007
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci., 2007

Succinct indexable dictionaries with applications to encoding <i>k</i>-ary trees, prefix sums and multisets.
ACM Trans. Algorithms, 2007

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
CoRR, 2007

Succinct indexes for strings, binary relations and multi-labeled trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the Size of Succinct Indices.
Proceedings of the Algorithms, 2007

2006
Rank/select operations on large alphabets: a tool for text indexing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Representing Trees of Higher Degree.
Algorithmica, 2005

An optimal Bloom filter replacement.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

A categorization theorem on suffix arrays with applications to space efficient text indexes.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Succinct Representation of Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Longest increasing subsequences in sliding windows.
Theor. Comput. Sci., 2004

Succinct Representations of Functions.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Computing Refined Buneman Trees in Cubic Time.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Succinct Dynamic Dictionaries and Trees.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Succinct Representations of Permutations.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Time-space trade-offs for compressed suffix arrays.
Inf. Process. Lett., 2002

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Full-Text Indexes in External Memory.
Proceedings of the Algorithms for Memory Hierarchies, 2002

2001
Space Efficient Suffix Trees.
J. Algorithms, 2001

Succinct Dynamic Data Structures.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Explicit Deterministic Constructions for Membership in the Bitprobe Model.
Proceedings of the Algorithms, 2001

1999
Static Dictionaries Supporting Rank.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
A Simplified NP-Complete MAXSAT Problem.
Inf. Process. Lett., 1998


  Loading...