scientific article; zbMATH DE number 742986

MaRDI QIDQ4763425zbMATH OpenFDO

Authors Svante Carlsson, Jingsen Chen

Publication date 11 April 1995

zbMATH Keywords

complexity of heapssearch algorithmsearch problem

Mathematics Subject Classification ID

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

Recommendations

• Heaps on Heaps
• Heap construction: Optimal in both worst and average cases?
• Algorithms and Data Structures
• Building heaps fast
• Elementary yet precise worst-case analysis of Floyd's heap-construction program

Cited in

(18)

• On the complexity of building an interval heap
• Multicriteria heuristic search.
• Comparator networks for binary heap construction
• The bounds of min-max pair heap construction
• Recurrence relations on heaps
• A survey on priority queues
• Elementary yet precise worst-case analysis of Floyd's heap-construction program
• Heaps on Heaps
• scientific article; zbMATH DE number 4046029 (Why is no real title available?)
• Explaining binomial heaps
• scientific article; zbMATH DE number 1956556 (Why is no real title available?)
• Comparator networks for binary heap construction
• Heap construction in the parallel comparison tree model
• scientific article; zbMATH DE number 7149819 (Why is no real title available?)
• Algorithms and Data Structures
• Refined complexity analysis for heap operations
• A nearly optimal randomized algorithm for explorable heap selection
• Heap construction: Optimal in both worst and average cases?

This page was built for publication:

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