{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T05:04:39Z","timestamp":1698123879021},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0022-0000(92)90030-m","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"340-366","source":"Crossref","is-referenced-by-count":11,"title":["Embedding grids into hypercubes"],"prefix":"10.1016","volume":"45","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":"78","reference":[{"issue":"No. 9","key":"10.1016\/0022-0000(92)90030-M_BIB1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","article-title":"On embedding rectangular grids in square grids","volume":"C-31","author":"Aleliunas","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(92)90030-M_BIB2","series-title":"Proceedings, 27th Annual IEEEE Symp. Foundations of Computer Sci.","first-page":"274","article-title":"Optimal simulation of tree machines","author":"Bhatt","year":"1986"},{"key":"10.1016\/0022-0000(92)90030-M_BIB3","article-title":"Embeddings of Communication Trees and Grids into Hypercubes","author":"Brandenburg","year":"1985","journal-title":"Intel Scientific Computers Report No. 280182-001"},{"key":"10.1016\/0022-0000(92)90030-M_BIB4_1","doi-asserted-by":"crossref","unstructured":"M. Y. Chan and F. Y. L. Chin, On embedding rectangular grids in hypercubes, IEEE Trans. Comput., to appear","DOI":"10.1109\/12.5991"},{"key":"10.1016\/0022-0000(92)90030-M_BIB4_2","author":"Chan","year":"1987"},{"issue":"No. 5","key":"10.1016\/0022-0000(92)90030-M_BIB5","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1137\/0220052","article-title":"Embedding of grids into optimal hypercubes","volume":"20","author":"Chan","year":"1991","journal-title":"SIAM J. Computing"},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90030-M_BIB6","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0214013","article-title":"Polynomial algorithms for the min-cut linear arrangement problem on degree restricted trees","volume":"14","author":"Chung","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90030-M_BIB7","doi-asserted-by":"crossref","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90030-M_BIB8","series-title":"Proceedings, 3rd Aegean Workshop on Computing","first-page":"181","article-title":"Embedding rectangular grids into square grids","author":"Ellis","year":"1988"},{"key":"10.1016\/0022-0000(92)90030-M_BIB9","article-title":"Optimum Expansion Embeddings of Meshes in Hypercube","author":"Greenberg","year":"1990"},{"key":"10.1016\/0022-0000(92)90030-M_BIB10","series-title":"Proceedings, 19th Annual ACM Symp. Theory of Computing","article-title":"Reconfiguring a hypercube in the presence of faults","author":"Hastad","year":"1987"},{"key":"10.1016\/0022-0000(92)90030-M_BIB11","unstructured":"C.-T. Ho and S. L. Johnson, On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two, in \u201cProceedings, 1987 International Conference on Parallel Processing,\u201d pp. 188\u2013191."},{"key":"10.1016\/0022-0000(92)90030-M_BIB12","article-title":"Basic Linear Algebra Computations on Hypercube Architectures","author":"Johnson","year":"1985","journal-title":"Yale University technical report"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90030-M_BIB13","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","article-title":"A scheme for fast parallel communication","volume":"11","author":"Valiant","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290030M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290030M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:37Z","timestamp":1550325457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290030M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["002200009290030M"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90030-m","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}