{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:02Z","timestamp":1725467882893},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040388","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T20:03:50Z","timestamp":1154549030000},"page":"201-211","source":"Crossref","is-referenced-by-count":11,"title":["Embedding grids into hypercubes"],"prefix":"10.1007","author":[{"given":"Said","family":"Bettayeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zevi","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"21_CR1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","volume":"C-31","author":"R. Aleliunas","year":"1982","unstructured":"R. Aleliunas and A. L. Rosenberg, \u201dOn Embedding Rectangular Grids in Square Grids\u201d, IEEE Trans. on Computers, C-31, 9 (1982), pp. 907\u2013913.","journal-title":"IEEE Trans. on Computers"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg, \u201dOptimal Simulation of Tree Machines\u201d, Proc. 27th Annual IEEE Symp. Foundations of Computer Sci., Oct. 1986, pp. 274\u2013282.","DOI":"10.1109\/SFCS.1986.38"},{"key":"21_CR3","unstructured":"J. E. Brandenburg and D. S. Scott, \u201dEmbeddings of Communication Trees and Grids into Hypercubes\u201d, Intel Scientific Computers Report #280182-001, 1985."},{"key":"21_CR4","unstructured":"M. Y. Chan and F. Y. L. Chin, \u201dOn Embedding Rectangular Grids in Hypercubes\u201d, to appear in IEEE Trans. on Computers. (Tech. Report TR-B2-87, February, 1987, Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong)"},{"key":"21_CR5","unstructured":"M. Y. Chan, \u201d Dilation 2 Embedding of Grids into Hypercubes\u201d, Technical Report, University of Texas at Dallas, Computer Science Program, 1988."},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/0214013","volume":"14","author":"M.-J. Chung","year":"1985","unstructured":"M.-J. Chung, F. Makedon, I. H. Sudborough and J. Turner, \u201dPolynomial Algorithms for the Min-Cut Linear Arrangement Problem on Degree Restricted Trees\u201d, SIAM J. Computing 14,1 (1985), pp. 158\u2013177.","journal-title":"SIAM J. Computing"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"J. A. Ellis, \u201dEmbedding Rectangular grids into Square Grids\u201d, Proc. of Aegean Workshop On Computing, Corfu, Greece 1988.","DOI":"10.1007\/BFb0040386"},{"key":"21_CR8","unstructured":"W. Feller, \u201dAn Introduction to Probability Theory and Its Applications\u201d"},{"key":"21_CR9","unstructured":"D. S. Greenberg, \u201dOptimum Expansion Embeddings of Meshes in Hypercube\u201d, Technical Report YALEU\/CSD\/RR-535, Yale University, Dept. of Computer Science."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"J. Hastad, T. Leighton, and M. Newman, \u201dReconfiguring a Hypercube in the Presence of Faults\u201d, Proc. 19th Annual ACM Symp. Theory of Computing, May 25\u201327, 1987.","DOI":"10.1145\/28395.28425"},{"key":"21_CR11","unstructured":"Ching-Tien Ho and S. Lennart Johnson, \u201dOn the Embedding of Arbitrary Meshes in Boolean Cubes with Expansion Two Dilation Two\u201d, Proc. 1987 International Conference on Parallel Processing, pp. 188\u2013191."},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M. Yannakakis","year":"1985","unstructured":"M. Yannakakis, \u201dA Polynomial Algorithm for the Min Cut Linear Arrangement of Trees\u201d, J. ACM, 32,4 (1985), pp. 950\u2013959.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040388.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:40:18Z","timestamp":1607532018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0040388","relation":{},"subject":[]}}