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

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti. Succinct indexable dictionaries with applications to encoding ::::k::::-ary trees, prefix sums and multisets. ACM Transactions on Algorithms, 3(4):43, 2007. [doi]

@article{RamanRS07,
  title = {Succinct indexable dictionaries with applications to encoding ::::k::::-ary trees, prefix sums and multisets},
  author = {Rajeev Raman and Venkatesh Raman and Srinivasa Rao Satti},
  year = {2007},
  doi = {10.1145/1290672.1290680},
  url = {http://doi.acm.org/10.1145/1290672.1290680},
  researchr = {https://researchr.org/publication/RamanRS07},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {3},
  number = {4},
  pages = {43},
}