{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:54:56Z","timestamp":1649012096067},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1007\/bf01937485","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T05:58:23Z","timestamp":1122789503000},"page":"187-195","source":"Crossref","is-referenced-by-count":5,"title":["A new parallel sorting algorithm based upon min-mid-max operations"],"prefix":"10.1007","volume":"24","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":"BF01937485_CR1","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, (1982), pp. 79\u201388.","journal-title":"J. of Algorithms"},{"issue":"3","key":"BF01937485_CR2","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, Information Processing Letters 13, No. 3, Dec. 1981, pp. 103\u2013106.","journal-title":"Information Processing Letters"},{"key":"BF01937485_CR3","first-page":"307","volume":"32","author":"K. W. Batcher","year":"1968","unstructured":"K. W. Batcher,Sorting networks and their applications, AFIPS Conf. 32, (1968), pp. 307\u2013314.","journal-title":"AFIPS Conf."},{"issue":"1","key":"BF01937485_CR4","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, No. 1, Jan. 1978, pp. 84\u201387.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"BF01937485_CR5","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, (1981), pp. 142\u2013152.","journal-title":"BIT"},{"issue":"3","key":"BF01937485_CR6","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, No. 3, 1978, pp. 293\u2013314.","journal-title":"IJCIS"},{"issue":"7","key":"BF01937485_CR7","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-register loops), IEEE Trans. Comput. C-27, No. 7, July 1980, pp. 618\u2013631.","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"BF01937485_CR8","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, Oct. 1975, pp. 588\u2013591.","journal-title":"Comm. ACM"},{"issue":"3","key":"BF01937485_CR9","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, Aug. 1981, pp. 465\u2013472.","journal-title":"SIAM J. Comput."},{"issue":"8","key":"BF01937485_CR10","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, Aug. 1978, pp. 657\u2013661.","journal-title":"Comm. ACM"},{"key":"BF01937485_CR11","volume-title":"Parallel Computers","author":"R. W. Hockney","year":"1981","unstructured":"R. W. Hockney and C. R. Jesshope,Parallel Computers, Adam Hilger Ltd., Bristol (1981)."},{"key":"BF01937485_CR12","volume-title":"Sorting and Searching, Vol. 3, The Art of Computer Programming","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,Sorting and Searching, Vol. 3, The Art of Computer Programming, Addison-Wesley, Reading, MA. (1973)."},{"key":"BF01937485_CR13","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, No. 3, March 1983.","DOI":"10.1109\/TC.1983.1676217"},{"key":"BF01937485_CR14","unstructured":"D. J. Kuck,The Structure of Computers and Computations, Vol. 1, (1978), Wiley."},{"issue":"6","key":"BF01937485_CR15","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, No. 6, June 1981, pp. 396\u2013404.","journal-title":"IEEE Trans. Comput."},{"key":"BF01937485_CR16","volume-title":"Elements of Discrete Mathematics","author":"C. L. Liu","year":"1977","unstructured":"C. L. Liu,Elements of Discrete Mathematics, (1977), McGraw Hill, New York."},{"issue":"2","key":"BF01937485_CR17","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, April 1975, pp. 195\u2013201.","journal-title":"J. Assoc. Comput. Math."},{"issue":"1","key":"BF01937485_CR18","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, No. 1, Jan. 1979, pp. 2\u20137.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"BF01937485_CR19","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, July 1982, pp. 642\u2013667.","journal-title":"J. Assoc. Comput. Math."},{"key":"BF01937485_CR20","unstructured":"F. P. Preparata,Parallelism in sorting, Proc. of 1977 International Conf. on Parallel Processing, pp. 202\u2013206."},{"issue":"7","key":"BF01937485_CR21","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, No. 7, July 1978, pp. 669\u2013773.","journal-title":"IEEE Trans. Comput."},{"key":"BF01937485_CR22","doi-asserted-by":"crossref","unstructured":"R. Reischuk,A fast probabilistic parallel sorting algorithm, IEEE 1981 Symposium on Foundation of Computer Science, pp. 212\u2013219.","DOI":"10.1109\/SFCS.1981.6"},{"key":"BF01937485_CR23","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, (1981), pp. 88\u2013102.","journal-title":"J. of Algorithms"},{"key":"BF01937485_CR24","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, Feb. 1971, pp. 153\u2013161.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"BF01937485_CR25","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, No. 2, Mar. 1978, pp. 138\u2013146.","journal-title":"IEEE Trans. Software Engineering"},{"issue":"4","key":"BF01937485_CR26","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, April 1977, pp. 263\u2013271.","journal-title":"Comm. ACM"},{"issue":"5","key":"BF01937485_CR27","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, Sep. 1978, pp. 509\u2013517.","journal-title":"IBM J. Res. Develop."},{"issue":"3","key":"BF01937485_CR28","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 problems, SIAM J. Comput. 4; 3, Sep. 1975, pp. 348\u2013355.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"BF01937485_CR29","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, July 1976, pp. 566\u2013571.","journal-title":"J. Assoc. Comput. Math."},{"issue":"12","key":"BF01937485_CR30","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1109\/TC.1982.1675943","volume":"C-3","author":"H. Yasuura","year":"1982","unstructured":"H. Yasuura, N. Takagi and S. Yajima,The parallel enumeration sorting scheme for VLSI, IEEE Trans. Comput. C-3, No. 12, Dec. 1982, pp. 1192\u20131201.","journal-title":"IEEE Trans. Comput."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01937485.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01937485\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01937485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T13:16:33Z","timestamp":1586351793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01937485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["BF01937485"],"URL":"https:\/\/doi.org\/10.1007\/bf01937485","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}