Srinivasa Rao Satti

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

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · Symposium on Discrete Algorithms · 2002 · 397 citations

Computational Complexity Theory, Engineering, Computational Complexity +20

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

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · ACM Transactions on Algorithms · 2007 · 372 citations · Full text

Engineering, Computational Complexity, Data Structure +17

Representing Trees of Higher Degree

David Benoit, Erik D. Demaine, J. Ian Munro et al. · Algorithmica · 2005 · 232 citations · Full text

Tree Language, Higher Degree, Graph Theory +5

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

Alexander Golynski, J. Ian Munro, Srinivasa Rao Satti · Symposium on Discrete Algorithms · 2006 · 188 citations

Engineering, Big Data Indexing, Rank/select Operations +18

An optimal Bloom filter replacement

Anna Pagh, Rasmus Pagh, Srinivasa Rao Satti · Symposium on Discrete Algorithms · 2005 · 150 citations

Cluster Computing, Engineering, Approximation S +16