{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T16:26:45Z","timestamp":1794500805768,"version":"4.9.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319202969","type":"print"},{"value":"9783319202976","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_14","type":"book-chapter","created":{"date-parts":[[2015,6,21]],"date-time":"2015-06-21T21:55:05Z","timestamp":1434923705000},"page":"204-218","source":"Crossref","is-referenced-by-count":1,"title":["An In-Place Priority Queue with O(1) Time for Push and $$\\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amr","family":"Elmasry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"MR Brown","year":"1978","unstructured":"Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7(3), 298\u2013319 (1978)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","volume":"24","author":"S Carlsson","year":"1987","unstructured":"Carlsson, S.: A variant of heapsort with almost optimal number of comparisons. Inf. Process. Lett. 24(4), 247\u2013250 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(91)90144-7","volume":"37","author":"S Carlsson","year":"1991","unstructured":"Carlsson, S.: An optimal algorithm for deleting the root of a heap. Inform. Process. Lett. 37(2), 117\u2013120 (1991)","journal-title":"Inform. Process. Lett."},{"issue":"1\u20132","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00152-2","volume":"164","author":"S Carlsson","year":"1996","unstructured":"Carlsson, S., Chen, J., Mattsson, C.: Heaps with bits. Theor. Comput. Sci. 164(1\u20132), 1\u201312 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","series-title":"LNCS","first-page":"1","volume-title":"SWAT 1988","author":"S Carlsson","year":"1988","unstructured":"Carlsson, S., Munro, J.I., Poblete, P.V.: An implicit binomial queue with constant insertion time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 1\u201313. Springer, Heidelberg (1988)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-32589-2_25","volume-title":"Mathematical Foundations of Computer Science 2012","author":"J Chen","year":"2012","unstructured":"Chen, J., Edelkamp, S., Elmasry, A., Katajainen, J.: In-place heap construction with optimized comparisons, moves, and cache misses. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 259\u2013270. Springer, Heidelberg (2012)"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"RD Dutton","year":"1993","unstructured":"Dutton, R.D.: Weak-heap sort. BIT 33(3), 372\u2013381 (1993)","journal-title":"BIT"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jda.2013.07.002","volume":"23","author":"S Edelkamp","year":"2013","unstructured":"Edelkamp, S., Elmasry, A., Katajainen, J.: Weak heaps engineered. J. Discrete Algorithms 23, 83\u201397 (2013). Presented at IWOCA 2012","journal-title":"J. Discrete Algorithms"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-27810-8_19","volume-title":"Algorithm Theory - SWAT 2004","author":"A Elmasry","year":"2004","unstructured":"Elmasry, A.: Layered heaps. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 212\u2013222. Springer, Heidelberg (2004)"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1435375.1435389","volume":"5","author":"A Elmasry","year":"2008","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Multipartite priority queues. ACM Trans. Algorithms 5(1), 14:1\u201314:19 (2008). Article no. 14","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR11","unstructured":"Elmasry, A., Katajainen, J.: Towards ultimate binary heaps. CPH STL Report 2013\u20131, Department of Computer Science, University of Copenhagen (2013)"},{"issue":"12","key":"14_CR12","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"RW Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort 3. Commun. ACM 7(12), 701 (1964)","journal-title":"Commun. ACM"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"GH Gonnet","year":"1986","unstructured":"Gonnet, G.H., Munro, J.I.: Heaps on heaps. SIAM J. Comput 15(4), 964\u2013971 (1986). Presented at ICALP 1982","journal-title":"SIAM J. Comput"},{"key":"14_CR14","first-page":"87","volume-title":"CATS 1998. Australian Computer Science Communications","author":"J Katajainen","year":"1998","unstructured":"Katajainen, J.: The ultimate heapsort. In: Lin, X. (ed.) CATS 1998. Australian Computer Science Communications, vol. 20, pp. 87\u201395. Springer, Singapore (1998)"},{"key":"14_CR15","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3, 2nd edn. Addison Wesley Longman, Reading (1998)","edition":"2"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"CJH McDiarmid","year":"1989","unstructured":"McDiarmid, C.J.H., Reed, B.A.: Building heaps fast. J. Algorithms 10(3), 352\u2013365 (1989)","journal-title":"J. Algorithms"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","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"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(92)90005-Z","volume":"97","author":"I Wegener","year":"1992","unstructured":"Wegener, I.: The worst case complexity of McDiarmid and Reed\u2019s variant of Bottom-up Heapsort is less than $$n\\log n + 1.1n$$ n log n + 1.1 n . Inf. Comput. 97(1), 86\u201396 (1992). Presented at STACS 1991","journal-title":"Inf. Comput."},{"issue":"6","key":"14_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Commun. ACM 7(6), 347\u2013348 (1964)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T10:05:06Z","timestamp":1652522706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}