{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:59Z","timestamp":1725665099840},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_18","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T13:53:14Z","timestamp":1330350794000},"page":"173-185","source":"Crossref","is-referenced-by-count":2,"title":["Fat Heaps without Regular Counters"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-60220-8_70","volume-title":"Algorithms and Data Structures","author":"G.S. Brodal","year":"1995","unstructured":"Brodal, G.S.: Fast Meldable Priority Queues. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 282\u2013290. Springer, Heidelberg (1995)"},{"key":"18_CR2","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52\u201358. ACM\/SIAM, New York\/Philadelphia (1996)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M.R. Brown","year":"1978","unstructured":"Brown, M.R.: Implementation and analysis of binomial queue algorithms. SIAM Journal on Computing\u00a07(3), 298\u2013319 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-13193-6_36","volume-title":"Experimental Algorithms","author":"A. Bruun","year":"2010","unstructured":"Bruun, A., Edelkamp, S., Katajainen, J., Rasmussen, J.: Policy-Based Benchmarking of Weak Heaps and Their Relatives. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 424\u2013435. Springer, Heidelberg (2010)"},{"key":"18_CR5","unstructured":"Clancy, M.J., Knuth, D.E.: A programming and problem-solving seminar. Technical Report STAN-CS-77-606, Stanford University (1977)"},{"issue":"11","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J.R. Driscoll","year":"1988","unstructured":"Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM\u00a031(11), 1343\u20131354 (1988)","journal-title":"Communications of the ACM"},{"key":"18_CR7","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Relaxed weak queues: An alternative to run-relaxed heaps. CPH STL Report 2005-2, Department of Computer Science, University of Copenhagen (2005)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Multipartite priority queues. ACM Transactions on Algorithms\u00a05(1), 14:1\u201314:19 (2008)","DOI":"10.1145\/1435375.1435389"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-13731-0_4","volume-title":"Algorithm Theory - SWAT 2010","author":"A. Elmasry","year":"2010","unstructured":"Elmasry, A., Jensen, C., Katajainen, J.: Strictly-Regular Number System and Data Structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 26\u201337. Springer, Heidelberg (2010)"},{"issue":"3","key":"18_CR10","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. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation for linear lists. In: 9th Annual ACM Symposium on Theory of Computing, pp. 49\u201360. ACM, New York (1977)","DOI":"10.1145\/800105.803395"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shafrir, N., Tarjan, R.E.: Meldable heaps and Boolean union-find. In: 34th Annual ACM Symposium on Theory of Computing, pp. 573\u2013582. ACM, New York (2002)","DOI":"10.1145\/509907.509990"},{"key":"18_CR13","unstructured":"Kaplan, H., Tarjan, R.E.: New heap data structures. Technical Report TR-597-99, Department of Computer Science, Princeton University (1999)"},{"issue":"4","key":"18_CR14","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. Communications of the ACM\u00a021(4), 309\u2013315 (1978)","journal-title":"Communications of the ACM"},{"issue":"6","key":"18_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Communications of the ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T14:49:41Z","timestamp":1640962181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}