{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:44:23Z","timestamp":1649205863990},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf02017346","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T17:52:59Z","timestamp":1123264379000},"page":"245-256","source":"Crossref","is-referenced-by-count":4,"title":["Embeddings on a boolean cube"],"prefix":"10.1007","volume":"30","author":[{"given":"M.","family":"Zubair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. N.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02017346_CR1","unstructured":"S. N. Bhatt and I. C. F. Ipsen,How to embed trees in hypercubes, Tech. Rep. YALEU\/CSD\/RR-443, Department of Computer Science, Yale University, Dec. 1985."},{"key":"BF02017346_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. T. Leighton and A. Rosenberg,Optimal simulation of tree machines, in Proc. 27th Annu. IEEE Symp. Found. Comp. Sci., pp. 264\u2013282, 1986.","DOI":"10.1109\/SFCS.1986.38"},{"key":"BF02017346_CR3","doi-asserted-by":"crossref","unstructured":"M. Y. Chan and F. Y. L. Chin,On embedding rectangular grids in hypercube, IEEE Trans. Computers, vol. 37, No. 10, Oct. 1988.","DOI":"10.1109\/12.5991"},{"issue":"4","key":"BF02017346_CR4","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","volume":"30","author":"Jia-Wei Hong","year":"1983","unstructured":"Jia-Wei Hong, Kurt Mehlhorn and Arnold L. Rosenberg,Cost trade-offs in graph embeddings, with applications, Journal of the Association of Computing Machinery, Vol. 30, No. 4, pp. 709\u2013728, Oct. 1983","journal-title":"Journal of the Association of Computing Machinery"},{"key":"BF02017346_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","volume":"4","author":"S. L. Johnson","year":"1987","unstructured":"S. L. Johnson,Communication efficient basic linear algebra computation on hypercube architecture, Journal of Parallel and Distributed Computing, vol. 4 pp. 133\u2013172, 1987.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02017346_CR6","first-page":"148","volume-title":"Hypercube embedding is NP-complete","author":"D. W. Krumme","year":"1985","unstructured":"D. W. Krumme, K. N. Venkataraman, and G. Cybenko,Hypercube embedding is NP-complete, in First Hypercube Conference, M. Heath, editor, pages 148\u2013157, SIAM, Knoxville, Tennessee, August 1985."},{"key":"BF02017346_CR7","doi-asserted-by":"crossref","unstructured":"F. T. Leighton,New lower bound techniques for VLSI, in Proc. 22nd Annu. IEEE Symp. foundation com. sci., pp. 1\u201312, October 1981.","DOI":"10.1109\/SFCS.1981.22"},{"key":"BF02017346_CR8","unstructured":"F. T. Leighton,Private communication, 1989."},{"key":"BF02017346_CR9","first-page":"418","volume-title":"Hypercube Multiprocessors 1987","author":"R. Miller","year":"1987","unstructured":"R. Miller and Q. F. Stout,Some graph and image processing algorithms for hypercube, in Hypercube Multiprocessors 1987, Philadelphia, PA: SIAM, pp. 418\u2013425, 1987."},{"issue":"12","key":"BF02017346_CR10","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1109\/12.9737","volume":"37","author":"R. Miller","year":"1988","unstructured":"R. Miller and Q. F. Stout,Efficient parallel convex hull algorithm, IEEE Trans. on Computers, Vol 37, No. 12, pp. 1605\u20131618, December 1988.","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"BF02017346_CR11","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1109\/12.9741","volume":"37","author":"R. Miller","year":"1988","unstructured":"R. Miller and Q. F. Stout,Simulating essential pyramids, IEEE Trans. on Computers, Vol. 37, No. 12, pp. 1642\u20131647, December 1988.","journal-title":"IEEE Trans. on Computers"},{"issue":"6","key":"BF02017346_CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TC.1983.1676279","volume":"C-32","author":"D. Nath","year":"1983","unstructured":"D. Nath, S. N. Maheshwari and P. C. P. Bhatt,Efficient VLSI networks for parallel processing based on orthogonal trees, IEEE Trans. Comput., Vol. C-32, No. 6, pp. 569\u2013581, June 1983.","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"BF02017346_CR13","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M. H. Schultz,Topological properties of hypercubes, IEEE Trans. on Computers, Vol. 37, Number 7, pp. 867\u2013872, 1988.","journal-title":"IEEE Trans. on Computers"},{"issue":"10","key":"BF02017346_CR14","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1109\/12.5990","volume":"37","author":"David S. Scott","year":"1988","unstructured":"David S. Scott and Joe Brandenburg,Minimal mesh embedding in binary hypercubes, IEEE Trans. Computers, vol. 37, No. 10, pp. 1284\u20131285, October 1988.","journal-title":"IEEE Trans. Computers"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02017346.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02017346\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02017346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T18:38:02Z","timestamp":1586371082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02017346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF02017346"],"URL":"https:\/\/doi.org\/10.1007\/bf02017346","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}