{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:49:41Z","timestamp":1767649781697,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_26","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"279-290","source":"Crossref","is-referenced-by-count":1,"title":["More Efficient Parallel Integer Sorting"],"prefix":"10.1007","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtia","year":"1983","unstructured":"Ajtia, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Sorting in c logn parallel steps. Combinatorica\u00a03, 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"26_CR2","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. Information and Computation\u00a0136, 25\u201351 (1997)","journal-title":"Information and Computation"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: Proc. 1995 Symposium on Theory of Computing, pp. 427\u2013436 (1995)","DOI":"10.1145\/225058.225173"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1002\/j.1538-7305.1962.tb03990.x","volume":"41","author":"V.E. Benes","year":"1962","unstructured":"Benes, V.E.: On rearrangeable three-stage connecting networks. Bell Syst. Tech. J.\u00a041, 1481\u20131492 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"26_CR5","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V.E. Benes","year":"1965","unstructured":"Benes, V.E.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic, New York (1965)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Chen, S., Reif, J.H.: Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs. In: 34th Annual IEEE Conference on Foundations of Computer Science (FOCS 1993) Proceedings, Palo Alto, CA, pp. 104\u2013112 (November 1993)","DOI":"10.1109\/SFCS.1993.366877"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"Cook, S., Dwork, C., Reischuk, R.: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. SIAM J. Comput.\u00a015(1), 87\u201397 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/0401044","volume":"1","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM J. on Discrete Math.\u00a01(4), 447\u2013471 (1988)","journal-title":"SIAM J. on Discrete Math."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Han, Y.: Matching partition a linked list and its optimization. In: Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA 1989), Santa Fe, Mexico, pp. 246\u2013253 (June 1989)","DOI":"10.1145\/72935.72961"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Han, Y.: An optimal linked list prefix algorithm on a local memory computer. In: Proc. 1989 Computer Science Conference (CSC 1989), pp. 278\u2013286 (February 1989)","DOI":"10.1145\/75427.75462"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1006\/inco.2001.3053","volume":"170","author":"Y. Han","year":"2001","unstructured":"Han, Y.: Improved fast integer sorting in linear space. Information and Computation\u00a0170(1), 81\u201394 (2001)","journal-title":"Information and Computation"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jalgor.2003.09.001","volume":"50","author":"Y. Han","year":"2004","unstructured":"Han, Y.: Deterministic sorting in O(n loglogn) time and linear space. Journal of Algorithms\u00a050, 96\u2013105 (2004)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"26_CR13","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1137\/S0097539799352449","volume":"31","author":"Y. Han","year":"2002","unstructured":"Han, Y., Shen, X.: Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. SIAM J. Comput.\u00a031(6), 1852\u20131878 (2002)","journal-title":"SIAM J. Comput."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Hightower, W.L., Prins, J., Reif, J.H.: Implementations of randomized sorting on large parallel machines. In: 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1992), San Diego, CA, pp. 158\u2013167 (July 1992)","DOI":"10.1145\/140901.140918"},{"key":"26_CR15","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley (1992)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"C-34","author":"T. Leighton","year":"1985","unstructured":"Leighton, T.: Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput.\u00a0C-34, 344\u2013354 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"26_CR17","unstructured":"Reif, J.H.: An n 1\u2009+\u2009\u03b5 processor, O(logn) time probabilistic sorting algorithm. In: SIAM 2nd Conference on the Applications of Discrete Mathematics, Cambridge, MA, pp. 27\u201329 (June 1983)"},{"key":"#cr-split#-26_CR18.1","doi-asserted-by":"crossref","unstructured":"Rajasekaran, S., Reif, J.H.: An optimal parallel algorithm for integer sorting. In: 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, pp. 496-503 (October 1985)","DOI":"10.1109\/SFCS.1985.9"},{"key":"#cr-split#-26_CR18.2","doi-asserted-by":"crossref","unstructured":"Published as Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal on Computing 18(3), 594-607 (1989)","DOI":"10.1137\/0218041"},{"key":"#cr-split#-26_CR19.1","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Reif, J.H.: A Logarithmic Time Sort for Linear Size Networks. In: 15th Annual ACM Symposium on Theory of Computing, Boston, MA, pp. 10-16 (April 1983)","DOI":"10.1145\/800061.808727"},{"key":"#cr-split#-26_CR19.2","doi-asserted-by":"crossref","unstructured":"Published in Journal of the ACM(JACM) 34(1), 60-76 (1987)","DOI":"10.1145\/7531.7532"},{"key":"26_CR20","unstructured":"Wyllie, J.C.: The complexity of parallel computation, TR 79-387, Department of Computer Science, Cornell University, Ithaca, NY (1979)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:54:25Z","timestamp":1743026065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}