QuickHeap: the fastest priority queue
Table of Contents 1 Background Priority queue Binary heap D-ary heaps Other heaps 2 Literature on Quickheaps Optimal incremental sorting Quickheap Randomized quickheaps 3 Bucket-based implementation Data structure Push Pop Partition 4 Results Libraries Datasets Results 5 Conclusion Backlinks: bsky, X, hacker news, lobste.rs
A preprint on the SimdQuickHeap (github:RagnarGrootKoerkamp/QuickHeap) with the latest results can now be found on arXiv (DOI, PDF):