{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:49Z","timestamp":1725663409993},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_46","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:20:21Z","timestamp":1330212021000},"page":"32-41","source":"Crossref","is-referenced-by-count":1,"title":["Is the shuffle-exchange better than the butterfly?"],"prefix":"10.1007","author":[{"given":"Arvind","family":"Raghunathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huzur","family":"Saran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, F. Leighton, A. Rosenberg. Optimal Simulations of Tree Machines. Proc. IEEE Symp. on Found. of Comp. Science, 1986.","DOI":"10.1109\/SFCS.1986.38"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, J. Hong, F. T. Leighton, A. L. Rosenberg. Optimal Simulations by Butterfly Networks. ACM Symp. on the Theory of Computing, 1988.","DOI":"10.21236\/ADA200780"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"A. Despain and D. Patterson X-Tree \u2014 A Tree Structured Multiprocessor Architecture. 5th Symp. on Computer Architecture, 1978","DOI":"10.1145\/800094.803041"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"J. Hong, K. Mehlhorn and A. Rosenberg. Cost Tradeoffs in Graph Embeddings, with Applications. J. ACM, 1983.","DOI":"10.1145\/2157.322401"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg. Work-Preserving Emulations of Fixed-Connection Networks. ACM Symposium on Theory of Computing, 1989.","DOI":"10.21236\/ADA211915"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"B. Monien and I.H. Sudborough. Simulating Binary Trees on Hypercubes. AWOC, 1988.","DOI":"10.1007\/BFb0040385"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"F. Preparata and J. Vuillemin. The Cube-Connected Cycles: a Versatile Network for Parallel Computation Communications of the ACM, 1981.","DOI":"10.1145\/358645.358660"},{"key":"5_CR8","unstructured":"A. Rosenberg. GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions. AWOC, 1988."},{"key":"5_CR9","unstructured":"J.D. Ullman. Computational Aspects of VLSI Computer Science Press, 1984."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:52Z","timestamp":1605646612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}