{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:15:28Z","timestamp":1648667728010},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf01184936","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T13:06:57Z","timestamp":1108732017000},"page":"491-508","source":"Crossref","is-referenced-by-count":2,"title":["A lower bound for sorting networks based on the shuffle permutation"],"prefix":"10.1007","volume":"27","author":[{"given":"C. G.","family":"Plaxton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Suel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di. Sorting inc logn parallel steps.Combinatorica, 3:1?19, 1983.","journal-title":"Combinatorica"},{"key":"CR2","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher. Sorting networks and their applications.Proceedings of the AFIPS Spring Joint Computer Conference, vol. 32, pages 307?314, 1968.","journal-title":"Proceedings of the AFIPS Spring Joint Computer Conference"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0222006","volume":"22","author":"R. E. Cypher","year":"1993","unstructured":"R. E. Cypher. A lower bound on the size of Shellsort sorting networks.SIAM Journal on Computing, 22:62?71, February 1993.","journal-title":"SIAM Journal on Computing"},{"key":"CR4","first-page":"58","volume":"22","author":"R. E. Cypher","year":"1993","unstructured":"R. E. Cypher. Theoretical aspects of VLSI pin limitations.SIAM Journal on Computing, 22: 58?63, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"CR5","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth.The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, MA, 1973."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(86)90084-8","volume":"48","author":"C. P. Kruskal","year":"1986","unstructured":"C. P. Kruskal and M. Snir. A unified theory of interconnection network structure.Theoretical Computer Science, 48:75?94, 1986.","journal-title":"Theoretical Computer Science"},{"key":"CR7","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes","author":"F. T. Leighton","year":"1991","unstructured":"F. T. Leighton.Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan-Kaufinann, San Mateo, CA, 1991."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"F. T. Leighton and C. G. Plaxton. A (fairly) simple circuit that (usually) sorts.Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 264?274, October 1990.","DOI":"10.1109\/FSCS.1990.89545"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0195-6698(89)80030-7","volume":"10","author":"N. Linial","year":"1989","unstructured":"N. Linial and M. Tarsi. Interpolation between bases and the shuffle exchange network.European Journal of Combinatorics, 10:29?39, 1989.","journal-title":"European Journal of Combinatorics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","volume":"29","author":"D. Parker","year":"1980","unstructured":"D. Parker. Notes on shuffle\/exchange-type switching networks.IEEE Transactions on Computers, 29:213?222, 1980.","journal-title":"IEEE Transactions on Computers"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01840378","volume":"5","author":"M. S. Paterson","year":"1990","unstructured":"M. S. Paterson. Improved sorting networks with O(logN) depth.Algorithmica, 5:75?92, 1990.","journal-title":"Algorithmica"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"C. G. Plaxton. A hypercubic sorting network with nearly logarithmic depth.Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 405?416, May 1992.","DOI":"10.1145\/129712.129751"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"C. G. Plaxton, B. Poonen, and T. Suel. Improved lower bounds for Shellsort.Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 226?235, October 1992.","DOI":"10.1109\/SFCS.1992.267769"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/26.7531","volume":"36","author":"A. Varma","year":"1988","unstructured":"A. Varma and C. S. Raghavendra. Rearrangeability of multistage shuffle\/exchange networks.IEEE Transactions on Communications, 36:1138?1147, 1988.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01184936.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01184936\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01184936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:23Z","timestamp":1556728883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01184936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01184936"],"URL":"https:\/\/doi.org\/10.1007\/bf01184936","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}