{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T10:37:29Z","timestamp":1773830249626,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424703","type":"print"},{"value":"9783540446668","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_31","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"285-296","source":"Crossref","is-referenced-by-count":27,"title":["Equitable Coloring Extends Chernoff-Hoeffding Bounds"],"prefix":"10.1007","author":[{"given":"Sriram V.","family":"Pemmaraju","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B. Bollob\u00e1s","year":"1988","unstructured":"B\u00e9la Bollob\u00e1s. The chromatic number of random graphs. Combinatorica, 8:49\u201355, 1988.","journal-title":"Combinatorica"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0095-8956(83)90017-5","volume":"34","author":"B. Bollob\u00e1s","year":"1983","unstructured":"Bela Bollob\u00e1s and Richard K. Guy. Equitable and proportional coloring of trees. Journal of Combinatorial Theory, Series B, 34:177\u2013186, 1983.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493\u2013507, 1952.","journal-title":"Annals of Mathematical Statistics"},{"key":"31_CR4","unstructured":"Hajnal and Szem\u00e9redi. Proof of a conjecture of erd\u00f6s. In P. Erdo\u00f6s, A. R\u00e9nyi, and V.T. S\u00f3s, editors, Combinatorial Theory and Its Applications, Vol II, Volume 4 of Colloquia Mathematica Societatis J\u00e1nos Bolyai, pages 601\u2013623. North-Holland, 1970."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13\u201330, 1963.","journal-title":"American Statistical Association Journal"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Colin McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195\u2013248. Springer, 1998.","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Alessandro Panconesi and Aravind Srinivasan. Randomized distributed edge colouring via an extension of the chernoff-hoeffding bounds. SIAM Journal on Computing, 26(2):350\u2013368, 1997.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Sriram V. Pemmaraju. Equitable colorings, proportional colorings, and chernoff-hoeffding bounds. Technical report, TR 01-05 Department of Computer Science, The University of Iowa, 2001.","DOI":"10.1007\/3-540-44666-4_31"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J. Schmidt","year":"1995","unstructured":"Jeanette Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223\u2013250, 1995.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"31_CR11","unstructured":"Joel Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, 1987."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:26:13Z","timestamp":1556385973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}