Succinct Partial Sums and Fenwick Trees

Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen. Succinct Partial Sums and Fenwick Trees. In Gabriele Fici, Marinella Sciortino, Rossano Venturini, editors, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. Volume 10508 of Lecture Notes in Computer Science, pages 91-96, Springer, 2017. [doi]

@inproceedings{BilleCPS17,
  title = {Succinct Partial Sums and Fenwick Trees},
  author = {Philip Bille and Anders Roy Christiansen and Nicola Prezza and Frederik Rye Skjoldjensen},
  year = {2017},
  doi = {10.1007/978-3-319-67428-5_8},
  url = {https://doi.org/10.1007/978-3-319-67428-5_8},
  researchr = {https://researchr.org/publication/BilleCPS17},
  cites = {0},
  citedby = {0},
  pages = {91-96},
  booktitle = {String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
  editor = {Gabriele Fici and Marinella Sciortino and Rossano Venturini},
  volume = {10508},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-67428-5},
}