A refined segments decomposition yields two space-time tradeoffs for k iterative φ queries on the PBWT, improving on prior O((r̃ + h) log n) space and O(k log log m) time.
Practical Entropy-Compressed Rank/Select Dictionary
2 Pith papers cite this work, alongside 277 external citations. Polarity classification is still indexing.
2
Pith papers citing it
277
external citations · OpenAlex
fields
cs.DS 2years
2026 2representative citing papers
Empirical study of BlockBitVec, FastBitVec, and RRRBitVec on ARM64 shows 1.4x rank speedup via asymmetric blocks and 4.9x select speedup via superblock sampling, with 7.8% overhead and public code.
citing papers explorer
-
Faster Iterative $\phi$ Queries on the Positional BWT
A refined segments decomposition yields two space-time tradeoffs for k iterative φ queries on the PBWT, improving on prior O((r̃ + h) log n) space and O(k log log m) time.
-
Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
Empirical study of BlockBitVec, FastBitVec, and RRRBitVec on ARM64 shows 1.4x rank speedup via asymmetric blocks and 4.9x select speedup via superblock sampling, with 7.8% overhead and public code.