{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:01Z","timestamp":1725485581487},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_6","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"60-70","source":"Crossref","is-referenced-by-count":0,"title":["Talagrand\u2019s Inequality and Locality in Distributed Computing"],"prefix":"10.1007","author":[{"given":"Devdatt P.","family":"Dubhashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"6_CR1","unstructured":"Bollabas, B.: Graph Theory: An Introductory Course. Springer-Verlag 1980."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(98)00022-X","volume":"203","author":"D. Dubhashi","year":"1998","unstructured":"Dubhashi, D., Grable, D.A., and Panconesi, A.: Near optimal distributed edge colouring via the nibble method. Theoretical Computer Science 203 (1998), 225\u2013251, a special issue for ESA 95, the 3rd European Symposium on Algorithms.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.0.CO;2-S","volume":"10","author":"D. Grable","year":"1997","unstructured":"Grable, D., and Panconesi, A: Near optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms 10, Nr. 3 (1997) 385\u2013405","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/0022-0000(93)90033-S","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M.: Removing randomness in parallel without a processor penalty. J. Computer and Systems Sciences 47:2 (1993) 250\u2013286.","journal-title":"J. Computer and Systems Sciences"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1214\/aop\/1039639365","volume":"24","author":"K Marton","year":"1996","unstructured":"Marton, K.Bounding l-d distance by informational divergence: A method to prove measure concentration. Annals of Probability 24 (1996) 857\u2013866.","journal-title":"Annals of Probability"},{"key":"6_CR6","unstructured":"Marton, K.: On the measure concentration inequality of Talagrand for dependent random variables, submitted for publication. (1998)."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M. Molloy","year":"1997","unstructured":"Molloy, M. and Reed, B.:A bound on the strong chromatic index of a graph. J. Comb. Theory (B) 69 (1997) 103\u2013109.","journal-title":"J. Comb. Theory (B)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Panconesi, A. and Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Computing 26:2 (1997) 350\u2013368.","journal-title":"SIAM J. Computing"},{"key":"6_CR9","volume-title":"proceedings of the International Congress of Mathematicians","author":"J. Spencer","year":"1995","unstructured":"Spencer, J.: Probabilistic methods in combinatorics. In proceedings of the International Congress of Mathematicians, Zurich, Birkhauser (1995)."},{"issue":"2","key":"6_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M. Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. math. IHES, 81:2 (1995) 73\u2013205.","journal-title":"Publ. math. IHES"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:35:03Z","timestamp":1550367303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}