{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:17Z","timestamp":1759063697342,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1420934"],"award-info":[{"award-number":["CCF-1420934"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EPSRC","award":["EP\/N004221\/1"],"award-info":[{"award-number":["EP\/N004221\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055410","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"342-355","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Uniform sampling through the Lovasz local lemma"],"prefix":"10.1145","author":[{"given":"Heng","family":"Guo","sequence":"first","affiliation":[{"name":"Queen Mary University of London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[{"name":"Queen Mary University of London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingcheng","family":"Liu","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818352"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020403"},{"key":"e_1_3_2_2_3_1","unstructured":"J\u00f3zsef Beck. 1991.  J\u00f3zsef Beck. 1991."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_2_5_1","first-page":"1","article-title":"Approximation via Correlation Decay When Strong Spatial Mixing Fails","volume":"45","author":"Bez\u00e1kov\u00e1 Ivona","year":"2016","unstructured":"Ivona Bez\u00e1kov\u00e1 , Andreas Galanis , Leslie Ann Goldberg , Heng Guo , and Daniel \u0160tefankovi\u010d . 2016 . Approximation via Correlation Decay When Strong Spatial Mixing Fails . In ICALP , 45 : 1 \u2013 13 . Ivona Bez\u00e1kov\u00e1, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel \u0160tefankovi\u010d. 2016. Approximation via Correlation Decay When Strong Spatial Mixing Fails. In ICALP, 45:1\u201313.","journal-title":"ICALP"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_11"},{"key":"e_1_3_2_2_7_1","volume-title":"Dyer","author":"Bubley Russ","year":"1997","unstructured":"Russ Bubley and Martin E . Dyer . 1997 . Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. In SODA. 248\u2013257. Russ Bubley and Martin E. Dyer. 1997. Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. In SODA. 248\u2013257."},{"key":"e_1_3_2_2_8_1","article-title":"Generating a Random Sink-free Orientation in Quadratic Time","volume":"9","author":"Cohn Henry","year":"2002","unstructured":"Henry Cohn , Robin Pemantle , and James G. Propp . 2002 . Generating a Random Sink-free Orientation in Quadratic Time . Electr. J. Comb. 9 , 1 (2002). Henry Cohn, Robin Pemantle, and James G. Propp. 2002. Generating a Random Sink-free Orientation in Quadratic Time. Electr. J. Comb. 9, 1 (2002).","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4%3C213::AID-RSA3%3E3.0.CO;2-Y"},{"key":"e_1_3_2_2_10_1","series-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai (1975)","volume-title":"Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and finite sets","author":"Erd\u0151s Paul","unstructured":"Paul Erd\u0151s and L\u00e1szl\u00f3 Lov\u00e1sz . 1975. Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and finite sets , volume 10 of Colloquia Mathematica Societatis J\u00e1nos Bolyai (1975) , 609\u2013628. Paul Erd\u0151s and L\u00e1szl\u00f3 Lov\u00e1sz. 1975. Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and finite sets, volume 10 of Colloquia Mathematica Societatis J\u00e1nos Bolyai (1975), 609\u2013628."},{"key":"e_1_3_2_2_11_1","volume-title":"What can be sampled locally? CoRR abs\/1702.00142","author":"Feng Weiming","year":"2017","unstructured":"Weiming Feng , Yuxin Sun , and Yitong Yin . 2017. What can be sampled locally? CoRR abs\/1702.00142 ( 2017 ). Weiming Feng, Yuxin Sun, and Yitong Yin. 2017. What can be sampled locally? CoRR abs\/1702.00142 (2017)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000401"},{"key":"e_1_3_2_2_13_1","volume-title":"Stirzaker","author":"Grimmett Geoffrey R.","year":"2001","unstructured":"Geoffrey R. Grimmett and David R . Stirzaker . 2001 . Geoffrey R. Grimmett and David R. Stirzaker. 2001."},{"volume-title":"Probability and random processes","year":"2017","key":"e_1_3_2_2_14_1","unstructured":"Probability and random processes ( third ed.). Oxford University Press , New York . xii+596 pages. STOC\u201917, June 2017 , Montreal, Canada Heng Guo, Mark Jerrum, and Jingcheng Liu Probability and random processes (third ed.). Oxford University Press, New York. xii+596 pages. STOC\u201917, June 2017, Montreal, Canada Heng Guo, Mark Jerrum, and Jingcheng Liu"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055410"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488696"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.57"},{"key":"e_1_3_2_2_19_1","volume-title":"Harris and Aravind Srinivasan","author":"David","year":"2014","unstructured":"David G. Harris and Aravind Srinivasan . 2014 . A constructive algorithm for the Lov\u00e1sz Local Lemma on permutations. In SODA. 907\u2013925. David G. Harris and Aravind Srinivasan. 2014. A constructive algorithm for the Lov\u00e1sz Local Lemma on permutations. In SODA. 907\u2013925."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.85"},{"key":"e_1_3_2_2_21_1","volume-title":"Rapid Mixing of Hypergraph Independent Set. CoRR abs\/1610.07999","author":"Hermon Jonathan","year":"2016","unstructured":"Jonathan Hermon , Allan Sly , and Yumeng Zhang . 2016. Rapid Mixing of Hypergraph Independent Set. CoRR abs\/1610.07999 ( 2016 ). Jonathan Hermon, Allan Sly, and Yumeng Zhang. 2016. Rapid Mixing of Hypergraph Independent Set. CoRR abs\/1610.07999 (2016)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993669"},{"key":"e_1_3_2_2_23_1","unstructured":"Jingcheng Liu and Pinyan Lu. 2015.  Jingcheng Liu and Pinyan Lu. 2015."},{"key":"e_1_3_2_2_24_1","unstructured":"FPTAS for Counting Monotone CNF. In SODA. 1531\u20131548.   FPTAS for Counting Monotone CNF. In SODA. 1531\u20131548."},{"key":"e_1_3_2_2_25_1","unstructured":"Ankur Moitra. 2016.  Ankur Moitra. 2016."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055428"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276866"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2%3C223::AID-RSA14%3E3.0.CO;2-O"},{"key":"e_1_3_2_2_30_1","volume-title":"Wilson","author":"Propp James G.","year":"1998","unstructured":"James G. Propp and David B . Wilson . 1998 . James G. Propp and David B. Wilson. 1998."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0917"},{"key":"e_1_3_2_2_32_1","unstructured":"James B. Shearer. 1985.  James B. Shearer. 1985."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"e_1_3_2_2_34_1","unstructured":"Allan Sly and Nike Sun. 2014.  Allan Sly and Nike Sun. 2014."},{"key":"e_1_3_2_2_35_1","volume-title":"2383\u20132416","author":"Ann The","year":"2014","unstructured":"The computational hardness of counting in two-spin models on d-regular graphs. Ann . Probab. 42, 6 ( 2014 ), 2383\u20132416 . The computational hardness of counting in two-spin models on d-regular graphs. Ann. Probab. 42, 6 (2014), 2383\u20132416."},{"key":"e_1_3_2_2_36_1","unstructured":"Aravind Srinivasan. 2008. Improved algorithmic versions of the Lov\u00e1sz Local Lemma. In SODA. 611\u2013620.   Aravind Srinivasan. 2008. Improved algorithmic versions of the Lov\u00e1sz Local Lemma. In SODA. 611\u2013620."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055410","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":37,"alternative-id":["10.1145\/3055399.3055410","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055410","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}