{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:28Z","timestamp":1725467908895},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040412","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"456-464","source":"Crossref","is-referenced-by-count":3,"title":["Cubesort: An optimal sorting algorithm for feasible parallel computers"],"prefix":"10.1007","author":[{"given":"R.","family":"Cypher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. L. C.","family":"Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"A. Aggarwal, Unpublished manuscript, 1986."},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Komlos, E. Szemeredi, \"An O(n log n) Sorting Network\", Proc. 15th Annual Symposium on Theory of Computing, 1983, pp. 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"K.E. Batcher, \"Sorting Networks and their Applications\", 1968 AFIPS Conference Proceedings, pp. 307\u2013314.","DOI":"10.1145\/1468075.1468121"},{"issue":"1","key":"45_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, D. Stevenson, \"Optimal Sorting Algorithms for Parallel Computers\", IEEE Transactions on Computers, vol. c-27, no. 1, January 1978, pp. 84\u201387.","journal-title":"IEEE Transactions on Computers"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"A. Borodin, J.E. Hopcroft, \"Routing, Merging and Sorting on Parallel Models of Computation\", Proc. 14th Annual Symposium on Theory of Computing, 1982, pp. 338\u2013344.","DOI":"10.1145\/800070.802209"},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/62.322423","volume":"31","author":"A. Gottlieb","year":"1984","unstructured":"A. Gottlieb, C.P. Kruskal, \"Complexity Results for Permuting Data and Other Computations on Parallel Processors\", Journal of the ACM, vol. 31, no. 2, April 1984, pp. 193\u2013209.","journal-title":"Journal of the ACM"},{"key":"45_CR7","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth, \"The Art of Computer Programming, Vol. 3: Sorting and Searching\", Addison-Wesley, Reading, MA, 1973."},{"issue":"4","key":"45_CR8","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"c-34","author":"T. Leighton","year":"1985","unstructured":"T. Leighton, \"Tight Bounds on the Complexity of Parallel Sorting\", IEEE Transactions on Computers, vol. c-34, no. 4, April 1985, pp. 344\u2013354.","journal-title":"IEEE Transactions on Computers"},{"key":"45_CR9","unstructured":"T. Leighton, Personal communication.."},{"issue":"2","key":"45_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"c-30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi, S. Sahni, \"Data Broadcasting in SIMD Computers\", IEEE Transactions on Computers, vol. c-30, no. 2, February 1981, pp. 101\u2013107.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"45_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"F.P. Preparata, J. Vuillemin, \"The Cube-Connected Cycles: A Versatile Network for Parallel Computation\", Communications of the ACM, vol. 24, no. 5, May 1981, pp. 300\u2013309.","journal-title":"Communications of the ACM"},{"issue":"2","key":"45_CR12","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 with the Perfect Shuffle\", IEEE Transactions on Computers, vol. c-20, no. 2, February 1971, pp. 153\u2013161.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040412.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:24Z","timestamp":1607550024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0040412","relation":{},"subject":[]}}