{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:21:50Z","timestamp":1755220910396,"version":"3.43.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015365901501","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:08:17Z","timestamp":1041098897000},"page":"269-275","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Self-Index Integer Sorting"],"prefix":"10.1007","volume":"22","author":[{"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameh S.","family":"Daoud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud K. A.","family":"Khairat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"406442_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S. Albers","year":"1997","unstructured":"S. Albers and T.Hagerup. Improved integer sorting without concurrent writing. Information and Computation, 136:25\u201351, 1997.","journal-title":"Information and Computation"},{"key":"406442_CR2","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/inco.1995.1159","volume":"123","author":"H. Bast","year":"1995","unstructured":"H. Bast and T. Hagerup. Fast parallel space allocation, estimation, and integer sorting. Information and Computation, 123:72\u2013110, 1995.","journal-title":"Information and Computation"},{"key":"406442_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","volume":"94","author":"P. C. P. Bhatt","year":"1991","unstructured":"P. C. P. Bhatt, K. Diks, T. Hagerup, V.C. Prasad, T. Radzik, and S. Saxena. Improved deterministic parallel integer sorting. Information and Computation, 94:29\u201347,1991.","journal-title":"Information and Computation"},{"key":"406442_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(88)90092-0","volume":"27","author":"B. Chlebus","year":"1988","unstructured":"B. Chlebus. A parallel bucket sort. Information Processing Letters, 27:57\u201361, 1988.","journal-title":"Information Processing Letters"},{"key":"406442_CR5","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. Parallel merge sort. SIAM Journal of Computing, 17:770\u2013785, 1988.","journal-title":"SIAM Journal of Computing"},{"key":"406442_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jpdc.1997.1401","volume":"48","author":"A. Dessmark","year":"1998","unstructured":"A. Dessmark and A. Lingas. Improved bounds for integer sorting in the EREW PRASM model. Parallel and Distributed Computing, 48:64\u201370, 1998.","journal-title":"Parallel and Distributed Computing"},{"key":"406442_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","volume":"75","author":"T. Hagerup","year":"1987","unstructured":"T. Hagerup. Towards optimal parallel bucket sorting. Information and Computation, 75:39\u201351, 1987.","journal-title":"Information and Computation"},{"key":"406442_CR8","first-page":"870","volume-title":"Handbook of Theoretical Computer Science","author":"R. Karp","year":"1990","unstructured":"R. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, vol.A, pp.870\u2013941. Elsevier Science Publisher, North Holland, Amsterdam, 1990."},{"key":"406442_CR9","first-page":"75","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth. The Art of Computer Programming: Sorting and Searching, pp. 75\u201385. Addison-Wesley, Reading,MA, 1973."},{"key":"406442_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01840376","volume":"5","author":"C. Kruskal","year":"1990","unstructured":"C. Kruskal, L. Rudolph, and M. Snir. Efficient parallel algorithms for graph problems. Algorithmica, 5:43\u201364, 1990.","journal-title":"Algorithmica"},{"key":"406442_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"7","author":"C. Kruskal","year":"1990","unstructured":"C. Kruskal, L. Rudolph, and M. Snir. A complexity theory of ef cient parallel algorithms. In Handbook of Theoretical Computer Science, vol. 7, pp. 95\u2013132, 1990.","journal-title":"Handbook of Theoretical Computer Science"},{"key":"406442_CR12","unstructured":"P. MacKenzie and Q. Stout. Ultra-fast expected time parallel algorithms. In Proceedings of the Sym posium on Discrete Algorithms, pp. 414\u2013423, 1991."},{"key":"406442_CR13","first-page":"729","volume":"443","author":"Y. Matias","year":"1990","unstructured":"Y. Matias and U. Vishkin. On parallel hashing and integer sorting. In Proceedings of the 17th ICALP, Springer LNCS 443, pp. 729\u2013743, 1990.","journal-title":"Proceedings of the 17th ICALP"},{"key":"406442_CR14","first-page":"744","volume":"443","author":"P. Ragde","year":"1990","unstructured":"P. Ragde. The simplicity of compaction and chaining. In Proceedings of the 17th ICALP, Springer LNCS 443, pp.744\u2013751, 1990.","journal-title":"Proceedings of the 17th ICALP"},{"key":"406442_CR15","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S. Rajasekaran","year":"1989","unstructured":"S. Rajasekaran and J.H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal of Computing, 18:594\u2013607, 1989.","journal-title":"SIAM Journal of Computing"},{"key":"406442_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01178563","volume":"29","author":"S. Rajasekaran","year":"1992","unstructured":"S. Rajasekaran and S. Sen. On parallel integer sorting. Acta Informatica, 29:1\u201319, 1992.","journal-title":"Acta Informatica"},{"key":"406442_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/3-540-53487-3_42","volume":"472","author":"R. Raman","year":"1990","unstructured":"R. Raman. The power of collision:Randomized parallel algorithm for chaining and integer sorting. In Proceedings of the 10th Conference on Foundation Software Technology and Theoretical Computer Science, LNCS vol. 472, pp. 161\u2013175, 1990.","journal-title":"Proceedings of the 10th Conference on Foundation Software Technology and Theoretical Computer Science"},{"key":"406442_CR18","series-title":"Technical report","volume-title":"Optimal sub-logarithmic time integer sorting on the CRCW PRAM","author":"R. Raman","year":"1991","unstructured":"R. Raman. Optimal sub-logarithmic time integer sorting on the CRCW PRAM. Technical report no. 370. Computer Science Department, University of Rochester, New York, January 1991."},{"key":"406442_CR19","doi-asserted-by":"crossref","unstructured":"J. H. Reif. An optimal parallel algorithm for integer sorting. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 496\u2013504, 1984.","DOI":"10.1109\/SFCS.1985.9"},{"issue":"7","key":"406442_CR20","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s002360050061","volume":"33","author":"S. Saxena","year":"1996","unstructured":"S. Saxena. Parallel integer sorting and simulation amongst CRCW models. Acta Informatica, 33(7):607\u2013619, 1996.","journal-title":"Acta Informatica"},{"issue":"1","key":"406442_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01185406","volume":"32","author":"R. Vaidyanathan","year":"1995","unstructured":"R. Vaidyanathan, C. Hartmann, and P. Varshney. Parallel integer sorting using small operations. Acta Informatica, 32(1):79\u201392, 1995.","journal-title":"Acta Informatica"},{"key":"406442_CR22","unstructured":"R. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In Proceedings of the International Conference on Parallel Processing, pp. 924\u2013930. Illinois, 1986."},{"issue":"3","key":"406442_CR23","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/227717.227725","volume":"31","author":"S. Wang","year":"1996","unstructured":"S. Wang. A new sort algorithm: Self-index sort. ACM SIGPLAN Notices, 31(3):28\u201336, 1996.","journal-title":"ACM SIGPLAN Notices"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015365901501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015365901501\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015365901501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:24:02Z","timestamp":1754630642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015365901501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["406442"],"URL":"https:\/\/doi.org\/10.1023\/a:1015365901501","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}