{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:21Z","timestamp":1763468061620},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:59:01Z","timestamp":1330257541000},"page":"291-302","source":"Crossref","is-referenced-by-count":14,"title":["A packet routing protocol for arbitrary networks"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"25_CR1","volume-title":"Algebraic graph theory","author":"N.L. Biggs","year":"1993","unstructured":"N.L. Biggs, Algebraic graph theory, Second Edition, Cambridge University Press (Cambridge 1993).","edition":"Second Edition"},{"issue":"2","key":"25_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02579310","volume":"2","author":"B. Bollob\u00e1s","year":"1982","unstructured":"B. Bollob\u00e1s and W. Fernandez de la Vega, The diameter of random regular graphs, Combinatorica 2 (2) (1982) pp. 125\u2013134.","journal-title":"Combinatorica"},{"key":"25_CR3","first-page":"305","volume":"33\/6","author":"T. Hagerup","year":"1989\/90","unstructured":"T. Hagerup and C. R\u00fcb, A guided tour of Chernoff bounds, Information Processing Letters 33\/6 (1989\/90) pp. 305\u2013308.","journal-title":"Information Processing Letters"},{"key":"25_CR4","volume-title":"Introduction to parallel algorithms and architectures: arrays\u00b7trees\u00b7hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton, Introduction to parallel algorithms and architectures: arrays\u00b7trees\u00b7hypercubes, Morgan Kaufmann Publishers (San Mateo, CA 1992)."},{"key":"25_CR5","unstructured":"F.T. Leighton and B.M. Maggs, Fast algorithms for finding O(congestion+dilation) packet routing schedules, Unpublished Manuscript (1994)."},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.21236\/ADA204273","volume-title":"Universal packet routing algorithms (Extended Abstract)","author":"F.T. Leighton","year":"1988","unstructured":"F.T. Leighton, B.M. Maggs, and S.B. Rao, Universal packet routing algorithms (Extended Abstract), Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE (White Plains, NY 1988) pp. 256\u2013271."},{"issue":"2","key":"25_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, and S.B. Rao, Packet routing and job-shop scheduling in O(congestion+dilation) steps, Combinatorica 14 (2) (1994) pp. 167\u2013186.","journal-title":"Combinatorica"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, A.G. Ranade, and S.B. Rao, Randomized routing and sorting on fixed-connection networks, Journal of Algorithms 17 (1994) pp. 157\u2013205.","journal-title":"Journal of Algorithms"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A.G. Ranade","year":"1991","unstructured":"A.G. Ranade, How to emulate shared memory, Journal of Computer and System Sciences 42 (1991) pp. 307\u2013326.","journal-title":"Journal of Computer and System Sciences"},{"issue":"No.3","key":"25_CR10","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, Journal of the Association for Computing Machinery Vol. 31, No. 3 (July 1984) pp. 507\u2013517.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11\/2","author":"L.G. Valiant","year":"1982","unstructured":"L.G. Valiant, A scheme for fast parallel communication, SIAM Journal on Computing 11\/2 (1982) pp. 350\u2013361.","journal-title":"SIAM Journal on Computing"},{"key":"25_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662065","volume-title":"Some topics in graph theory","author":"H.P. Yap","year":"1986","unstructured":"H.P. Yap, Some topics in graph theory, Cambridge University Press (Cambridge 1986)."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:22:14Z","timestamp":1619558534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}