{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:32:48Z","timestamp":1725618768666},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1145\/72935.72959","type":"proceedings-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:59:36Z","timestamp":1068825576000},"page":"224-234","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Dynamic tree embeddings in butterflies and hypercubes"],"prefix":"10.1145","author":[{"given":"T.","family":"Leighton","sequence":"first","affiliation":[{"name":"M.I.T. Mathematics Department and Laboratory for Computer Science, Cambridge, MA"}]},{"given":"M.","family":"Newman","sequence":"additional","affiliation":[{"name":"M.I.T. Mathematics Department and Laboratory for Computer Science, Cambridge, MA"}]},{"given":"A. G.","family":"Ranade","sequence":"additional","affiliation":[{"name":"Department of EECS, University of California, Berkeley, CA"}]},{"given":"E.","family":"Schwabe","sequence":"additional","affiliation":[{"name":"M.I.T. Mathematics Department and Laboratory for Computer Science, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[1989,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21963"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62229"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.38"},{"key":"e_1_3_2_1_6_1","volume-title":"Optimal embeddings of the FFT graph in the Hypercube","author":"Greenberg D. S.","year":"1987","unstructured":"[ 6 ] D. S. Greenberg , L. S. Heath , and A. L. Rosenberg . Optimal embeddings of the FFT graph in the Hypercube . 1987 . Typescript, University of Massachusetts. [6] D. S. Greenberg, L. S. Heath, and A. L. Rosenberg. Optimal embeddings of the FFT graph in the Hypercube. 1987. Typescript, University of Massachusetts."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728178"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62240"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73029"}],"event":{"name":"SPAA89: 1st Annual ACM Symposium on Parallel Algorithms & Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Santa Fe New Mexico USA","acronym":"SPAA89"},"container-title":["Proceedings of the first annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/72935.72959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:51:53Z","timestamp":1673409113000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/72935.72959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":7,"alternative-id":["10.1145\/72935.72959","10.1145\/72935"],"URL":"https:\/\/doi.org\/10.1145\/72935.72959","relation":{},"subject":[],"published":{"date-parts":[[1989,3]]},"assertion":[{"value":"1989-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}