Improved upper bounds for pairing heaps

John Iacono

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

    Original languageEnglish (US)
    Title of host publicationAlgorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings
    PublisherSpringer Verlag
    Pages32-45
    Number of pages14
    Volume1851
    ISBN (Print)3540676902, 9783540676904
    DOIs
    StatePublished - 2000
    Event7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway
    Duration: Jul 5 2000Jul 7 2000

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1851
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other7th Scandinavian Workshop on Algorithm Theory, SWAT 2000
    CountryNorway
    CityBergen
    Period7/5/007/7/00

    Fingerprint

    Heap
    Merging
    Pairing
    Upper bound
    Costs
    Time Constant
    Insertion
    Alternatives
    Zero

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Iacono, J. (2000). Improved upper bounds for pairing heaps. In Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings (Vol. 1851, pp. 32-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851). Springer Verlag. https://doi.org/10.1007/3-540-44985-X

    Improved upper bounds for pairing heaps. / Iacono, John.

    Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Vol. 1851 Springer Verlag, 2000. p. 32-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Iacono, J 2000, Improved upper bounds for pairing heaps. in Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. vol. 1851, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, Springer Verlag, pp. 32-45, 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, Bergen, Norway, 7/5/00. https://doi.org/10.1007/3-540-44985-X
    Iacono J. Improved upper bounds for pairing heaps. In Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Vol. 1851. Springer Verlag. 2000. p. 32-45. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-44985-X
    Iacono, John. / Improved upper bounds for pairing heaps. Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Vol. 1851 Springer Verlag, 2000. pp. 32-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{ff05196cf3f44dc2bf77b3f05a06f2d4,
    title = "Improved upper bounds for pairing heaps",
    abstract = "Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.",
    author = "John Iacono",
    year = "2000",
    doi = "10.1007/3-540-44985-X",
    language = "English (US)",
    isbn = "3540676902",
    volume = "1851",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "32--45",
    booktitle = "Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings",

    }

    TY - GEN

    T1 - Improved upper bounds for pairing heaps

    AU - Iacono, John

    PY - 2000

    Y1 - 2000

    N2 - Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

    AB - Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

    UR - http://www.scopus.com/inward/record.url?scp=84956859079&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84956859079&partnerID=8YFLogxK

    U2 - 10.1007/3-540-44985-X

    DO - 10.1007/3-540-44985-X

    M3 - Conference contribution

    SN - 3540676902

    SN - 9783540676904

    VL - 1851

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 32

    EP - 45

    BT - Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings

    PB - Springer Verlag

    ER -