{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:36Z","timestamp":1746331416760,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_53","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"637-649","source":"Crossref","is-referenced-by-count":3,"title":["Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not"],"prefix":"10.1007","author":[{"given":"John","family":"Iacono","sequence":"first","affiliation":[]},{"given":"\u00d6zg\u00fcr","family":"\u00d6zkan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"53_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Elmasry, A.: Pairing heaps with O(log log n) decrease cost. In: SODA, pp. 471\u2013476 (2009)","DOI":"10.1137\/1.9781611973068.52"},{"key":"53_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-15781-3_16","volume-title":"Algorithms \u2013 ESA 2010","author":"A. Elmasry","year":"2010","unstructured":"Elmasry, A.: Pairing Heaps with Costless Meld. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 183\u2013193. Springer, Heidelberg (2010)"},{"key":"53_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48318-7_20","volume-title":"Algorithm Engineering","author":"M.L. Fredman","year":"1999","unstructured":"Fredman, M.L.: A Priority Queue Transform. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 244\u2013258. Springer, Heidelberg (1999)"},{"issue":"4","key":"53_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/320211.320214","volume":"46","author":"M.L. Fredman","year":"1999","unstructured":"Fredman, M.L.: On the Efficiency of Pairing Heaps and Related Data Structures. J. ACM\u00a046(4), 473\u2013501 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"53_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M.L. 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\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"53_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"53_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01851, pp. 32\u201345. Springer, Heidelberg (2000)"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Pettie, S.: Towards a Final Analysis of Pairing Heaps. In: FOCS, pp. 174\u2013183 (2005)","DOI":"10.1109\/SFCS.2005.75"},{"issue":"3","key":"53_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-Adjusting Binary Search Trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D.D. Sleator","year":"1986","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-Adjusting Heaps. SIAM J. Comput.\u00a015(1), 52\u201369 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"53_CR13","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/214748.214759","volume":"30","author":"J.T. Stasko","year":"1987","unstructured":"Stasko, J.T., Vitter, J.S.: Pairing Heaps: Experiments and Analysis. Commun. ACM\u00a030(3), 234\u2013249 (1987)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:08Z","timestamp":1746264668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}