{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:25Z","timestamp":1742596825563,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_244","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:07Z","timestamp":1330261747000},"page":"147-156","source":"Crossref","is-referenced-by-count":4,"title":["Mapping dynamic data and algorithm structures into product networks"],"prefix":"10.1007","author":[{"given":"Sabine R.","family":"\u00f6hring","sequence":"first","affiliation":[]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"E. Ganesan and D.K. Pradhan. The hyper-de bruijn multiprocessor networks. In Proc. 11th Conf. on Distributed Computing Systems, pp. 492\u2013499, Arlington, TX, May 1991.","DOI":"10.1109\/ICDCS.1991.148716"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"A.L. Rosenberg. Product-shuffle networks: Towards Reconciling Shuffles and Butterflies. Discrete Applied Mathematics, vol. 37\/38, July 1992.","DOI":"10.1016\/0166-218X(92)90152-Z"},{"key":"16_CR3","first-page":"270","volume-title":"Hyper petersen network: Yet another hypercube-like topology","author":"S.K. Das","year":"1992","unstructured":"S.K. Das and A.K. Banerjee. Hyper petersen network: Yet another hypercube-like topology. In Proc. 4th Symp. on the Frontiers of Massively Parallel Computation (Frontiers' 92), pp. 270\u2013277, McLean, Virginia, USA, Oct. 1992."},{"key":"16_CR4","unstructured":"S. \u00f6hring and S.K. Das. The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology. In Proc. 1993 Int. Conf. on Parallel Processing., vol. I, pp. 311\u2013314, Aug. 1993."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/0221039","volume":"21","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton, M.J. Newman, A.G. Ranade, and E.J. Schwabe. Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM Journal on Computing, 21(4):639\u2013654, Aug. 1992.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR6","unstructured":"S.K. Das and S. \u00f6hring. Embeddings ofTree-Related Topologies in Hyper Petersen Networks. Technical Report CRPDC-92-16, Univ. North Texas, Univ. Wuerzburg, Sep. 1992."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"S. \u00f6hring. Dynamic Tree Embeddings into de Bruijn Graphs. In Lecture Notes in Computer Science, vol. 634, pp. 783\u2013784. Springer, Sep. 1992.","DOI":"10.1007\/3-540-55895-0_487"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"S. \u00f6hring and S.K. Das. Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn Networks. In Proc. 7th Int. Parallel Processing Symposium, Newport Beach, CA, pp. 519\u2013523, Apr. 1993.","DOI":"10.1109\/IPPS.1993.262823"},{"key":"16_CR9","unstructured":"S. \u00f6hring and S.K. Das. The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. to appear in Proc. 1993 Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), June 1993."},{"key":"16_CR10","unstructured":"S. \u00f6hring and S.K. Das. The Folded Petersen Cube Networks: New Competitors for the Hypercube. to appear in Proc. Fifth IEEE Symp. on Par. and Dist. Computing, Dec. 1993."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","volume":"C-33","author":"L. Bhuyan","year":"1984","unstructured":"L. Bhuyan and D.P. Agrawal. Generalized Hypercubes and Hyperbus Structures for a Computer Network. IEEE Transactions on Computers, C-33:323\u2013333, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR12","unstructured":"G. Chartrand and R.J. Wilson. The Petersen Graph. Graphs and Applications (Eds. F. Harary and J.S. Maybee), pp. 69\u2013100, 1985."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"S. \u00f6hring and S.K. Das. Mapping Dynamic Data Structures on Product Networks. Technical Report CRPDC-93-5, Univ. Wuerzburg, Univ. North Texas, Mar. 1993.","DOI":"10.1007\/3-540-57568-5_244"},{"issue":"No.11","key":"16_CR14","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TC.1986.1676698","volume":"C-35","author":"T.F. Chan","year":"1986","unstructured":"T.F. Chan and Y. Saad. Multigrid Algorithms on the Hypercube Multiprocessor. In IEEE Transactions on Computers, vol. C-35, No. 11, pp. 969\u2013977, Nov. 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR15","first-page":"331","volume":"III","author":"L. S. Barasch","year":"1988","unstructured":"L. S. Barasch, S. Lakshmivarahan, and S.K. Dall. Generalized Gray Codes and Their Properties. In Proc. 3rd Int. Conf. on Supercomputing, vol. III, pp. 331\u2013337, 1988.","journal-title":"Proc. 3rd Int. Conf. on Supercomputing"},{"key":"16_CR16","unstructured":"S.N. Bhatt, F.R.K. Chung, J.-W. Hong, F.T. Leighton, B. Obren\u00edc, A.L. Rosenberg, and E.J. Schwabe. Optimal Embeddings by Butterfly-Like Networks. COINS Technical Report 90-108, Computer and Information Science Department, University of Massachusetts, 1990."},{"key":"16_CR17","unstructured":"A.L. Rosenberg. personal communication, May 1992."},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02090766","volume":"23","author":"D.S. Greenberg","year":"1990","unstructured":"D.S. Greenberg, L.S. Heath, and A.L. Rosenberg. Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. Math. Systems Theory, 23:61\u201377, 1990.","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_244.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:11:43Z","timestamp":1742595103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_244","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}