Almost all heap working-set bounds are amortized-equivalent; a new recursive construction achieves the stronger stack-like bound with O(1) decrease-key and o(log* n) insert.
Fast and Simple Sorting Using Partial Information
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Heaps and Their Working Sets
Almost all heap working-set bounds are amortized-equivalent; a new recursive construction achieves the stronger stack-like bound with O(1) decrease-key and o(log* n) insert.