Refined complexity analysis for heap operations

DOI10.1016/0022-0000(87)90016-XzbMath0624.68043OpenAlexW2011579772MaRDI QIDQ578912

Thomas H. Spencer, Michael L. Fredman

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90016-x

zbMATH Keywords

priority queueheapdata structurefrequency of findmin operationsinherent complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers ⋮ On computing an optimal permutation of ranks for multiselection ⋮ Stacks, queues, and deques with order-statistic operations

Cites Work

• Time bounds for selection
• Finding Minimum Spanning Trees
• A data structure for manipulating priority queues
• Unnamed Item
• Unnamed Item

This page was built for publication: Refined complexity analysis for heap operations