{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:36:46Z","timestamp":1648521406965},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759059","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"554-564","source":"Crossref","is-referenced-by-count":9,"title":["Parallel sorting on cayley graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Daniel M.","family":"Gordon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01759059_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, An0(n logn) sorting network, inProceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"BF01759059_CR2","unstructured":"S. B. Akers, D. Harel, and B. Krishnamurthy, The star graph: an attractive alternative to then-cube, inProceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400."},{"key":"BF01759059_CR3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks,IEEE Trans. Comput.,38 (1989), 555\u2013566.","journal-title":"IEEE Trans. Comput."},{"key":"BF01759059_CR4","doi-asserted-by":"crossref","unstructured":"M. Dowd, Y. Perl, L. Rudolph, and M. Saks, The sequential balanced sorting network, inProceedings of the Second ACM Symposium on Principles of Distributed Computing, Montreal, August 1983, pp. 161\u2013172.","DOI":"10.1145\/800221.806719"},{"key":"BF01759059_CR5","unstructured":"V. Faber and M. Fellows, Unpublished communication."},{"key":"BF01759059_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms,SIAM Rev.,24 (1982), 195\u2013221.","journal-title":"SIAM Rev."},{"key":"BF01759059_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W. H. Gates","year":"1979","unstructured":"W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal,Discrete Math. 27 (1979), 47\u201357.","journal-title":"Discrete Math."},{"key":"BF01759059_CR8","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1975","unstructured":"D. E. Knuth,The Art of Computer Programming, vol. 3, 2nd printing, Addison-Wesley, Reading, MA, 1975."},{"key":"BF01759059_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs,Combinatorial,8 (1988), 261\u2013277.","journal-title":"Combinatorial"},{"key":"BF01759059_CR10","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF01762132","volume":"3","author":"J. M. Marberg","year":"1988","unstructured":"J. M. Marberg and E. Gafni, Sorting in constant number of row and column phases on a mesh,Algorithmica,3 (1988), 561\u2013572.","journal-title":"Algorithmica"},{"key":"BF01759059_CR11","volume-title":"Combinatorial Algorithms","author":"A. Nijenhuis","year":"1978","unstructured":"A. Nijenhuis and H. S. Wilf,Combinatorial Algorithms, 2nd edition, Academic Press, New York, 1978.","edition":"2nd edition"},{"key":"BF01759059_CR12","unstructured":"I. D. Scherson, S. Sen, and A. Shamir, Shear sort: a true two-dimensional sorting technique for VLSI networks, inProceedings of the 1986 International Conference on Parallel Processing, 1986, pp. 903\u2013908."},{"key":"BF01759059_CR13","doi-asserted-by":"crossref","unstructured":"C. P. Schorr and A. Shamir, An optimal sorting algorithm for mesh connected computers, inProceedings of the 18th ACM Symposium on Theory of Computing, 1986, pp. 255\u2013261.","DOI":"10.1145\/12130.12156"},{"key":"BF01759059_CR14","unstructured":"S. G. Williamson, Unpublished communication."},{"key":"BF01759059_CR15","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S. Zaks","year":"1984","unstructured":"S. Zaks, A new algorithm for generation of permutations,BIT,24 (1984), 196\u2013204.","journal-title":"BIT"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759059.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759059\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:01Z","timestamp":1586287621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":15,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759059"],"URL":"https:\/\/doi.org\/10.1007\/bf01759059","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}