Two constant-factor-optimal realizations of adaptive heapsort

DOI10.1007/978-3-642-25011-8_16MaRDI QIDQ3111651zbMATH OpenOpenAlexFDO

Authors Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_16

zbMATH Keywords

adaptive heapsortadaptive sortingconstant-factor optimalitypriority queuesweak heapsweak queues

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• The weak-heap data structure: variants and applications
• Multipartite priority queues
• Algorithms and Computation
• scientific article; zbMATH DE number 2086621
• Weak heaps engineered

Cited in

(5)

• A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
• scientific article; zbMATH DE number 2086621 (Why is no real title available?)
• Parameterized self-adjusting heaps
• Multipartite priority queues
• Algorithms and Computation

This page was built for publication: Two constant-factor-optimal realizations of adaptive heapsort

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