# Pairing Heap

 Title: Pairing Heap Authors: Hauke Brinkop (hauke /dot/ brinkop /at/ googlemail /dot/ com) and Tobias Nipkow Submission date: 2016-07-14 Abstract: This library defines three different versions of pairing heaps: a functional version of the original design based on binary trees [Fredman et al. 1986], the version by Okasaki [1998] and a modified version of the latter that is free of structural invariants. The amortized complexity of pairing heaps is analyzed in the AFP article Amortized Complexity. Origin: This library was extracted from Amortized Complexity and extended. BibTeX: @article{Pairing_Heap-AFP, author = {Hauke Brinkop and Tobias Nipkow}, title = {Pairing Heap}, journal = {Archive of Formal Proofs}, month = jul, year = 2016, note = {\url{http://isa-afp.org/entries/Pairing_Heap.html}, Formal proof development}, ISSN = {2150-914x}, } License: BSD License Used by: Amortized_Complexity, CakeML_Codegen