License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-7642
URL: http://drops.dagstuhl.de/opus/volltexte/2006/764/

Pettie, Seth

Towards a Final Analysis of Pairing Heaps

pdf-format:
Dokument 1.pdf (200 KB)


Abstract

Fredman, Sedgewick, Sleator, and Tarjan proposed the {em pairing heap} as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operations in logarithmic time and is known to be extremely efficient in practice. However, despite its simplicity and empirical superiority, the pairing heap is one of the few popular data structures whose basic complexity remains open. In this paper we prove that pairing heaps support the deletemin operation in optimal logarithmic time and all other operations (insert, meld, and decreasekey) in time $O(2^{2sqrt{loglog n}})$. This result gives the {em first} sub-logarithmic time bound for decreasekey and comes close to the lower bound of $Omega(loglog n)$ established by Fredman. Pairing heaps have a well known but poorly understood relationship to splay trees and, to date, the transfer of ideas has flowed in one direction: from splaying to pairing. One contribution of this paper is a new analysis that reasons explicitly with information-theoretic measures. Whether these ideas could contribute to the analysis of splay trees is an open question.

BibTeX - Entry

@InProceedings{pettie:DSP:2006:764,
  author =	{Seth Pettie},
  title =	{Towards a Final Analysis of Pairing Heaps},
  booktitle =	{Data Structures},
  year =	{2006},
  editor =	{Lars Arge and Robert Sedgewick and Dorothea Wagner},
  number =	{06091},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/764},
  annote =	{Keywords: Data structure, heap, self-adjusting, amortized analysis}
}

Keywords: Data structure, heap, self-adjusting, amortized analysis
Seminar: 06091 - Data Structures
Issue date: 2006
Date of publication: 30.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI