Succinct Partial Sums and Fenwick Trees.

Philip Bille|Anders Roy Christiansen|Nicola Prezza|Frederik Rye Skjoldjensen


Anthology ID:DBLP:conf/spire/BilleCPS17
Volume:String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings
Year:2017
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:91-96
URL:https://doi.org/10.1007/978-3-319-67428-5_8
DOI:https://doi.org/10.1007/978-3-319-67428-5_8
DBLP:conf/spire/BilleCPS17
BibTeX:
@inproceedings{bille-2017-succinct, author = {Philip Bille and Anders Roy Christiansen and Nicola Prezza and Frederik Rye Skjoldjensen}, editor = {Gabriele Fici and Marinella Sciortino and Rossano Venturini}, title = {{Succinct Partial Sums and Fenwick Trees}}, booktitle = {{String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {10508}, pages = {91--96}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-67428-5_8}, doi = {https://doi.org/10.1007/978-3-319-67428-5_8} }