{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:15Z","timestamp":1759332495703},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_36","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"489-504","source":"Crossref","is-referenced-by-count":3,"title":["A Linear Potential Function for Pairing Heaps"],"prefix":"10.1007","author":[{"given":"John","family":"Iacono","sequence":"first","affiliation":[]},{"given":"Mark","family":"Yagnatinsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: the proof. SIAM J. Comput. 30(1), 44\u201385 (2000)","journal-title":"SIAM J. Comput."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Elmasry, A.: Pairing heaps with $$O(\\log \\log n)$$ decrease cost. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 471\u2013476, January 2009","DOI":"10.1137\/1.9781611973068.52"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Elmasry, A.: Pairing heaps with costless meld, April 2009. http:\/\/arxiv.org\/abs\/0903.4130 . In: Part I of the Proceedings of the 18th Annual European Symposium Algorithms, ESA, pp. 183\u2013193, September 2010","DOI":"10.1007\/978-3-642-15781-3_16"},{"issue":"4","key":"36_CR4","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/320211.320214","volume":"46","author":"ML Fredman","year":"1999","unstructured":"Fredman, M.L.: On the efficiency of pairing heaps and related data structures. J. ACM 46(4), 473\u2013501 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"36_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"ML Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. In: Proceedings of the 25th IEEE Symposium on the Foundations of Computer Science, FOCS, pp. 338\u2013346, October 1984. J. ACM 34(3), 596\u2013615 (1987)","DOI":"10.1145\/28869.28874"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Sen, S., Tarjan, R.E.: Rank-pairing heaps. In: Proceedings of the 17th Annual European Symposium on Algorithms, ESA, pp. 659\u2013670, September 2009. SIAM J. Comput. 40(6), pp. 1463\u20131485 (2011)","DOI":"10.1137\/100785351"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-44985-X_5","volume-title":"Algorithm Theory - SWAT 2000","author":"J Iacono","year":"2000","unstructured":"Iacono, J.: Improved upper bounds for pairing heaps. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 32\u201345. Springer, Heidelberg (2000). arXiv.org\/abs\/1110.4428 (2011)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Iacono, J., Yagnatinsky, M.: A Linear Potential Function for Pairing Heaps. arXiv.org\/abs\/1606.06389 (2016)","DOI":"10.1007\/978-3-319-48749-6_36"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Why some heaps support constant-amortized-time decrease-key operations, others do not. First version: Iacono, J.: arXiv.org\/abs\/1302.6641 , February 2013. Later: Iacono, J., \u00d6zkan, \u00d6.: 41st International Colloquium on Automata, Languages, and Programming, ICALP, pp. 637\u2013649, July 2014","DOI":"10.1007\/978-3-662-43948-7_53"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Larkin, D.H., Sen, S., Tarjan, R.E.: A back-to-basics empirical study of priority queues. In: 2014 Proceedings of the 16th Workshop on Algorithm Engineering, Experiments, ALENEX, pp. 61\u201372, January 2014. arXiv.org\/abs\/1403.0252 , March 2014","DOI":"10.1137\/1.9781611973198.7"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Pettie, S.: Towards a final analysis of pairing heaps. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 174\u2013183, October 2005","DOI":"10.1109\/SFCS.2005.75"},{"issue":"3","key":"36_CR13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"36_CR14","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/214748.214759","volume":"30","author":"JT Stasko","year":"1987","unstructured":"Stasko, J.T., Vitter, J.S.: Pairing heaps: experiments and analysis. Commun. ACM 30(3), 234\u2013249 (1987)","journal-title":"Commun. ACM"},{"issue":"4","key":"36_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J Vuillemin","year":"1978","unstructured":"Vuillemin, J.: A data structure for manipulating priority queues. Commun. ACM 21(4), 309\u2013315 (1978)","journal-title":"Commun. ACM"},{"key":"36_CR16","unstructured":"Yagnatinsky, M.: Thinnest V-shapes, biggest angles, and lowest potentials. Ph.D. thesis, NYU Tandon School of Engineering, May 2016. http:\/\/cse.poly.edu\/~myag\/thesis.pdf"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T04:40:52Z","timestamp":1568522452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}