Skew Heap


Title: Skew Heap
Author: Tobias Nipkow
Submission date: 2014-08-13
Abstract: Skew heaps are an amazingly simple and lightweight implementation of priority queues. They were invented by Sleator and Tarjan [SIAM 1986] and have logarithmic amortized complexity. This entry provides executable and verified functional skew heaps.

The amortized complexity of skew heaps is analyzed in the AFP entry Amortized Complexity.

  author  = {Tobias Nipkow},
  title   = {Skew Heap},
  journal = {Archive of Formal Proofs},
  month   = aug,
  year    = 2014,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Used by: Amortized_Complexity
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.