A linear potential function for pairing heaps

John Iacono, Mark Yagnatinsky

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

    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 constant amortized time for insertion.

    Original languageEnglish (US)
    Title of host publicationCombinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings
    PublisherSpringer Verlag
    Pages489-504
    Number of pages16
    Volume10043 LNCS
    ISBN (Print)9783319487489
    DOIs
    StatePublished - 2016
    Event10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016 - Hong Kong, China
    Duration: Dec 16 2016Dec 18 2016

    Publication series

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

    Other

    Other10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016
    CountryChina
    CityHong Kong
    Period12/16/1612/18/16

    Fingerprint

    Heap
    Potential Function
    Pairing
    Linear Function
    Time Constant
    Insertion
    Imply
    Range of data

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Iacono, J., & Yagnatinsky, M. (2016). A linear potential function for pairing heaps. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings (Vol. 10043 LNCS, pp. 489-504). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10043 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-48749-6_36

    A linear potential function for pairing heaps. / Iacono, John; Yagnatinsky, Mark.

    Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS Springer Verlag, 2016. p. 489-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10043 LNCS).

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

    Iacono, J & Yagnatinsky, M 2016, A linear potential function for pairing heaps. in Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. vol. 10043 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10043 LNCS, Springer Verlag, pp. 489-504, 10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016, Hong Kong, China, 12/16/16. https://doi.org/10.1007/978-3-319-48749-6_36
    Iacono J, Yagnatinsky M. A linear potential function for pairing heaps. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS. Springer Verlag. 2016. p. 489-504. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-48749-6_36
    Iacono, John ; Yagnatinsky, Mark. / A linear potential function for pairing heaps. Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS Springer Verlag, 2016. pp. 489-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{36c394f9dcb54d458d3afb8cc39b4946,
    title = "A linear potential function for pairing heaps",
    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 constant amortized time for insertion.",
    author = "John Iacono and Mark Yagnatinsky",
    year = "2016",
    doi = "10.1007/978-3-319-48749-6_36",
    language = "English (US)",
    isbn = "9783319487489",
    volume = "10043 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "489--504",
    booktitle = "Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings",
    address = "Germany",

    }

    TY - GEN

    T1 - A linear potential function for pairing heaps

    AU - Iacono, John

    AU - Yagnatinsky, Mark

    PY - 2016

    Y1 - 2016

    N2 - 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.

    AB - 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.

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

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

    U2 - 10.1007/978-3-319-48749-6_36

    DO - 10.1007/978-3-319-48749-6_36

    M3 - Conference contribution

    SN - 9783319487489

    VL - 10043 LNCS

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

    SP - 489

    EP - 504

    BT - Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings

    PB - Springer Verlag

    ER -