bn:02761902n
Noun Concept
Categories: Heaps (data structures), date and year, Amortized data structures
EN
pairing heap
EN
A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and Robert Tarjan in 1986. Wikipedia
Definitions
Relations
Sources
EN
A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and Robert Tarjan in 1986. Wikipedia
Type of heap data structure with relatively simple implementation and excellent practical amortized performance Wikidata
IS A
Wikipedia
Wikidata
Wikipedia Redirections