scientific article; zbMATH DE number 3763287

zbMATH Open0485.68036MaRDI QIDQ3945583FDOQ3945583

Authors: Gaston H. Gonnet, J. Ian Munro 

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexity of comparison based problemsperforming the basic priority queue operations on a heap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (5)

• Average-case results on heapsort
• A variant of heapsort with almost optimal number of comparisons
• Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
• Bounds for min-max heaps
• QuickHeapsort, an efficient mix of classical sorting algorithms

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 Q3945583)