scientific article

zbMath0485.68036MaRDI QIDQ3945583

J. Ian Munro, Gaston H. Gonnet

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (5)

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

This page was built for publication: