Recurrence relations on heaps
From MaRDI portal
Publication:1913701
DOI10.1007/BF01955045zbMath0846.68049MaRDI QIDQ1913701
Publication date: 27 May 1996
Published in: Algorithmica (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case results on heapsort
- Bounds for min-max heaps
- A variant of heapsort with almost optimal number of comparisons
- On the random construction of heaps
- A note on the construction of the data structure ``deap
- The Analysis of Heapsort
- Average case analysis of heap building by repeated insertion
- An average case analysis of Floyd's algorithm to construct heaps
- Repeated random insertion into a priority queue
- Heaps on Heaps
- Min-max heaps and generalized priority queues
- A data structure for manipulating priority queues
- Building heaps fast
This page was built for publication: Recurrence relations on heaps
