Strict Fibonacci heaps

DOI10.1145/3707692MaRDI QIDQ6955686zbMATH OpenFDO

Authors Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan

Publication date 22 July 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3707692

zbMATH Keywords

data structuresdecrease-keyheapsmeldworst-case complexity

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• A data structure for manipulating priority queues
• A nearly-tight analysis of multipass pairing heaps
• A survey on priority queues
• A tight analysis of slim heaps and smooth heaps
• Algorithm Theory - SWAT 2004
• Efficiency of self-adjusting heaps
• Fast meldable priority queues
• Fibonacci heaps and their uses in improved network optimization algorithms
• Hollow heaps
• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 871899 (Why is no real title available?)
• Improved bounds for multipass pairing heaps and path-balanced binary search trees
• Meldable heaps and boolean union-find
• On the efficiency of pairing heaps and related data structures
• Pairing heaps with O( n) decrease cost
• Pairing heaps: the forward variant
• Parameterized self-adjusting heaps
• Quake heaps: a simple alternative to Fibonacci heaps
• Rank-pairing heaps
• Replacing mark bits with randomness in Fibonacci heaps
• Self-Adjusting Heaps
• Smooth heaps and a dual view of self-adjusting data structures
• Strict Fibonacci heaps
• The pairing heap: A new form of self-adjusting heap
• The violation heap: a relaxed Fibonacci-like heap
• Thin heaps, thick heaps
• Toward optimal self-adjusting heaps
• Two-tier relaxed heaps

Cited in

(1)

• Recent algorithmic advances in simple temporal networks with uncertainty: from faster controllability checking to faster execution

This page was built for publication: Strict Fibonacci heaps

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