Abstract: The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater/smaller than a given value. This problem has interesting applications, like the intersection of inverted lists.
Mar 20, 2020 · The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater or smaller than a given value.
Bitvectors with Runs and the Successor/Predecessor Problem
www.semanticscholar.org › paper › Bitve...
A novel compact data structure for bitvectors with k runs that achieves access, rank, and successor/predecessor in O(1) time by consuming space O(sqrt(kn)) ...
The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater/smaller than a given value.
Bitvectors with Runs and the Successor/Predecessor Problem
www.researchgate.net › publication › 34...
The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater/smaller than a given value. This problem has ...
Bitvectors with runs and the successor/predecessor problem ; ISSN · 1068-0314 ; ISBN · 9781728164571 ; Year of publication · 2020 ; Volume · 2020-March ; Pages · 133-142.
The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater or smaller than a given value. This problem has ...
Bibliographic details on Bitvectors with Runs and the Successor/Predecessor Problem.
In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds ...
2023. Bitvectors with runs and the successor/predecessor problem. A Gómez-Brandón. 2020 Data Compression Conference (DCC), 133-142, 2020. 4, 2020. The Ring: ...