A Linear Potential Function for Pairing Heaps

TL;DR

This paper introduces a new linear potential function for pairing heaps, enabling faster amortized operation times and simplifying analysis compared to previous methods.

Contribution

It provides the first linear potential function for pairing heaps, improving efficiency and simplicity over existing approaches.

Findings

Faster amortized operation times for pairing heaps.

Simpler analysis of pairing heap operations.

First linear potential function for this data structure.

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.