{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:16:59Z","timestamp":1792156619270,"version":"4.4.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf02090400","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T13:27:51Z","timestamp":1124026071000},"page":"223-232","source":"Crossref","is-referenced-by-count":26,"title":["Tight bounds for oblivious routing in the hypercube"],"prefix":"10.1007","volume":"24","author":[{"given":"Christos","family":"Kaklamanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thanasis","family":"Tsantilas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02090400_CR1","doi-asserted-by":"crossref","unstructured":"B. Aiello and T. Leighton, Coding Theory, Hypercube Embeddings, and Fault Tolerance, inProc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 125\u2013136.","DOI":"10.1145\/113379.113391"},{"key":"BF02090400_CR2","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, Randomized Parallel Communication, inProc. ACM Symposium on Principles of Distributed Computing, 1982, pp. 60\u201372.","DOI":"10.1145\/800220.806683"},{"key":"BF02090400_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(82)90163-7","volume":"38","author":"J. Aubert","year":"1982","unstructured":"J. Aubert and B. Schneider, D\u00e9composition de la somme cart\u00e9sienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens,Discrete Math.,38 (1982), 7\u201316.","journal-title":"Discrete Math."},{"key":"BF02090400_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J. Hopcroft, Routing, Merging and Sorting on Parallel Models of Computation,J. Comput. System Sci.,30 (1985), 130\u2013145.","journal-title":"J. Comput. System Sci."},{"key":"BF02090400_CR5","volume-title":"Decompositions of Graphs","author":"J. Bos\u00e1k","year":"1990","unstructured":"J. Bos\u00e1k,Decompositions of Graphs, Kluwer, Boston 1990."},{"key":"BF02090400_CR6","doi-asserted-by":"crossref","unstructured":"D. Krizanc, Oblivious Routing with Limited Buffer Capacity,J. Comput. System Sci. (to appear).","DOI":"10.1016\/0022-0000(91)90017-Y"},{"key":"BF02090400_CR7","doi-asserted-by":"crossref","unstructured":"D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, inProc. 20th ACM Symposium on Theory of Computing, 1988, pp. 93\u2013102.","DOI":"10.1145\/62212.62221"},{"key":"BF02090400_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01840387","volume":"5","author":"I. Parberry","year":"1990","unstructured":"I. Parberry, An Optimal Time Bound for Oblivious Routing,Algorithmica,5 (1990), 243\u2013250.","journal-title":"Algorithmica"},{"key":"BF02090400_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. O. Rabin","year":"1989","unstructured":"M. O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance,J. Assoc. Comput. Mach.,36 (1989), 335\u2013348.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02090400_CR10","series-title":"Lecture Notes in Computer Science","first-page":"411","volume-title":"Preliminary version inProc. AWOC '88","author":"S. Rajasekaran","year":"1988","unstructured":"S. Rajasekaran and Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays,Algorithmica (to appear). Preliminary version inProc. AWOC '88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, 1988, pp. 411\u2013422."},{"key":"BF02090400_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF02960735","volume":"20","author":"G. Ringel","year":"1955","unstructured":"G. Ringel, \u00dcber drei kombinatorische Probleme amn-dimensionalen W\u00fcrfel und W\u00fcrfelgitter,Abh. Math. Semi. Univ. Hamburg,20 (1955), 10\u201319.","journal-title":"Abh. Math. Semi. Univ. Hamburg"},{"key":"BF02090400_CR12","volume-title":"Computational Aspects of VLSI","author":"J. Ullman","year":"1984","unstructured":"J. Ullman,Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984."},{"key":"BF02090400_CR13","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"E. Upfal, Efficient Schemes for Parallel Communication,J. Assoc. Comput. Mach.,31 (1984), 507\u2013517.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02090400_CR14","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L. G. Valiant","year":"1982","unstructured":"L. G. Valiant, A Scheme for Fast Parallel Communication,SIAM J. Comput.,11 (1982), 350\u2013361.","journal-title":"SIAM J. Comput."},{"key":"BF02090400_CR15","first-page":"943","volume-title":"Handbook of Theoretical Computer Science","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant, General Purpose Parallel Architectures, inHandbook of Theoretical Computer Science (ed. J. van Leeuwan), Elsevier, Amsterdam, and MIT Press, Cambridge, MA, 1990, pp. 943\u2013971."},{"key":"BF02090400_CR16","doi-asserted-by":"crossref","unstructured":"L. G. Valiant and G. J. Brebner, Universal Schemes for Parallel Communication, inProc. 13th ACM Symposium on Theorry of Computing, 1981, pp. 263\u2013277.","DOI":"10.1145\/800076.802479"},{"key":"BF02090400_CR17","volume-title":"Hamming Geometry","author":"D. H. Wiedemann","year":"1986","unstructured":"D. H. Wiedemann, Hamming Geometry, Ph.D. Thesis, University of Waterloo, Waterloo, Ontario, 1986."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02090400\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T21:08:45Z","timestamp":1586380125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02090400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF02090400"],"URL":"https:\/\/doi.org\/10.1007\/bf02090400","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}