{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T19:50:51Z","timestamp":1773863451086,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0890-5401(91)90031-v","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"29-47","source":"Crossref","is-referenced-by-count":52,"title":["Improved deterministic parallel integer sorting"],"prefix":"10.1016","volume":"94","author":[{"given":"P.C.P.","family":"Bhatt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.C.","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90031-V_BIB1","series-title":"Proceedings, 3rd Aegean Workshop on Computing","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1988"},{"key":"10.1016\/0890-5401(91)90031-V_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90031-V_BIB3","series-title":"Proceedings, 13th Symposium on Mathematical Foundations of Computer Science","first-page":"231","article-title":"Efficient simulations between concurrent-read concurrent-write PRAM models","volume":"Vol. 324","author":"Chlebus","year":"1988"},{"key":"10.1016\/0890-5401(91)90031-V_BIB4","series-title":"Proceedings, 7th International Conference on Fundamentals of Computation Theory","first-page":"95","article-title":"New simulations between CRCW PRAMs","volume":"Vol. 380","author":"Chlebus","year":"1989"},{"key":"10.1016\/0890-5401(91)90031-V_BIB5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90031-V_BIB6","series-title":"Proceedings, 27th Annual Symposium on Foundations of Computer Science","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree, and graph problems","author":"Cole","year":"1986"},{"key":"10.1016\/0890-5401(91)90031-V_BIB7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90031-V_BIB8","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90031-V_BIB9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","article-title":"Parallel algorithmic techniques for combinatorial computation","volume":"3","author":"Eppstein","year":"1988","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90031-V_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01762109","article-title":"Simulations among concurrent-write PRAMs","volume":"3","author":"Fich","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0890-5401(91)90031-V_BIB11","series-title":"Proceedings, 10th Annual ACM Symposium on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0890-5401(91)90031-V_BIB12","series-title":"Proceedings, 22th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"BLASTING through the information theoretic barrier with FUSION TREES","author":"Fredman","year":"1990"},{"key":"10.1016\/0890-5401(91)90031-V_BIB13","series-title":"Proceedings, 28th Annual Symposium on Foundations of Computer Science","first-page":"89","article-title":"Incomparability in parallel computation","author":"Grolmusz","year":"1987"},{"key":"10.1016\/0890-5401(91)90031-V_BIB14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","article-title":"Towards optimal parallel bucket sorting","volume":"75","author":"Hagerup","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90031-V_BIB15","series-title":"Proceedings, 16th International Colloquium on Automata, Languages and Programming","first-page":"439","article-title":"Parallel retrieval of scattered information","volume":"Vol. 372","author":"Hagerup","year":"1989"},{"key":"10.1016\/0890-5401(91)90031-V_BIB16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0890-5401(90)90034-F","article-title":"Optimal parallel algorithms on planar graphs","volume":"84","author":"Hagerup","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90031-V_BIB17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(83)90023-3","article-title":"Upper bounds for sorting integers on random access machines","volume":"28","author":"Kirkpatrick","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90031-V_BIB18","author":"Knuth","year":"1973"},{"key":"10.1016\/0890-5401(91)90031-V_BIB19","series-title":"Proceedings, 17th International Colloquium on Automata, Languages and Programming","first-page":"729","article-title":"On parallel hashing and integer sorting","volume":"Vol. 443","author":"Matias","year":"1990"},{"key":"10.1016\/0890-5401(91)90031-V_BIB20","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0032070","article-title":"On Parallel Hashing and Integer Sorting","author":"Matias","year":"1990"},{"key":"10.1016\/0890-5401(91)90031-V_BIB21","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","article-title":"Optimal and sublogarithmic time randomized parallel sorting algorithms","volume":"18","author":"Rajasekaran","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90031-V_BIB22","series-title":"Proceedings, 10th Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"161","article-title":"The power of collision: Randomized parallel algorithms for chaining and integer sorting","volume":"Vol. 472","author":"Raman","year":"1990"},{"issue":"1","key":"10.1016\/0890-5401(91)90031-V_BIB23","first-page":"28","article-title":"Parallel sorting\u2014A bibliography","volume":"18","author":"Richards","year":"1986","journal-title":"SIGACT News"},{"key":"10.1016\/0890-5401(91)90031-V_BIB24","series-title":"Proceedings, 8th Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"143","article-title":"On parallel sorting and addition with concurrent writes","volume":"Vol. 338","author":"Saxena","year":"1988"},{"key":"10.1016\/0890-5401(91)90031-V_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(88)90039-9","article-title":"Optimal parallel randomized algorithms for sparse addition and identification","volume":"76","author":"Spirakis","year":"1988","journal-title":"Inform. and Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190031V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190031V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:25:18Z","timestamp":1549027518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190031V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["089054019190031V"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90031-v","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}