@inproceedings{36c394f9dcb54d458d3afb8cc39b4946,
title = "A linear potential function for pairing heaps",
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 constant amortized time for insertion.",
author = "John Iacono and Mark Yagnatinsky",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016 ; Conference date: 16-12-2016 Through 18-12-2016",
year = "2016",
doi = "10.1007/978-3-319-48749-6_36",
language = "English (US)",
isbn = "9783319487489",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "489--504",
editor = "Minming Li and Lusheng Wang and Chan, {T-H. Hubert}",
booktitle = "Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings",
}