• 1 Introduction
    • 1.1 Previous Work
  • 2 Partition-based Heap Framework
  • 3 Lazy Partition Heaps
    • 3.1 Operations
    • 3.2 Potential
    • 3.3 Amortized Cost of Insert
    • 3.4 Amortized Cost of Decrease-Key
    • 3.5 Amortized Cost of Delete-Min
    • 3.6 Extensions
  • 4 Fibonacci Heaps: The Next Generation
    • 4.1 Split-up
    • 4.2 Merge-down
    • 4.3 Overflow-down
    • 4.4 Overflow-thru
    • 4.5 Underflow-up
    • 4.6 Underflow-thru
    • 4.7 Insert
    • 4.8 Delete-Min
    • 4.9 Decrease-Key
  • 5 Heaps with Exponential Upper Bounded Sets
    • 5.1 Analysis
  • 6 Conclusion
  • References
  • Appendix
    • A LP Heap Proof-of-Concept Implementation