{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:01Z","timestamp":1781077621393,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993669","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Moser and tardos meet Lov\u00e1sz"],"prefix":"10.1145","author":[{"given":"Kashyap Babu Rao","family":"Kolipaka","sequence":"first","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185423"},{"key":"e_1_3_2_2_2_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1992","unstructured":"N. Alon and J. H. Spencer . The Probabilistic Method . Wiley , New York , 1992 . N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, New York, 1992."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_2_4_1","first-page":"30","volume-title":"SODA","author":"Czumaj A.","year":"2000","unstructured":"A. Czumaj and C. Scheideler . Coloring non-uniform hypergraphs: a new algorithmic approach to the general lov\u00e1sz local lemma . In SODA , pages 30 -- 39 , 2000 . A. Czumaj and C. Scheideler. Coloring non-uniform hypergraphs: a new algorithmic approach to the general lov\u00e1sz local lemma. In SODA, pages 30--39, 2000."},{"key":"e_1_3_2_2_5_1","first-page":"609","volume-title":"Infinite and Finite Sets (to Paul Erdos on his 60th birthday)","author":"Erd\u00f6s P.","year":"1975","unstructured":"P. Erd\u00f6s and L. Lov\u00e1sz . Problems and results on 3-chromatic hypergraphs and some related questions . In A. Hajnal, R. Rado and V.T. Sos, editors, Infinite and Finite Sets (to Paul Erdos on his 60th birthday) , pages 609 -- 627 , 1975 . P. Erd\u00f6s and L. Lov\u00e1sz. Problems and results on 3-chromatic hypergraphs and some related questions. In A. Hajnal, R. Rado and V.T. Sos, editors, Infinite and Finite Sets (to Paul Erdos on his 60th birthday), pages 609--627, 1975."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.45"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276866"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536462"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007182"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2055-4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"e_1_3_2_2_13_1","first-page":"611","volume-title":"SODA","author":"Srinivasan A.","year":"2008","unstructured":"A. Srinivasan . Improved algorithmic versions of the lov\u00e1sz local lemma . In SODA , pages 611 -- 620 , 2008 . A. Srinivasan. Improved algorithmic versions of the lov\u00e1sz local lemma. In SODA, pages 611--620, 2008."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993669","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":13,"alternative-id":["10.1145\/1993636.1993669","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993669","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}