{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:11:10Z","timestamp":1735017070007,"version":"3.32.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1007\/bf01185406","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:53:39Z","timestamp":1108731219000},"page":"79-92","source":"Crossref","is-referenced-by-count":1,"title":["Parallel integer sorting using small operations"],"prefix":"10.1007","volume":"32","author":[{"given":"Ramachandran","family":"Vaidyanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos R. P.","family":"Hartmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod K.","family":"Varshney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01185406_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974"},{"issue":"1","key":"BF01185406_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Sorting inc logn parallel steps. Combinatorica3(1), 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"BF01185406_CR3","unstructured":"Albers, S., Hagerup, T.: Improved parallel integers sorting without concurrent writing. Proc. 3rd ACMSIAM Symposium on Discrete Algorithms, pp. 463\u2013472 (1992)"},{"key":"BF01185406_CR4","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BFb0040376","volume-title":"Proc. 3rd Aegean Workshop on Comput","author":"R.J. Anderson","year":"1988","unstructured":"Anderson, R.J., Miller, G.L.: Deterministic parallel list ranking. Proc. 3rd Aegean Workshop on Comput. (Lect. Notes Comput. Sci. vol. 319, pp. 81\u201390) Berlin, Heidelberg, New York: Springer 1988"},{"key":"BF01185406_CR5","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":"Bhatt, P.C.P., Diks, K., Hagerup, T., Prasad, V.C., Radzik, T., Saxena, S.: Improved deterministic parallel integer sorting. Inf. Comput.94, 29\u201347 (1991)","journal-title":"Inf. Comput."},{"key":"BF01185406_CR6","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"Cole, R.: Parallel Merge Sort. SIAM J. Comput.17, 770\u2013785 (1988)","journal-title":"SIAM J. Comput."},{"key":"BF01185406_CR7","doi-asserted-by":"crossref","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.15, 87\u201397 (1986)","journal-title":"SIAM J. Comput."},{"key":"BF01185406_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","volume":"75","author":"T. Hagerup","year":"1987","unstructured":"Hagerup, T.: Towards optimal parallel bucket sorting. Inf. Comput.75, 39\u201351 (1987)","journal-title":"Inf. Comput."},{"key":"BF01185406_CR9","doi-asserted-by":"crossref","unstructured":"Hagerup, T.: Constant time parallel integer sorting. Proc. 23rd Annual ACM Symposium on Theory of Computing, pp. 299\u2013306 (1991)","DOI":"10.1145\/103418.103452"},{"key":"BF01185406_CR10","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","volume":"34","author":"C. P. Kruskal","year":"1985","unstructured":"Kruskal, C. P., Rudolph, L., Snir, M.: The power of parallel prefix. IEEE Trans. Comput.34, 965\u2013968 (1985)","journal-title":"IEEE Trans. Comput"},{"key":"BF01185406_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"34","author":"T. Leighton","year":"1985","unstructured":"Leighton, T.: Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput.34, 344\u2013354 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"BF01185406_CR12","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0196-6774(91)90034-V","volume":"12","author":"Y. Mathias","year":"1991","unstructured":"Mathias, Y., Vishkin, U.: On parallel hashing and integer sorting. J. Algorithms.12, 573\u2013606 (1991)","journal-title":"J. Algorithms"},{"key":"BF01185406_CR13","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S. Rajasekaran","year":"1989","unstructured":"Rajasekaran, S., Reif, J.H.: Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput.18, 594\u2013607 (1989)","journal-title":"SIAM J. Comput."},{"key":"BF01185406_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01178563","volume":"29","author":"S. Rajasekaran","year":"1992","unstructured":"Rajasekaran, S., Sen, S.: On parallel integer sorting. Acta Inf.29, 1\u201315 (1992)","journal-title":"Acta Inf."},{"key":"BF01185406_CR15","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: An optimal parallel algorithm for integer sorting. Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 496\u2013504 (1984)","DOI":"10.1109\/SFCS.1985.9"},{"key":"BF01185406_CR16","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","volume":"32","author":"C.D. Thompson","year":"1983","unstructured":"Thompson, C.D.: The VLSI complexity of sorting. IEEE Trans. Comput.32, 1171\u20131184 (1983)","journal-title":"IEEE Trans. Comput."},{"key":"BF01185406_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(92)90240-V","volume":"42","author":"R. Vaidyanathan","year":"1992","unstructured":"Vaidyanathan, R.: Sorting on PRAMs with reconfigurable buses. Inf. Process. Lett.42, 203\u2013208 (1992)","journal-title":"Inf. Process. Lett."},{"key":"BF01185406_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(93)90193-D","volume":"46","author":"R. Vaidyanathan","year":"1993","unstructured":"Vaidyanathan, R., Hartmann, C.R.P., Varshney, P.K.: Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors. Inf. Process. Lett.46, 31\u201336 (1993)","journal-title":"Inf. Process. Lett."},{"key":"BF01185406_CR19","doi-asserted-by":"crossref","unstructured":"Vaidyanathan, R., Hartmann, C.R.P., Varshney, P.K.: Towards optimal parallel radix sorting. Proc. 7th Int. Parallel Proc. Symposium, p. 193\u2013197 (1993)","DOI":"10.1109\/IPPS.1993.262880"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185406.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185406\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:27:34Z","timestamp":1734956854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["BF01185406"],"URL":"https:\/\/doi.org\/10.1007\/bf01185406","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}