English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Pairing Heaps with O(log log n) decrease Cost

MPS-Authors
/persons/resource/persons44380

Elmasry,  Amr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Elmasry, A. (2009). Pairing Heaps with O(log log n) decrease Cost. In 20th ACM-SIAM Symposium on Discrete Algorithms (pp. 471-476). Philadelphia, PA: SIAM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-18AE-5
Abstract
We give a variation of the pairing heaps for which the time bounds for all the operations match the lower bound proved by Fredman for a family of similar self-adjusting heaps. Namely, our heap structure requires $O(1)$ for insert and find-min, $O(\log{n})$ for delete-min, and $O(\log\log{n})$ for decrease-key and meld (all the bounds are in the amortized sense except for find-min).