Optimal algorithms for inserting a random element into a random heap

DOI10.1109/18.556140MaRDI QIDQ4340357zbMATH OpenOpenAlexFDO

Authors Hsien-Kuei Hwang

Publication date 10 June 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a84e516fd0811e9a443d841521060f15d9872147

zbMATH Keywords

heapHuffman coding schemeoptimal algorithms

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Repeated random insertion into a priority queue
• Heaps on Heaps
• Building heaps fast
• Heap construction: Optimal in both worst and average cases?
• Optimal heapsort algorithm

Cited in

(2)

• Repeated random insertion into a priority queue
• Heap construction: Optimal in both worst and average cases?

This page was built for publication: Optimal algorithms for inserting a random element into a random heap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340357)