SimdQuickHeap is a SIMD-optimized QuickHeap variant that achieves O(log n) expected time per operation with practical speedups up to 2x over binary heaps and radix heaps.
4 Lars Arge, Michael A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
SimdQuickHeap: The QuickHeap Reconsidered
SimdQuickHeap is a SIMD-optimized QuickHeap variant that achieves O(log n) expected time per operation with practical speedups up to 2x over binary heaps and radix heaps.