{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:17:20Z","timestamp":1734153440649,"version":"3.30.2"},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,28]],"date-time":"2003-03-28T00:00:00Z","timestamp":1048809600000},"content-version":"vor","delay-in-days":5930,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90069-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"281-293","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"title":["The generalized packet routing problem"],"prefix":"10.1016","volume":"53","author":[{"given":"David","family":"Peleg","sequence":"first","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90069-7_BIB1","first-page":"60","article-title":"Randomized parallel communication","author":"Aleliunas","year":"1982","journal-title":"Proc. 1st Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(87)90069-7_BIB2","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983","journal-title":"Proc. 15th Symp. on Theory of Computing"},{"year":"1973","series-title":"The Art of Computer Programming","author":"Knuth","key":"10.1016\/0304-3975(87)90069-7_BIB3"},{"key":"10.1016\/0304-3975(87)90069-7_BIB4","first-page":"71","article-title":"Tight bounds on the complexity of parallel sorting","author":"Leighton","year":"1984","journal-title":"Proc. 16th Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90069-7_BIB5","first-page":"240","article-title":"Ramanugan conjecture and explicit constructions of expanders","author":"Lubotzky","year":"1986","journal-title":"Proc. 18th Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90069-7_BIB6","first-page":"418","article-title":"The token distribution problem","author":"Peieg","year":"1986","journal-title":"Proc. 27th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(87)90069-7_BIB7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","article-title":"Efficient schemes for parallel communication","volume":"31","author":"Upfal","year":"1984","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900697?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900697?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:40:11Z","timestamp":1734082811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900697"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90069-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The generalized packet routing problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(87)90069-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}