Compressed Prefix Sums

DOI10.1007/978-3-540-69507-3_19zbMath1132.68022OpenAlexW1591595764MaRDI QIDQ5448775

Rajeev Raman, Naila Rahman, O'Neil Delpratt

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_19

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (3)

Range selection and predecessor queries in data aware space and time ⋮ Space-efficient B trees via load-balancing ⋮ Fast relative Lempel-Ziv self-index for similar sequences

This page was built for publication: Compressed Prefix Sums