Two-tier relaxed heaps

DOI10.1007/s00236-008-0070-7zbMath1144.68015OpenAlexW1996864203MaRDI 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

Data structures (68P05)

Related Items (8)

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

Uses Software

• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

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