{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:44:13Z","timestamp":1763534653276},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6682,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00197-q","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"333-339","source":"Crossref","is-referenced-by-count":33,"title":["On the k-ary hypercube"],"prefix":"10.1016","volume":"140","author":[{"given":"Sa\u00efd","family":"Bettayeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/0304-3975(94)00197-Q_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\/0304-3975(94)00197-Q_BIB2","first-page":"307","article-title":"Sorting networks and their applications","volume":"Vol. 32","author":"Batcher","year":"1968"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0022-0000(92)90030-M","article-title":"Embedding grids into hypercubes","volume":"45","author":"Bettayeb","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00197-Q_BIB4","series-title":"Proc. 27th Ann. IEEE Symp. Foundations of Computer Sci.","first-page":"274","article-title":"Optimal simulation of tree machines","author":"Bhatt","year":"1986"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB5","article-title":"How to embed trees in hypercubes","author":"Bhatt","year":"1985"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB6","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\/0304-3975(94)00197-Q_BIB7","series-title":"Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures","first-page":"52","article-title":"Dilation 2 embedding of grids into hypercubes","author":"Chan","year":"1989"},{"issue":"1","key":"10.1016\/0304-3975(94)00197-Q_BIB8","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\/0304-3975(94)00197-Q_BIB9","series-title":"Proc. Johns. Conf. on Information Sciences and Systems","first-page":"408","article-title":"On small universal data structures and related combinatorial problems","author":"DcMillo","year":"1981"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB10","series-title":"Proc. 3rd Aegean Workshop On Computing","first-page":"181","article-title":"Embedding rectangular grids into square grids","author":"Ellis","year":"1988"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB11","article-title":"Optimum expansion embeddings of meshes in hypercube","author":"Greenberg","year":"1987"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB12","series-title":"Proc. 1987 Internat. Conf. on Parallel. Processing","first-page":"188","article-title":"On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two","author":"Ho","year":"1987"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB13","series-title":"Proc. 19th Ann. ACM Symp. Theory of Computing","article-title":"Reconfiguring a hypercube in the presence of faults","author":"H\u00e5stad","year":"1987"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB14","series-title":"High Speed Computer and Algorithm Optimization","first-page":"423","article-title":"A software technique for reducing the routing time on a parallel computer with a fixed interconnection network","author":"Kung","year":"1987"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB15","series-title":"Canada-France Conf. on Parallel Computing","article-title":"On the multiply-twisted hypercube","author":"Kulasinghe","year":"1994"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB16","article-title":"Embedding planar graphs in hypercubes is NP-complete","author":"Lee","year":"1990"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB17","series-title":"Proc. 3rd Aegean Workshop on Computing, AWOC","first-page":"170","article-title":"Simulating binary trees on hypercubes","author":"Monien","year":"1988"},{"issue":"4","key":"10.1016\/0304-3975(94)00197-Q_BIB18","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322154.322160","article-title":"Encoding Data Structures in Trees","volume":"26","author":"Rosenberg","year":"1979","journal-title":"JACM"},{"key":"10.1016\/0304-3975(94)00197-Q_BIB19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1979","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400197Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400197Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:23:05Z","timestamp":1556508185000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400197Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["030439759400197Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00197-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}