{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:16:13Z","timestamp":1648851373785},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"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":9116,"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":[[1988,8]]},"DOI":"10.1016\/0304-3975(88)90144-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"259-276","source":"Crossref","is-referenced-by-count":3,"title":["Optimal dynamic embedding of x-trees into arrays"],"prefix":"10.1016","volume":"59","author":[{"given":"A.Scottedward","family":"Hodel","sequence":"first","affiliation":[]},{"given":"Michael C.","family":"Loui","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90144-2_BIB1","series-title":"Proc. 25th Ann. Symp. on Foundations of Computer Science","first-page":"89","article-title":"A comparative study of X-tree, pyramid, and related machines","author":"Aggarwal","year":"1984"},{"key":"10.1016\/0304-3975(88)90144-2_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","article-title":"On the minimum computation time of functions","volume":"142","author":"Cook","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90144-2_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/322169.322180","article-title":"Space-time trade-offs in structured programming: an improved combinatorial embedding theorem","volume":"27","author":"DeMillo","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90144-2_BIB4","series-title":"Proc. 5th Ann. Symp. on Computer Architecture","first-page":"144","article-title":"X-tree: a tree structured multiprocessor architecture","author":"Despain","year":"1978"},{"key":"10.1016\/0304-3975(88)90144-2_BIB5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","article-title":"Cost trade-offs in graph embeddings, with applications","volume":"30","author":"Hong","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90144-2_BIB6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0211018","article-title":"Graphs that are almost binary trees","volume":"11","author":"Hong","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90144-2_BIB7","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/321978.321990","article-title":"Space and time hierarchies for classes of control structures and data structures","volume":"23","author":"Lipton","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90144-2_BIB8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/0212030","article-title":"Optimal dynamic embedding of trees into arrays","volume":"12","author":"Loui","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90144-2_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(89)90081-9","article-title":"Simulations among multidimensional Turing machines","volume":"21","author":"Loui","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90144-2_BIB10","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1982.1676104","article-title":"A dictionary machine (for VLSI)","volume":"C-31","author":"Ottman","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(88)90144-2_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"26","author":"Pippenger","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90144-2_BIB12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(82)90037-8","article-title":"A fast implementation of a multidimensional storage into a tree storage","volume":"19","author":"Reischuk","year":"1982","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901442?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901442?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:10Z","timestamp":1555127650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0304397588901442"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90144-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}