{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:19:23Z","timestamp":1649074763415},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00041-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"53-64","source":"Crossref","is-referenced-by-count":1,"title":["Randomized routing on generalized hypercubes"],"prefix":"10.1016","volume":"158","author":[{"given":"Afonso","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miltos","family":"Grammatikakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00041-0_BIB1","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/12.30851","article-title":"Performance of the direct binary N-cube network for multiprocessors","volume":"C-38","author":"Abraham","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(95)00041-0_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercube and hyperbus structures for a computer network","volume":"C-33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(95)00041-0_BIB3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0304-3975(95)00041-0_BIB4","series-title":"Proc. 22nd ACM Symp. Theory Comput.","first-page":"193","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1016\/0304-3975(95)00041-0_BIB5","series-title":"Proc. 4th Internat. Symp. Algor. Comp.","first-page":"167","article-title":"Adaptive and oblivious routing on the d-cube","volume":"Vol. 762","author":"Grammatikakis","year":"1994"},{"key":"10.1016\/0304-3975(95)00041-0_BIB6","series-title":"Proc. 2nd Joint Internat. Conf. Vector Par. Proc.","first-page":"839","article-title":"Greedy deterministic permutation routing on cayley graphs","volume":"Vol. 634","author":"Grammatikakis","year":"1992"},{"key":"10.1016\/0304-3975(95)00041-0_BIB7","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1214\/aoms\/1177728178","article-title":"On the distribution of the number of successes in independent trials","volume":"27","author":"Hoeffding","year":"1956","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0304-3975(95)00041-0_BIB8","series-title":"Proc. 2nd ACM Symp. Par. Algor. Arch.","first-page":"31","article-title":"Tight bounds for oblivious routing on the hypercube","author":"Kaklamanis","year":"1990"},{"key":"10.1016\/0304-3975(95)00041-0_BIB9","series-title":"Proc. 2nd ACM Symp. Par. Algor. Arch.","first-page":"2","article-title":"Average case analysis of greedy routing algorithms","author":"Leighton","year":"1990"},{"key":"10.1016\/0304-3975(95)00041-0_BIB10","first-page":"103","article-title":"On the permutation capability of a circuit-switched hypercube","volume":"I","author":"Szymanski","year":"1989"},{"key":"10.1016\/0304-3975(95)00041-0_BIB11","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","article-title":"A scheme for fast parallel communication","volume":"11","author":"Valiant","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00041-0_BIB12","series-title":"Proc. 13th ACM Symp. Theory Comput.","first-page":"263","article-title":"Universal schemes for parallel communication","author":"Valiant","year":"1981"},{"key":"10.1016\/0304-3975(95)00041-0_BIB13","article-title":"Permutation routing in t-nary hypercubes","author":"Yao","year":"1995","journal-title":"IEEE J. Parallel Distrib. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:53:09Z","timestamp":1555404789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595000410"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00041-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}