PivCo-Huffman adapts wavelet tree pivots to Huffman coding for SIMD-accelerated operations and optionally mixes in ANS on skewed nodes.
The FastLanes Compression Layout: Decoding >100 Billion Integers per Second with Scalar Code,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.
citing papers explorer
-
PivCo-Huffman
PivCo-Huffman adapts wavelet tree pivots to Huffman coding for SIMD-accelerated operations and optionally mixes in ANS on skewed nodes.
-
The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.