STRONGER QUICKHEAPS
From MaRDI portal
Publication:3016226
DOI10.1142/S0129054111008507zbMath1221.68074MaRDI QIDQ3016226
Rodrigo Paredes, Peter Sanders, Patricio V. Poblete, Gonzalo Navarro
Publication date: 14 July 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- On sorting, heaps, and minimum spanning trees
- The pairing heap: A new form of self-adjusting heap
- Time bounds for selection
- Randomized binary search trees
- Design and implementation of an efficient priority queue
- A data structure for manipulating priority queues
- General Balanced Trees
- Self-Adjusting Heaps
- Introspective sorting and selection revisited
This page was built for publication: STRONGER QUICKHEAPS
