{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T00:51:34Z","timestamp":1673139094207},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf00991185","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T16:20:08Z","timestamp":1105287608000},"page":"455-467","source":"Crossref","is-referenced-by-count":4,"title":["A parallel sorting scheme whose basic operation sortsN elements"],"prefix":"10.1007","volume":"14","author":[{"given":"S. S.","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher, Sorting Networks and Their Applications,AFIPS Conf.,32:307?314 (1968).","journal-title":"AFIPS Conf."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone, Parallel Processing Perfect Shuffle,IEEE Trans. Comput.,C-20:153?161 (February 1971).","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0204022","volume":"4","author":"R. L. Drysdale","year":"1975","unstructured":"R. L. Drysdale and F. H. Young, Improved Divide\/Sort\/Merge Sorting Network,SIAM J. Comput.,4(3):264?270 (September 1975).","journal-title":"SIAM J. Comput."},{"issue":"10","key":"CR4","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/361020.361216","volume":"18","author":"F. Gavril","year":"1975","unstructured":"F. Gavril, Merging with Parallel Processors,Comm. ACM,18(10):588?591 (October 1975).","journal-title":"Comm. ACM"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","volume":"22","author":"D. E. Muller","year":"1975","unstructured":"D. E. Muller and F. P. Preparata, Bounds to Complexities of Networks for Sorting and for Switching,J. Assoc. Comput. Math.,22(2):195?201 (April 1975).","journal-title":"J. Assoc. Comput. Math."},{"issue":"3","key":"CR6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant, Parallelism in Comparison ProblemsSIAM J. Comput.,4 (3):348?355 (September 1975).","journal-title":"SIAM J. Comput."},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/321958.321976","volume":"23","author":"A. C. Yao","year":"1976","unstructured":"A. C. Yao and F. F. Yao, Lower Bounds on Merging Networks,J. Assoc. Comput. Math.,23(3):566?571 (July 1976).","journal-title":"J. Assoc. Comput. Math."},{"key":"CR8","unstructured":"F. P. Preparata, Parallelism in Sorting,Proc. of Intl. Conf. on Parallel Processing, pp. 202?206."},{"issue":"4","key":"CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C. D. Thompson","year":"1977","unstructured":"C. D. Thompson and H. T. Kung, Sorting on a Mesh-Connected Parallel Computer,Comm. ACM,20(4):263?271 (April 1977).","journal-title":"Comm. ACM"},{"issue":"3","key":"CR10","first-page":"293","volume":"7","author":"T. C. Chen","year":"1978","unstructured":"T. C. Chen, K. P. Eswaran, V. Y. Lum, and C. Tung, Simplified Odd-Even Sort Using Multiple Shift-Register Loops,IJCIS,7(3):293?314 (1978).","journal-title":"IJCIS"},{"issue":"8","key":"CR11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","volume":"21","author":"D. S. Hirschberg","year":"1978","unstructured":"D. S. Hirschberg, Fast Parallel Sorting Algorithms,Comm. ACM,21(8):657?661 (August 1978).","journal-title":"Comm. ACM"},{"issue":"7","key":"CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","volume":"C-27","author":"F. P. Preparata","year":"1978","unstructured":"F. P. Preparata, New Parallel Sorting Schemes,IEEE Trans. Comput.,C-27(7):669?773 (July 1978).","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","volume":"C-27","author":"G. Baudet","year":"1978","unstructured":"G. Baudet and D. Stevenson, Optimal Sorting Algorithms for Parallel Computers,IEEE Trans. Comput.,C-27(1):84?87 (January 1978).","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TSE.1978.231484","volume":"SE-4","author":"H. S. Stone","year":"1978","unstructured":"H. S. Stone, Sorting on STAR,IEEE Trans. Software Engineering,SE-4, (2):138?146 (March 1978).","journal-title":"IEEE Trans. Software Engineering"},{"issue":"5","key":"CR15","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1147\/rd.225.0509","volume":"22","author":"S. Todd","year":"1978","unstructured":"S. Todd, Algorithm and Hardware for a Merge Sort Using Multiple Processors,IBM J. Res. Develop.,22(5):509?517 (September 1978).","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","volume":"C-27","author":"D. Nassimi","year":"1979","unstructured":"D. Nassimi and S. Sahni, Bitonic Sort on a Mesh-Connected Parallel Computer,IEEE Trans. Comput.,C-27(1):2?7 (January 1979).","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"CR17","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TC.1980.1675633","volume":"C-27","author":"F. Y. Chin","year":"1980","unstructured":"F. Y. Chin and K. S. Fok, Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Refister Loops),IEEE Trans. Comput.,C-27(7):618?631 (July 1980).","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(81)90119-8","volume":"13","author":"H. Barlow","year":"1981","unstructured":"H. Barlow, D. J. Evans and J. Shanehchi, A Parallel Merging Algorithm,Infor. Proc. Letters, Vol.13(3):103?106 (December 1981).","journal-title":"Infor. Proc. Letters"},{"issue":"3","key":"CR19","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0210034","volume":"10","author":"R. Haggkvist","year":"1981","unstructured":"R. Haggkvist and P. Hell, Parallel Sorting with Constant Time for Comparisons,SIAM J. COMPUT.,10(3):465?472 (August 1981).","journal-title":"SIAM J. COMPUT."},{"issue":"6","key":"CR20","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1981.1675805","volume":"C-27","author":"D. T. Lee","year":"1981","unstructured":"D. T. Lee, H. Chang and C. K. Wong, An On-Chip Compare\/Steer Bubble Sorter,IEEE Trans. Comput.,C-27, (6):396?404 (June 1981).","journal-title":"IEEE Trans. Comput."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the Maximum, Merging, and Sorting in a Parallel Computation Model,J. of Algorithms 2:88?102 (1981).","journal-title":"J. of Algorithms"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(82)90010-4","volume":"3","author":"M. Aigner","year":"1982","unstructured":"M. Aigner, Parallel Complexity of Sorting Problems,J. of Algorithms 3:79?88 (1982).","journal-title":"J. of Algorithms"},{"issue":"3","key":"CR23","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","volume":"29","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni, Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network,J. Assoc. Comput. Math.,29(3):642?667 (July 1982).","journal-title":"J. Assoc. Comput. Math."},{"issue":"12","key":"CR24","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1109\/TC.1982.1675943","volume":"C-31","author":"H. Yasuura","year":"1982","unstructured":"H. Yasuura, N. Takagi, and S. Yajima, The Parallel Enumeration Sorting Scheme for VLSI,IEEE Trans. Comput.,C-31(12):1192?1201 (December 1982).","journal-title":"IEEE Trans. Comput."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"M. Kumar and D. S. Hirschberg, An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes,IEEE Trans. Comput.,C-32(3) (March 1983).","DOI":"10.1109\/TC.1983.1676217"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01937485","volume":"24","author":"S. S. Tseng","year":"1984","unstructured":"S. S. Tseng and R. C. T. Lee, A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations,BIT,24:187?195 (1984).","journal-title":"BIT"},{"key":"CR27","volume-title":"Ph. D. Dissertation","author":"S. S. Tseng","year":"1984","unstructured":"S. S. Tseng,Parallel Sorting Algorithms, Ph. D. Dissertation, National Chiao Tung University, Hsinchu, Taiwan, Republic of China (May 1984)."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"R. Reischuk, A Fast Probabilistic Parallel Sorting Algorithm,IEEE Symp. on Found. of Comput. Sci., pp. 212?219 (1981).","DOI":"10.1109\/SFCS.1981.6"},{"issue":"2","key":"CR29","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01933158","volume":"21","author":"H. K. Brock","year":"1981","unstructured":"H. K. Brock, B. J. Brooks, and F. Sullivan, Diamond, a Sorting Method for Vector Machines,BIT,21(2):142?152 (1981).","journal-title":"BIT"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991185.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00991185\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T08:10:12Z","timestamp":1586074212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00991185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF00991185"],"URL":"https:\/\/doi.org\/10.1007\/bf00991185","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}