A Linear Potential Function for Pairing Heaps
Data Structures and Algorithms
2016-06-28 v2
Abstract
We present the first potential function for pairing heaps with linear range. This implies that the runtime of a short sequence of operations is faster than previously known. It is also simpler than the only other potential function known to give amortized constant amortized time for insertion.
Cite
@article{arxiv.1606.06389,
title = {A Linear Potential Function for Pairing Heaps},
author = {John Iacono and Mark Yagnatinsky},
journal= {arXiv preprint arXiv:1606.06389},
year = {2016}
}