Two-tier relaxed heaps

DOI10.1007/s00236-008-0070-7zbMath1144.68015MaRDI QIDQ929299

Jyrki Katajainen, Amr Elmasry, Claus Jensen

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

68P05: Data structures

Related Items

Bipartite binomial heaps, Two skew-binary numeral systems and one application, Two new methods for constructing double-ended priority queues from priority queues, The weak-heap data structure: variants and applications, Regular numeral systems for data structures, A Survey on Priority Queues, Worst-Case Optimal Priority Queues via Extended Regular Counters, THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP

Uses Software

• heapsort

Cites Work

• Two new methods for constructing double-ended priority queues from priority queues
• The pairing heap: A new form of self-adjusting heap
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• On the efficiency of pairing heaps and related data structures
• Meldable heaps and boolean union-find
• Heaps on Heaps
• A data structure for manipulating priority queues
• Optimal purely functional priority queues
• Purely Functional Data Structures
• Two-Tier Relaxed Heaps
• Unnamed Item
• Unnamed Item
• Unnamed Item