The pairing heap: A new form of self-adjusting heap
From MaRDI portal
Publication:1087333
DOI10.1007/BF01840439zbMath0611.68042WikidataQ56210997 ScholiaQ56210997MaRDI QIDQ1087333
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Related Items
Three priority queue applications revisited, Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN, A systematic analysis of splaying
Uses Software