{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:57Z","timestamp":1725663777617},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:23:37Z","timestamp":1330262617000},"page":"125-135","source":"Crossref","is-referenced-by-count":0,"title":["A unified scheme for routing in expander based networks"],"prefix":"10.1007","author":[{"given":"Shimon","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Litman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., T. Leighton, B. Maggs, \u201cOn-line algorithms for path selection in a nonblocking network,\u201d Proc. of the Twenty Second Annual ACM Symp. on Theory of Computing, pp. 149\u2013158, 1990.","DOI":"10.1145\/100216.100232"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/12.142684","volume":"41","author":"F. T. Leighton","year":"1992","unstructured":"Leighton, F.T. and B.M. Maggs, \u201cFast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks,\u201d IEEE Trans. Comp., vol. 41, pp. 578\u2013587, 1992.","journal-title":"IEEE Trans. Comp."},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C. E. Leiserson","year":"1985","unstructured":"Leiserson, C.E, \u201cFat-Trees: Universal networks for hardware-efficient supercomputing,\u201d IEEE Trans. Comp., vol. C-34, pp. 892\u2013901, 1985.","journal-title":"IEEE Trans. Comp."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N. J. Pippenger","year":"1977","unstructured":"Pippenger, N.J., \u201cSuperconcentrators,\u201d SIAM J. Comput., vol. 6, pp. 298\u2013304, 1977.","journal-title":"SIAM J. Comput."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/147508.147517","volume":"39","author":"E. Upfal","year":"1992","unstructured":"Upfal, E. \u201cAn O(log N) deterministic packet routing scheme,\u201d JACM, vol. 39, pp. 55\u201370, 1992.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:17Z","timestamp":1619572097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}