{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:57:09Z","timestamp":1767650229898,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_20","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"242-253","source":"Crossref","is-referenced-by-count":2,"title":["Fast Integer Sorting in Linear Space"],"prefix":"10.1007","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S. Albers","year":"1997","unstructured":"S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Information and Computation, 136, 25\u201351 (1997).","journal-title":"Information and Computation"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"A. Andersson, Fast deterministic sorting and searching in linear space, Proc. 1996 IEEE Symp. on Foundations of Computer Science, 135\u2013141 (1996).","DOI":"10.1109\/SFCS.1996.548472"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time? Proc. 1995 Symposium on Theory of Computing, 427\u2013436(1995).","DOI":"10.1145\/225058.225173"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1994","unstructured":"M.L. Fredman, D.E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47, 424\u2013436(1994).","journal-title":"J. Comput. System Sci."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","volume":"26","author":"R. Cole","year":"1987","unstructured":"R. Cole, An optimally efficient selection algorithm, Information Processing Letters, 26, 295\u2013299(1987\/88).","journal-title":"Information Processing Letters"},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0030847","volume-title":"Proc. 1995 International Computing and Combinatorics Conference","author":"Y. Han","year":"1995","unstructured":"Y. Han, X. Shen, Conservative algorithms for parallel and sequential integer sorting, Proc. 1995 International Computing and Combinatorics Conference, Lecture Notes in Computer Science 959, 324\u2013333(August, 1995)."},{"key":"20_CR7","unstructured":"Y. Han, X. Shen, Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. Proc. 1999 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201999), Baltimore, Maryland, 419\u2013428(January 1999)."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(83)90023-3","volume":"28","author":"D. Kirkpatrick","year":"1984","unstructured":"D. Kirkpatrick and S. Reisch, Upper bounds for sorting integers on random access machines, Theoretical Computer Science 28, 263\u2013276(1984).","journal-title":"Theoretical Computer Science"},{"key":"20_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publ., San Mateo, CA. 1992."},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-61680-2_51","volume-title":"Proc. 1996 European Symp. on Algorithms","author":"R. Raman","year":"1996","unstructured":"R. Raman, Priority queues: small, monotone and trans-dichotomous, Proc. 1996 European Symp. on Algorithms, Lecture Notes in Computer Science 1136, 121\u2013137(1996)."},{"key":"20_CR11","unstructured":"M. Thorup. Fast deterministic sorting and priority queues in linear space, Proc. 1998 ACM-SIAM Symp. on Discrete Algorithms (SODA\u201998), 550\u2013555(1998)."},{"key":"20_CR12","unstructured":"M. Thorup. Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA\u201997), 352\u2013359(1997)."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:55:59Z","timestamp":1737341759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}