{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:17Z","timestamp":1725663857818},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558958"},{"type":"electronic","value":"9783540473060"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55895-0_397","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:44:10Z","timestamp":1330235050000},"page":"49-54","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized shuffle-exchange networks"],"prefix":"10.1007","author":[{"given":"Hans","family":"Munthe-Kaas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"7_CR1","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V. E. Bene\u0161","year":"1965","unstructured":"Bene\u0161 V.E., Mathematical Theory of Connecting Networks and Telephone Traffic, New York: Academic Press 1965."},{"key":"7_CR2","unstructured":"Bermond J-C., Peyrat C.: The deBruijn and Kautz Networks: A Competiton for the Hypercube?. in Proc. of Hypercube and Distributed Computers, 1989, pp. 279\u2013291."},{"key":"7_CR3","unstructured":"Fredricksen H.: Lechtures on Recursion, unpublished lechture notes, University of Bergen, 1970."},{"key":"7_CR4","volume-title":"Shift Register Sequences","author":"S. W. Golomb","year":"1967","unstructured":"Golomb S.W.: Shift Register Sequences, Holden-Day, San Francisco 1967 (224 pp.)."},{"key":"7_CR5","first-page":"187","volume":"17","author":"J. Guckenheimer","year":"1979","unstructured":"Guckenheimer J.: A Brief Introduction to Dynamical Systems, Lectures in Appl. Math. Vol. 17, pp.187\u2013253, 1979.","journal-title":"Lectures in Appl. Math."},{"issue":"no.2","key":"7_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/12.2159","volume":"37","author":"S-T. Huang","year":"1988","unstructured":"Huang S-T., Tripathi S.K.: Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags, IEEE Trans. Comput., vol. 37, pp. 251\u2013256, no. 2 Feb. 1988.","journal-title":"IEEE Trans. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0022-0000(83)90005-3","volume":"26","author":"A. Kleitman","year":"1983","unstructured":"Kleitman A., Leighton F.T., Lepley M., Miller G.L.: An Asymptotically Optimal Layout for the Shuffle-Exchange Graph, J. of Computer and Systems Sciences 26, 339\u2013361 (1983).","journal-title":"J. of Computer and Systems Sciences"},{"key":"7_CR8","volume-title":"Introduction to Parallel Algorithms and Architectures","author":"F. T. Leighton","year":"1992","unstructured":"Leighton F.T.: Introduction to Parallel Algorithms and Architectures, Morgan Kaufman Publ., San Mateo, Calif. 1992. (831 pp)."},{"issue":"no.7","key":"7_CR9","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1978.1675164","volume":"C-27","author":"J. Lenfant","year":"1978","unstructured":"Lenfant J.: Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations, IEEE Trans. Comput., vol. C-27,pp. 637\u2013647, no. 7 July 1978.","journal-title":"IEEE Trans. Comput."},{"key":"7_CR10","unstructured":"Munthe-Kaas H.: Practical Parallel Permutation Procedures, to appear."},{"key":"7_CR11","unstructured":"Munthe-Kaas H.: Generalized Shuffle Exchange Networks, Dept. of Informatics, Univ. of Bergen, Rep. no. 61, June 1992, ISSN 0333-3590."},{"issue":"no.5","key":"7_CR12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/TC.1981.1675791","volume":"C-30","author":"D. Nassimi","year":"1981","unstructured":"Nassimi D., Sahni S.: A Self-Routing Benes Network and Parallel Permutation Algorithms, IEEE Trans. Comput., vol. C-30,pp. 332\u2013340, no. 5 May 1981.","journal-title":"IEEE Trans. Comput."},{"issue":"no.3","key":"7_CR13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","volume":"C-29","author":"S. D. Parker","year":"1980","unstructured":"Parker S.D.: Notes on Shuffle\/Exchange-Type Switching Networks, IEEE Trans. Comput., vol. C-29,pp. 213\u2013222, no. 3 March 1980.","journal-title":"IEEE Trans. Comput."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pradhan D.K., Samtham M.R.: The deBruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI, IEEE trans. on comput. 38 (1989).","DOI":"10.1109\/12.21149"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Pradhan D.K., Kodandapani K.L: A uniform Representation of Single and Multistage Interconnection Networks Used in SIMD Machines, IEEE trans. on Comp., vol. C-29, no. 9, 1980.","DOI":"10.1109\/TC.1980.1675677"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Preparata F.P., Vuillemin J.: The Cube-Connected Cycles: A versatile network for parallel computation, Comm. ACM vol. 24 no. 5, 1981.","DOI":"10.1145\/358645.358660"},{"key":"7_CR17","volume-title":"mimeograph","author":"E. S. Selmer","year":"1966","unstructured":"Selmer E.S.: Linear Rercurrence Relations over Finite Fields, (mimeograph) Dept. of Mathematics University of Bergen, Norway, 1966, (212 pp.)."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Siegel H.J.: The Theory Underlying the Partitioning of Permutation Networks, IEEE Trans. on Computers, vol. C-29, No. 9, 1980.","DOI":"10.1109\/TC.1980.1675678"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H. S. Stone","year":"1971","unstructured":"Stone H.S.: Parallel Processing with the Perfect Shuffle, IEEE trans. on comput. C-20, 2, (Feb 1971).","journal-title":"IEEE trans. on comput."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1090\/S0002-9947-1931-1501582-X","volume":"33","author":"M. Ward","year":"1931","unstructured":"Ward M.: The Arithmetical Theory of Linear Recurring Series Trans. Amer. Math. Soc. 33 (1931), pp. 153\u2013165.","journal-title":"Trans. Amer. Math. Soc."},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/TC.1981.1675790","volume":"C-30","author":"C. Wu","year":"1981","unstructured":"Wu C., Feng T.: The Universality of the Shuffle-Exchange Network, IEEE Trans. Comput., vol. C-30, pp. 324\u2013331, May 1981.","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 92\u2014VAPP V"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55895-0_397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:16:07Z","timestamp":1578510967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55895-0_397"}},"subtitle":["A brief summary"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558958","9783540473060"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-55895-0_397","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}