{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:58:08Z","timestamp":1720699088797},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00310-3","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"355-399","source":"Crossref","is-referenced-by-count":5,"title":["Randomized path coloring on binary trees"],"prefix":"10.1016","volume":"289","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00310-3_BIB1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2748\/tmj\/1178243286","article-title":"Weighted sums of certain dependent random variables","volume":"19","author":"Azuma","year":"1967","journal-title":"Tohoku Math. J."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB2","unstructured":"I. Caragiannis, C. Kaklamanis, P. Persiano, Bounds on optical bandwidth allocation on directed fiber tree topologies, 2nd Workshop on Optics and Computer Science (WOCS \u201997), 1997."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB4","unstructured":"T. Erlebach, K. Jansen, Scheduling of virtual connections in fast networks, Proc. 4th Workshop on Parallel Systems and Algorithms, 1996, pp. 13\u201332."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB5","doi-asserted-by":"crossref","unstructured":"T. Erlebach, K. Jansen, Call scheduling in trees, rings and meshes, Proc. 30th Hawaii Internat. Conf. on System Sciences, 1997.","DOI":"10.1109\/HICSS.1997.667220"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB6","series-title":"An introduction to probability theory and its applications: vol. I","author":"Feller","year":"1968"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB8","unstructured":"K. Jansen, Approximation results for wavelength routing in directed trees, 2nd Workshop on Optics and Computer Science (WOCS \u201997), 1997."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB9","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, Efficient wavelength routing on directed fiber trees, Proc. 4th European Symp. on Algorithms (ESA \u201996), Lecture Notes in Computer Science, vol. 1136, Springer, Berlin, 1996, pp. 460\u2013470.","DOI":"10.1007\/3-540-61680-2_75"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB10","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen, Constrained bipartite edge coloring with applications to wavelength routing, in: Proc. 24th Internat. Collo. on Automata, Languages, and Programming (ICALP \u201997), Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 493\u2013504.","DOI":"10.1007\/3-540-63165-8_205"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB11","doi-asserted-by":"crossref","unstructured":"A. Kamath, R. Motwani, K. Palem, P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science (FOCS \u201994), 1994, pp. 592\u2013603.","DOI":"10.1109\/SFCS.1994.365732"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB12","doi-asserted-by":"crossref","unstructured":"V. Kumar, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, in: Proc. 1st Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX \u201998), Lecture Notes in Computer Science, vol. 1444, Springer, Berlin, 1998, pp. 147\u2013158.","DOI":"10.1007\/BFb0053971"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB13","unstructured":"V. Kumar, E. Schwabe, Improved access to optical bandwidth in trees, Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA \u201997), 1997, pp. 437\u2013444."},{"key":"10.1016\/S0304-3975(01)00310-3_BIB14","doi-asserted-by":"crossref","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, Efficient access to optical bandwidth, Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS \u201995), 1995, pp. 548\u2013557.","DOI":"10.1109\/SFCS.1995.492585"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB15","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB16","doi-asserted-by":"crossref","unstructured":"Y. Rabani, Path coloring on the mesh, Proc. 37th Ann. IEEE Symp. on Foundations of Computer Science (FOCS \u201996), 1996, pp. 400\u2013409.","DOI":"10.1109\/SFCS.1996.548499"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB17","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in all-optical networks, Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC \u201994), 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB18","series-title":"Optical Networks: A Practical Perspective","author":"Ramaswami","year":"1998"},{"key":"10.1016\/S0304-3975(01)00310-3_BIB19","unstructured":"J.P. Schmidt, A. Siegel, A. Srinivasan, Chernoff\u2013Hoeffding bounds for applications with limited independence, Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA \u201993), 1993, pp. 331\u2013340."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:34Z","timestamp":1554772954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003103"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00310-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}