{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:17:45Z","timestamp":1725459465757},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045067","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"11-17","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Many-to-one packet routing via matchings"],"prefix":"10.1007","author":[{"given":"Danny","family":"Krizanc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"2_CR1","unstructured":"N. Alon, F. R. K. Chung and R. L. Graham. Routing permutations on graphs via matchings. in Proc. of the 25th ACM annual Symposium on Theory of Computing,-1993; SIAM J. Discrete Math. 7 (1994), 516\u2013530."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02090401","volume":"24","author":"M. Baumslag","year":"1991","unstructured":"M. Baumslag and F. Annexstein. A unified framework for off-line permutation routing in parallel networks. Mathematical Systems Theory\n24 (1991), 233\u2013251.","journal-title":"Mathematical Systems Theory"},{"key":"2_CR3","series-title":"Technical Report AD-759 248","volume-title":"Parallel neighbor-sort (or the glory of the induction principle)","author":"N. Haberman","year":"1972","unstructured":"N. Haberman. Parallel neighbor-sort (or the glory of the induction principle). Technical Report AD-759 248, National Technical Information Services, US Department of Commerce, Springfield VA 22151, 1972."},{"key":"2_CR4","unstructured":"D. Krizanc and L. Zhang, Many-to-one routing via matching, Technical Report TR-96-19, School of Computer Science, Carleton University, 1996."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"T. Leighton. Methods for message routing in parallel machines. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 77\u201396, 1992.","DOI":"10.1145\/129712.129721"},{"key":"2_CR6","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypertubes","author":"T. Leighton","year":"1992","unstructured":"T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypertubes. Morgan Kaufmann, Cal. 1992."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230230420","volume":"23","author":"M. Ramras","year":"1993","unstructured":"M. Ramras. Routing permutations on a graph. Networks\n23 (1993), 391\u2013398.","journal-title":"Networks"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-60220-8_67","volume":"955","author":"A. Roberts","year":"1995","unstructured":"A. Roberts, A. Symvonis and L. Zhang, Routing on Trees via Matchings, The Workshop on Algorithms and Data Structures, Kingston, Canada, 1995. Lecture Notes in Computer Sciences vol. 955, 251\u2013263.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"2_CR9","unstructured":"L. Zhang, Optimal Bounds for Matching Routing on Trees. Proc. of The Eighth Annual ACM-SIAM Syposium on Discrete Algorithms, New Orleans, 445\u2013453, 1997."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:47:25Z","timestamp":1578494845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045067"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0045067","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"24 January 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}