{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:33:42Z","timestamp":1648906422105},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00010-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"469-488","source":"Crossref","is-referenced-by-count":0,"title":["On-line matching routing on trees"],"prefix":"10.1016","volume":"220","author":[{"given":"Alan","family":"Roberts","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00010-9_BIB1","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/S0895480192236628","article-title":"Routing permutations on graphs via matchings","volume":"7","author":"Alon","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00010-9_BIB3","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"583","article-title":"Routing permutations on graphs via matchings (extended abstract)","author":"Alon","year":"1993"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB4","series-title":"2nd Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 90)","first-page":"233","article-title":"A unified framework for off-line permutation routing in parallel networks","volume":"24","author":"Annexstein","year":"1991"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB5","article-title":"Parallel neighbor-sort (or the glory of the induction principle)","volume":"248","author":"Haberman","year":"1972"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB6","series-title":"Proc. 3rd Annual Internat. Computing and Combinatorics Conf.","first-page":"11","article-title":"Many-to-one packet routing via matchings","volume":"Vol. 1276","author":"Krizanc","year":"1997"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB7","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2014 Trees \u2014 Hypercubes","author":"Leighton","year":"1991"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB8","series-title":"Proc. of the 7th Internat. Symp. on Algorithms and Computation ISAAC'96","first-page":"275","article-title":"Dynamic tree routing under the \u201cmatching with consumption\u201d model","volume":"vol. 1178","author":"Pantziou","year":"1996"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0304-3975(97)00049-2","article-title":"Many-to-many routing on trees via matchings","volume":"185","author":"Pantziou","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00010-9_BIB10_1","series-title":"Proc. 4th Workshop on Algorithms and Data Structures (WADS'95)","first-page":"251","article-title":"Routing on trees via matchings","volume":"vol. 955","author":"Roberts","year":"1995"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB10_2","author":"Roberts","year":"1995"},{"key":"10.1016\/S0304-3975(99)00010-9_BIB11","series-title":"Proc. 8th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"445","article-title":"Optimal bounds for matching routing on trees","author":"Zhang","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:59:04Z","timestamp":1556315944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000109"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00010-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}