Parameterized self-adjusting heaps

DOI10.1016/J.JALGOR.2004.03.002MaRDI QIDQ4815767zbMATH OpenOpenAlexFDO

Authors Amr Elmasry

Publication date 8 September 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.03.002

zbMATH Keywords

deletemin operation

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Toward optimal self-adjusting heaps
• Self-Adjusting Heaps
• The pairing heap: A new form of self-adjusting heap
• Smooth heaps and a dual view of self-adjusting data structures
• Smooth heaps and a dual view of self-adjusting data structures
• Adaptive Heapsort
• Optimal parallel construction of heaps
• scientific article; zbMATH DE number 4147479
• Two constant-factor-optimal realizations of adaptive heapsort
• A characterization of heaps and its applications

Cited in

(3)

• Toward optimal self-adjusting heaps
• Self-Adjusting Heaps
• A survey on priority queues

This page was built for publication: Parameterized self-adjusting heaps

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