{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:44Z","timestamp":1725559004478},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_19","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"212-222","source":"Crossref","is-referenced-by-count":5,"title":["Layered Heaps"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-52846-6_82","volume-title":"SWAT \u201990","author":"A. Andersson","year":"1990","unstructured":"Andersson, A., Lai, T.W.: Fast updating of well-balanced trees. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol.\u00a0447, pp. 111\u2013121. Springer, Heidelberg (1990)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"M. Brown","year":"1978","unstructured":"Brown, M.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput.\u00a07, 298\u2013319 (1978)","journal-title":"SIAM J. Comput."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-60220-8_70","volume-title":"Algorithms and Data Structures","author":"G. Brodal","year":"1995","unstructured":"Brodal, G.: 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":"19_CR4","unstructured":"Brodal, G.: Worst-case efficient priority queues. In: 7th ACM SODA, pp. 52\u201358 (1996)"},{"key":"19_CR5","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. Inf. Proc. Lett.\u00a037, 117\u2013120 (1991)","journal-title":"Inf. Proc. Lett."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-19487-8","volume-title":"SWAT \u201988","author":"S. Carlsson","year":"1988","unstructured":"Carlsson, S., Munro, J., Poblete, P.: An implicit binomial queue with constant insertion time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 1\u201313. Springer, Heidelberg (1988)"},{"issue":"11","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"J. Driscoll","year":"1988","unstructured":"Driscoll, J., Gabow, H., Shairman, R., Tarjan, R.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Comm. ACM\u00a031(11), 1343\u20131354 (1988)","journal-title":"Comm. ACM"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/3-540-36494-3_57","volume-title":"STACS 2003","author":"A. Elmasry","year":"2003","unstructured":"Elmasry, A., Fredman, M.: Adaptive sorting and the information theoretic lower bound. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 654\u2013662. Springer, Heidelberg (2003)"},{"key":"19_CR9","unstructured":"Elmasry, A., Ramachandran, V., Sridhar, S.: Adaptive sorting using binomial heap. (submitted)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M. Fredman","year":"1986","unstructured":"Fredman, M., Sedgewick, R., Sleator, D., Tarjan, R.: The pairing heap: a new form of self adjusting heap. Algorithmica\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for computational geometry. In: 16th ACM STOC, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G. Gonnet","year":"1986","unstructured":"Gonnet, G., Munro, J.: Heaps on heaps. SIAM J. Comput.\u00a015(4), 964\u2013971 (1986)","journal-title":"SIAM J. Comput."},{"key":"19_CR14","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":"19_CR15","unstructured":"Kaplan, H., Tarjan, R.: New heap data structures. TR-597-99, Princeton University (1999)"},{"key":"19_CR16","first-page":"238","volume":"10","author":"J. Katajainen","year":"2003","unstructured":"Katajainen, J., Vitale, F.: Navigation piles with applications to sorting, priority queues, and priority deques. Nord. J. Comput.\u00a010, 238\u2013262 (2003)","journal-title":"Nord. J. Comput."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1993.1021","volume":"14","author":"C. Levcopoulos","year":"1993","unstructured":"Levcopoulos, C., Petersson, O.: Adaptive Heapsort. J. Alg.\u00a014, 395\u2013413 (1993)","journal-title":"J. Alg."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","volume":"12","author":"M. Overmars","year":"1981","unstructured":"Overmars, M., van Leeuwen, J.: Worst-case optimal insertion and deletion methods for decomposable searching problems. Inf. Proc. Lett.\u00a012, 168\u2013173 (1981)","journal-title":"Inf. Proc. Lett."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. Tarjan","year":"1985","unstructured":"Tarjan, R.: Amortized computational complexity. SIAM J. Alg. Disc. Meth.\u00a06, 306\u2013318 (1985)","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"4","key":"19_CR20","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. Comm. ACM\u00a021(4), 309\u2013314 (1978)","journal-title":"Comm. ACM"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Comm. ACM\u00a023, 229\u2013237 (1980)","journal-title":"Comm. ACM"},{"issue":"6","key":"19_CR22","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. Williams","year":"1964","unstructured":"Williams, J.: Algorithm 232, Heapsort. Comm. ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T10:11:26Z","timestamp":1635675086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}