Pairing Heap (Q7361590)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Pairing_Heap
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pairing Heap |
AFP entry Pairing_Heap |
Statements
14 July 2016
0 references
Hauke Brinkop
0 references
Tobias Nipkow
0 references
Pairing Heap (English)
0 references
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 .
0 references
