{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T08:11:40Z","timestamp":1697616700795},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p> In this paper we study the square grid area required for laying out H<jats:sub>l<\/jats:sub>, the Boolean hypercube of N=2<jats:sup>l<\/jats:sup> vertices. It is shown that this area is [Formula: see text]. We describe a layout which occupies this much area and prove that no layout of less area exists. <\/jats:p>","DOI":"10.1142\/s0219265903000945","type":"journal-article","created":{"date-parts":[[2004,2,11]],"date-time":"2004-02-11T10:41:30Z","timestamp":1076496090000},"page":"395-417","source":"Crossref","is-referenced-by-count":5,"title":["Layout Area of the Hypercube"],"prefix":"10.1142","volume":"04","author":[{"given":"Shimon","family":"Even","sequence":"first","affiliation":[{"name":"Computer Sci. Dept., Technion - Israel  Inst. of Tech., Haifa, Israel"},{"name":"The Academic College of  Tel-Aviv-Jaffa, Israel"}]},{"given":"Roni","family":"Kupershtok","sequence":"additional","affiliation":[{"name":"Univ. of Maryland, Institute for Advanced Computer Studies (UMIACS), College Park, MD 20742-3251, USA"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00162-4"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1958.tb03887.x"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1970.tb56468.x"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90058-3"},{"key":"rf7","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/12.833112"},{"key":"rf9","first-page":"509","volume":"26","author":"Raspaud A.","journal-title":"RAIRO - Theoretical Information and Applications"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265903000945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:33:34Z","timestamp":1565134414000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265903000945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0219265903000945"],"URL":"https:\/\/doi.org\/10.1142\/s0219265903000945","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}