{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:29:42Z","timestamp":1778822982078,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755197","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_19","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T23:46:33Z","timestamp":1189727193000},"page":"194-205","source":"Crossref","is-referenced-by-count":19,"title":["Radix Sorting with No Extra Space"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"P\u01cetra\u015fcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","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? Journal of Computer and System Sciences\u00a057(1), 74\u201393 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"19_CR3","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. System Sci.\u00a047, 424\u2013436 (1993)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"19_CR4","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. System Sci.\u00a048(3), 533\u2013551 (1994)","journal-title":"J. Comput. System Sci."},{"key":"19_CR5","unstructured":"Han, Y., Thorup, M.: Integer sorting in \n                    \n                      \n                    \n                    $O(n \\sqrt{\\log \\log n})$\n                   expected time and linear space. In: FOCS, pp. 135\u2013144. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01994842","volume":"32","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT\u00a032(4), 580\u2013585 (1992)","journal-title":"BIT"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01178508","volume":"31","author":"J. Katajainen","year":"1994","unstructured":"Katajainen, J., Pasanen, T.: Sorting multisets stably in minimum space. Acta Informatica\u00a031(4), 301\u2013313 (1994)","journal-title":"Acta Informatica"},{"key":"19_CR8","first-page":"744","volume":"10","author":"M.A. Kronrod","year":"1969","unstructured":"Kronrod, M.A.: Optimal ordering algorithm without operational field. Soviet Math. Dokl.\u00a010, 744\u2013746 (1969)","journal-title":"Soviet Math. Dokl."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences\u00a033(1), 66\u201374 (1986)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. Salowe","year":"1987","unstructured":"Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms\u00a08(4), 557\u2013571 (1987)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:22:46Z","timestamp":1619504566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_19","relation":{},"subject":[]}}