{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:02:47Z","timestamp":1730275367142,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ispan.2002.1004295","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"281-286","source":"Crossref","is-referenced-by-count":0,"title":["Fixed layer embeddings of binary trees"],"prefix":"10.1109","author":[{"given":"W.W.","family":"Bein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Shields","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.H.","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Expansions of layouts of complete binary trees into grids I – upper bounds","year":"2000","author":"miller","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_13"},{"key":"ref12","article-title":"Bounds on minimax edge length for complete binary trees","author":"patterson","year":"1991","journal-title":"Proc 23rd Symp Theory of Computing"},{"journal-title":"Computational Aspects of VLSI","year":"1984","author":"ullman","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90118-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90173-6"},{"key":"ref6","article-title":"Optimal embedding of complete binary trees into lines and grids","volume":"570","author":"heckmann","year":"1991","journal-title":"Proceedings of the 17th Graph Theoretic Concepts in Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.83623"},{"key":"ref8","article-title":"Introduction to Parallel Algorithms and Architectures","author":"leighton","year":"1992","journal-title":"Arrays Trees Hypercubes"},{"key":"ref7","article-title":"Embedding complete binary trees into extended grids with edge congestion 1","volume":"805","author":"heydemann","year":"1994","journal-title":"Parallel Algorithms and Applications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2000.900278"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759038"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0215057"}],"event":{"name":"2002 International Symposium on Parallel Architectures, Algorithms, and Networks","acronym":"OSPAN-02","location":"Makati City, Metro Manila, Philippines"},"container-title":["Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7867\/21662\/01004295.pdf?arnumber=1004295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T18:16:57Z","timestamp":1489169817000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004295\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ispan.2002.1004295","relation":{},"subject":[]}}