### Abstract

We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the deleteMin-operation is logarithmic. This is achieved by using skew links to avoid cascading linking on insert-operations, and data-structural bootstrapping to get constant-time findMin and meld operations. Our implementation follows the paper by Brodal and Okasaki.

### License

BSD License

### Topics

- Computer science/Data structures

### Related publications

- Binomial Heaps in Functional Algorithms, Verified!
- Wikipedia

### Session Binomial-Heaps

- BinomialHeap
- SkewBinomialHeap
- Test

### Used by

- Collections Framework
- Jinja with Threads

## Cite

×

Binomial-Heaps-AFP

    @article{Binomial-Heaps-AFP,
      author  = {Rene Meis and Finn Nielsen and Peter Lammich},
      title   = {Binomial Heaps and Skew Binomial Heaps},
      journal = {Archive of Formal Proofs},
      month   = {October},
      year    = {2010},
      note    = {\url{https://isa-afp.org/entries/Binomial-Heaps.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Dec 11, 2013 : Isabelle2013-2
- Nov 17, 2013 : Isabelle2013-1
- Mar 2, 2013 : Isabelle2013
- Feb 16, 2013 : Isabelle2013
- May 24, 2012 : Isabelle2012
- Oct 11, 2011 : Isabelle2011-1
- Feb 11, 2011 : Isabelle2011
- Oct 28, 2010 : Isabelle2009-2