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 amortized constant amortized time for insertion.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2016
- DOI:
- 10.48550/arXiv.1606.06389
- arXiv:
- arXiv:1606.06389
- Bibcode:
- 2016arXiv160606389I
- Keywords:
-
- Computer Science - Data Structures and Algorithms