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
    EditorsMinming Li, Lusheng Wang, T-H. Hubert Chan
    PublisherSpringer Verlag
    Pages489-504
    Number of pages16
    ISBN (Print)9783319487489
    DOIs
    StatePublished - Jan 1 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)0302-9743
    ISSN (Electronic)1611-3349

    Other

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

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'A linear potential function for pairing heaps'. Together they form a unique fingerprint.

  • Cite this

    Iacono, J., & Yagnatinsky, M. (2016). A linear potential function for pairing heaps. In M. Li, L. Wang, & T-H. H. Chan (Eds.), Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings (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