{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:03Z","timestamp":1736084403008,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015437","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"312-321","source":"Crossref","is-referenced-by-count":0,"title":["Embeddings of hyper-rings in hypercubes"],"prefix":"10.1007","author":[{"given":"Yukihiro","family":"Hamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aohan","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuaki","family":"Nishitani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihide","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"B. Aiello and F. T. Leighton, \u201cCoding theory, hypercube embedding, and fault tolerance\u201d, The 3rd Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 125\u2013136, 1991.","DOI":"10.1145\/113379.113391"},{"key":"36_CR2","unstructured":"N. Alon, A. Barak and U. Mauber, \u201cOn disseminating information reliably without broadcasting\u201d, The 7th International Conference on Distributed Computing Systems, pp. 74\u201381, 1987."},{"key":"36_CR3","first-page":"290","volume":"1","author":"T. Altman","year":"1994","unstructured":"T. Altman, Y. Igarashi and K. Obokata, \u201cHyper-ring connection machines\u201d, IEEE Region 10's 9th Annual International Conference, Vol. 1, pp. 290\u2013294, 1994.","journal-title":"IEEE Region 10's 9th Annual International Conference"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"S. N. Bhatt and J-Y. Cai, \u201cTake a walk, grow a tree\u201d, The 29th Annual Symp. on Foundations of Computer Science, pp. 469\u2013478, 1988.","DOI":"10.1109\/SFCS.1988.21963"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"S. N. Bhatt, F. R. K. Chung, J-W. Hong, F. T. Leighton and A. L. Rosenberg, \u201cOptimal simulation by butterfly networks\u201d, The 20th Annual ACM Symp. on Theory of Computing, pp. 192\u2013204, 1988.","DOI":"10.21236\/ADA200780"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"S. N. Bhatt, F. R. K. Chung, F. T. Leighton and A. L. Rosenberg, \u201cOptimal tree machines\u201d, The 27th Annual Symp. on Foundations of Computer Science, pp. 274\u2013282, 1986.","DOI":"10.1109\/SFCS.1986.38"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0221012","volume":"21","author":"S. N. Bhatt","year":"1992","unstructured":"S. N. Bhatt, F. R. K. Chung, F. T. Leighton and A. L. Rosenberg, \u201cEfficient embeddings of trees in hypercubes\u201d, SIAM J. Computing, Vol. 21, pp. 151\u2013162, 1992.","journal-title":"SIAM J. Computing"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"M. Y. Chan, \u201cEmbedding of d-dimensional grids into optimal hypercubes\u201d, The 1st Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 52\u201357, 1989.","DOI":"10.1145\/72935.72941"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0743-7315(91)90046-C","volume":"11","author":"K. Efe","year":"1991","unstructured":"K. Efe, \u201cEmbedding mesh of trees in the hypercube\u201d, J. Parallel and Distributed Computing, Vol. 11, pp. 222\u2013230, 1991.","journal-title":"J. Parallel and Distributed Computing"},{"key":"36_CR10","unstructured":"Y. Han and R. Finkel, \u201cAn optimal scheme for disseminating information\u201d, Proceedings of 1988 International Conference on Parallel Processing, pp. 198\u2013203, 1988."},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-56279-6_67","volume":"650","author":"Y. Han","year":"1992","unstructured":"Y. Han, Y. Igarashi, K. Kanai and K. Miura, \u201cFault-tolerance broadcasting in binary jumping networks\u201d, The 3rd International Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 650, pp. 145\u2013154, 1992.","journal-title":"Lecture Notes in Computer Science"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"R. Koch, F. T. Leighton, B. Maggs, S. Rao and A. L. Rosenberg, \u201cWork-preserving emulations of fixed-connected networks\u201d, The 21st Annual ACM Symp. on Theory of Computing, pp. 227\u2013240, 1989.","DOI":"10.21236\/ADA211915"},{"key":"36_CR13","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes, Morgan Kaufman Publishers, San Mateo, 1992."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, M. Newman, A. G. Ranade and E. Schwabe, \u201cDynamic tree embeddings in butterflies and hypercubes\u201d, The 1st Annual ACM Symp. on Algorithms and Architectures, pp. 224\u2013234, 1989.","DOI":"10.1145\/72935.72959"},{"key":"36_CR15","volume-title":"Technical Report","author":"M. R\u00f6ttger","year":"1994","unstructured":"M. R\u00f6ttger, U-P. Schroeder and W. Unger, \u201cEmbedding 3-dimensional grids into optimal hypercubes\u201d, Technical Report, Dept. of Mathematics and Computer Science, Univ. of Paderborn, Paderborn, Germany, 1994."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:04:32Z","timestamp":1736082272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0015437","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}