{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:30:41Z","timestamp":1759332641159},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676904"},{"type":"electronic","value":"9783540449850"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_5","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T15:17:33Z","timestamp":1194967053000},"page":"32-45","source":"Crossref","is-referenced-by-count":26,"title":["Improved Upper Bounds for Pairing Heaps"],"prefix":"10.1007","author":[{"given":"John","family":"Iacono","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"5_CR1","unstructured":"R. Cole. On the dynamic finger conjecture for splay trees. part ii: The proof. Technical Report Computer Science TR1995-701, New York Univerity, 1995."},{"key":"5_CR2","unstructured":"R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. part i: Splay sorting log n-block sequences. Technical Report Computer Science TR1995-700, New York Univerity, 1995."},{"key":"5_CR3","unstructured":"M. L. Fredman. Manuscript in preparation."},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/320211.320214","volume":"46","author":"M. L. Fredman","year":"1999","unstructured":"M. L Fredman. On the efficiency of pairing heaps and related data structures. JACM, 46(4):473\u2013501, 1999.","journal-title":"JACM"},{"key":"5_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-48318-7_20","volume-title":"Workshop on Algorithm Engineering","author":"M. L. Fredman","year":"1999","unstructured":"M. L Fredman. A priority queue transform. In Workshop on Algorithm Engineering, pages 243\u2013257, 1999. LNCS 1668."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M. L. Fredman","year":"1986","unstructured":"M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111\u2013129, 1986.","journal-title":"Algorithmica"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L Fredman and R. E. Tarjan. Fibonacci heaps and their used in improved network optimization algorithms. JACM, 34:596\u2013615, 1987.","journal-title":"JACM"},{"key":"5_CR8","unstructured":"Haim Kaplan and Robert E. Tarjan. New heap data structures. Technical Report Computer Science TR-597-99, Princeton University, 1999."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. JACM, 32:652\u2013686, 1985.","journal-title":"JACM"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D. D. Sleator","year":"1986","unstructured":"D. D. Sleator and R. E. Tarjan. Self-adjusting heaps. SIAM Journal of Computing, 15:52\u201369, 1986.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/214748.214759","volume":"15","author":"J. T. Stasko","year":"1987","unstructured":"J. T. Stasko and J. S. Vitter. Pairing heaps: experiments and analysis. CACM, 15:234\u2013249, 1987.","journal-title":"CACM"},{"key":"5_CR12","unstructured":"R. Sundar. Amoritzed Complexity of Data Structures. PhD thesis, New York University, 1991."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan. Sequential access in splay trees takes linear time. Combinatorica, 5:367\u2013378, 1985.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T20:57:16Z","timestamp":1548363436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}