Two-tier relaxed heaps

DOI10.1007/S00236-008-0070-7MaRDI QIDQ929299zbMATH OpenOpenAlexFDO

Authors Amr Elmasry, Claus Jensen, Jyrki Katajainen

Publication date 17 June 2008

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-008-0070-7

zbMATH Keywords

heap operations

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Two-Tier Relaxed Heaps
• Heaps on Heaps
• RELAXED INORDER HEAPS
• Bipartite binomial heaps
• The weak-heap data structure: variants and applications

Cites work

• scientific article; zbMATH DE number 871899 (Why is no real title available?)
• A data structure for manipulating priority queues
• Algorithm design: Foundations, analysis, and Internet examples
• Heaps on Heaps
• Introduction to algorithms
• Meldable heaps and boolean union-find
• On the efficiency of pairing heaps and related data structures
• Optimal purely functional priority queues
• Purely Functional Data Structures
• The pairing heap: A new form of self-adjusting heap
• Two new methods for constructing double-ended priority queues from priority queues
• Two-Tier Relaxed Heaps
• Worst-case optimal insertion and deletion methods for decomposable searching problems

Cited in

(11)

• Two skew-binary numeral systems and one application
• Two new methods for constructing double-ended priority queues from priority queues
• Refined complexity analysis for heap operations
• The weak-heap data structure: variants and applications
• Regular numeral systems for data structures
• The violation heap: a relaxed Fibonacci-like heap
• RELAXED INORDER HEAPS
• Bipartite binomial heaps
• Worst-case optimal priority queues via extended regular counters
• Two-Tier Relaxed Heaps
• A survey on priority queues

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: Two-tier relaxed heaps

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