On the random construction of heaps

DOI10.1016/0020-0190(88)90101-9zbMath0654.68026OpenAlexW1984625335WikidataQ57401618 ScholiaQ57401618MaRDI QIDQ1108784

Alan M. Frieze

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90101-9

zbMATH Keywords

upper boundbinary heapd-heaps

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Algorithms in computer science (68W99)

Related Items (4)

Recurrence relations on heaps ⋮ A note on constructing min-max heaps ⋮ Best case lower bounds for heapsort ⋮ Heap construction: Optimal in both worst and average cases?

Cites Work

• Repeated random insertion into a priority queue
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item

This page was built for publication: On the random construction of heaps