Succinct Partial Sums and Fenwick Trees

DOI10.1007/978-3-319-67428-5_8zbMath1454.68027arXiv1705.10987OpenAlexW2620825641MaRDI QIDQ5150921

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

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.10987

zbMATH Keywords

parallelizationpartial sumssuccinct data structuresFenwick treesuccinct space

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

Random access in persistent strings and segment selection ⋮ Unnamed Item ⋮ Partial sums on the ultra-wide word RAM ⋮ Faster online computation of the succinct longest previous factor array

Cites Work

• Unnamed Item
• Unnamed Item
• Succinct data structures for searchable partial sums with optimal worst-case performance
• On the Complexity of Maintaining Partial Sums
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Logarithmic Lower Bounds in the Cell-Probe Model

This page was built for publication: Succinct Partial Sums and Fenwick Trees