Introduces the first cache-friendly indexing strategy for Wheeler DFAs that combines binary search and sequential scans, achieving up to 500x speedup on pangenome graphs at up to 15x space cost.
Space-efficient static trees and graphs
3 Pith papers cite this work, alongside 649 external citations. Polarity classification is still indexing.
3
Pith papers citing it
649
external citations · external index
years
2026 3representative citing papers
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.
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 Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs
Introduces the first cache-friendly indexing strategy for Wheeler DFAs that combines binary search and sequential scans, achieving up to 500x speedup on pangenome graphs at up to 15x space cost.
-
Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.
-
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.