par Iacono, John ;Yagnatinsky, Mark
Référence Lecture notes in computer science, 10043 LNCS, page (489-504)
Publication Publié, 2016
Article révisé par les pairs
Résumé : 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.