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

@article{Raman2007SuccinctID,
  title={Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets},
  author={R. Raman and V. Raman and S. S. Rao},
  journal={ACM Transactions on Algorithms (TALG)},
  year={2007},
  volume={3},
  pages={43 - es}
}
  • R. Raman, V. Raman, S. S. Rao
  • Published 2007
  • Computer Science, Mathematics
  • ACM Transactions on Algorithms (TALG)
  • We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and select(i), which returns the ith smallest element in S. We give a data structure that supports both operations in O(1) time on the RAM model and requires B(n, m) + o(n) + O(lg lg m) bits to store a set of size n, where B(n, m) = ⌊lg (m/n)⌋ is the… CONTINUE READING

    Figures and Topics from this paper.

    Linear Time Succinct Indexable Dictionary Construction with Applications
    • 5
    • PDF
    Universal Succinct Representations of Trees?
    • 31
    • PDF
    Succinct sampling from discrete distributions
    • 16
    • PDF
    Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet
    • 5
    • PDF
    Nearly optimal static Las Vegas succinct dictionary
    • H. Yu
    • Computer Science, Mathematics
    • 2020
    • 1
    • PDF
    Succinct Indices for Path Minimum, with Applications
    • 5
    Encoding range minima and range top-2 queries
    • 15
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME
    • 119
    • Highly Influential
    • PDF
    Efficient Storage and Retrieval by Content and Address of Static Files
    • 177
    • Highly Influential
    Membership in Constant Time and Almost-Minimum Space
    • 137
    • Highly Influential
    • PDF
    Should tables be sorted?
    • 351
    • Highly Influential
    • PDF
    Compact pat trees
    • 331
    • Highly Influential
    Indexing Compressed Text
    • 243
    • Highly Influential