
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
We consider the problem of designing succinct navigational oracles, i.e....
read it

Enumerating Range Modes
We consider the range mode problem where given a sequence and a query ra...
read it

Optimal Inplace Algorithms for Basic Graph Problems
We present linear time inplace algorithms for several basic and fundam...
read it

Succinct Representation for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical...
read it

Space Efficient Algorithms for BreadthDepth Search
Continuing the recent trend, in this article we design several spaceeff...
read it

Succinct Data Structures for Families of Interval Graphs
We consider the problem of designing succinct data structures for interv...
read it

Encoding twodimensional range topk queries revisited
We consider the problem of encoding twodimensional arrays, whose elemen...
read it

Approximate Query Processing over Static Sets and Sliding Windows
Indexing of static and dynamic sets is fundamental to a large set of app...
read it

Improved Spaceefficient Linear Time Algorithms for Some Classical Graph Problems
This short note provides spaceefficient linear time algorithms for comp...
read it

Frameworks for Designing Inplace Graph Algorithms
Readonly memory model is a classical model of computation to study time...
read it
Srinivasa Rao Satti
is this you? claim profile