Adaptive Fibonacci and Pairing Heaps

2020/03/09 by Andrew Frohmader, Frohmader, Andrew
Computer Science · #Algorithms and Data Compression #Network Packet Processing and Optimization #Parallel Computing and Optimization Techniques #cs.DS

paper · pdf · doi:10.48550/arxiv.2003.03959

6 pages

arxiv created 2020/03/09 · arxiv updated 2020/03/10

Abstract

This brief note presents two adaptive heap data structures and conjectures on running times.

Related

• Improved Upper Bounds for Pairing Heaps
• Rank-Pairing Heaps
• Strict fibonacci heaps
• Fibonacci Heaps Revisited
• Padovan heaps