{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:58Z","timestamp":1725574198047},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_16","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T23:37:34Z","timestamp":1294443454000},"page":"174-185","source":"Crossref","is-referenced-by-count":0,"title":["Martingales and Locality in Distributed Computing"],"prefix":"10.1007","author":[{"given":"Devdatt P.","family":"Dubhashi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Graph Theory: An Introductory Course","author":"B. Bollabas","year":"1980","unstructured":"Bollabas, B.: Graph Theory: An Introductory Course. Springer, Heidelberg (1980)"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0304-3975(98)00022-X","volume":"203","author":"D. Dubhashi","year":"1998","unstructured":"Dubhashi, D., Grable, D.A., Panconesi, A.: Near optimal distributed edge colouring via the nibble method. Theoretical Computer Science\u00a0203, 225\u2013251 (1998); A special issue for ESA 1995, the 3rd European Symposium on Algorithms","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of measure for computer scientists. Draft of a monograph in preparation"},{"issue":"Nr. 3","key":"16_CR4","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., Panconesi, A.: Near optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms\u00a010(3), 385\u2013405 (1997)","journal-title":"Random Structures and Algorithms"},{"key":"16_CR5","unstructured":"Grable, D., Panconesi, P.: Brooks and Vizing Colurings, SODA 98"},{"issue":"2","key":"16_CR6","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\u00a047(2), 250\u2013286 (1993)","journal-title":"J. Computer and Systems Sciences"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Marton, K.: Bounding ${\\bar d}$ distance by informational divergence: A method to prove measure concentration. Annals of Probability\u00a024, 857\u2013866 (1996)","DOI":"10.1214\/aop\/1039639365"},{"key":"16_CR8","unstructured":"Marton, K.: On the measure concentration inequality of Talagrand for dependent random variables. Submitted for publication (1998)"},{"key":"16_CR9","series-title":"London Mathematical Society Lecture Notes Series 141","volume-title":"Surveys in Combinatorics","author":"C.J.H. McDiarmid","year":"1989","unstructured":"McDiarmid, C.J.H.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Notes Series 141. Cambridge University Press, Cambridge (1989)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M. Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Comb. Theory (B)\u00a069, 103\u2013109 (1997)","journal-title":"J. Comb. Theory (B)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff\u2013Hoeffding bounds. SIAM J. Computing\u00a026(2), 350\u2013368 (1997)","journal-title":"SIAM J. Computing"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Spencer, J.: Probabilistic methods in combinatorics. In: Proceedings of the International Congress of Mathematicians, Zurich, Birkhauser (1995)","DOI":"10.1007\/978-3-0348-9078-6_132"},{"issue":"2","key":"16_CR13","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\u00a081(2), 73\u2013205 (1995)","journal-title":"Publ. math. IHES"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:06:53Z","timestamp":1559916413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}