{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:13Z","timestamp":1740547993814,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_50","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"556-567","source":"Crossref","is-referenced-by-count":6,"title":["On Adaptive Integer Sorting"],"prefix":"10.1007","author":[{"given":"Anna","family":"Pagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S. Albers","year":"1997","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Inf. Comput.\u00a0136, 25\u201351 (1997)","journal-title":"Inf. Comput."},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/jcss.1998.1580","volume":"57","author":"A. Andersson","year":"1998","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? J. Comp. Syst. Sc.\u00a057, 74\u201393 (1998); Announced at STOC 1995 (1995)","journal-title":"J. Comp. Syst. Sc."},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Andersson, A., Thorup, M.: Tight(er) worst-case bounds on dynamic searching and priority queues. In: Proc. 32nd STOC, pp. 335\u2013342 (2000)","DOI":"10.1145\/335305.335344"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.: Optimal bounds for the predecessor problem. In: Proc. 31st STOC, pp. 295\u2013304 (1999)","DOI":"10.1145\/301250.301323"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36136-7_20","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2002","unstructured":"Brodal, G.S., Fagerberg, R.: Funnel heap - a cache oblivious priority queue. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 219\u2013228. Springer, Heidelberg (2002)"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci.\u00a047, 424\u2013436 (1993); Announced at STOC 1990 (1990)","journal-title":"J. Comput. Syst. Sci."},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci.\u00a048, 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation for linear lists. In: Proc. 9th STOC, pp. 49\u201360 (1977)","DOI":"10.1145\/800105.803395"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Han, Y.: Deterministic sorting in O(n log log n) time and linear space. In: Proc. 34th STOC, pp. 602\u2013608 (2002)","DOI":"10.1145\/509907.509993"},{"key":"50_CR10","unstructured":"Han, Y., Thorup, M.: Integer sorting in O(n $\\sqrt{log log n}$ ) expected time and linear space. In: Proc. 43rd FOCS, pp. 135\u2013144 (2002)"},{"issue":"3","key":"50_CR11","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. Algorithms\u00a014(3), 395\u2013413 (1993)","journal-title":"J. Algorithms"},{"key":"50_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)"},{"key":"50_CR13","volume-title":"Quicksort","author":"R. Sedgewick","year":"1980","unstructured":"Sedgewick, R.: Quicksort. Garland Pub. Co., New York (1980)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Equivalence between priority queues and sorting. In: Proc. 43rd FOCS, pp. 125\u2013134 (2002)","DOI":"10.1109\/SFCS.2002.1181889"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:38:51Z","timestamp":1740523131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}