{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:17Z","timestamp":1781077637245,"version":"3.54.1"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/focs.2014.59","type":"proceedings-article","created":{"date-parts":[[2014,12,30]],"date-time":"2014-12-30T21:46:34Z","timestamp":1419975994000},"page":"494-503","source":"Crossref","is-referenced-by-count":9,"title":["Random Walks That Find Perfect Objects and the Lovasz Local Lemma"],"prefix":"10.1109","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fotis","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90044-9"},{"key":"17","first-page":"524","article-title":"Further algorithmic aspects of the local lemma","volume":"98","author":"molloy","year":"1999","journal-title":"STOC"},{"key":"23","first-page":"611","article-title":"Improved algorithmic versions of the Lov asz local lemma","author":"srinivasan","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"18","first-page":"343","article-title":"A constructive proof of the Lov asz local lemma","author":"moser","year":"2009","journal-title":"STOC'09-Proceedings of the 2009 ACM International Symposium on Theory of Computing"},{"key":"24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-38536-0_1","article-title":"The Lov asz local lemma - A survey","volume":"7913","author":"szegedy","year":"2013","journal-title":"Lecture Notes in Computer Science"},{"key":"15","first-page":"235","article-title":"Moser and Tardos meet Lov asz","author":"kolipaka","year":"2011","journal-title":"STOC"},{"key":"16","first-page":"243","article-title":"Quest for negative dependency graphs","author":"lu","year":"2013","journal-title":"Recent Advances in Harmonic Analysis and Applications"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.57"},{"key":"14","first-page":"907","article-title":"A constructive algorithm for the Lov asz local lemma on permutations","author":"harris","year":"2014","journal-title":"SODA"},{"key":"11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","article-title":"Lopsided Lov asz local lemma and latin transversals","volume":"30","year":"1991","journal-title":"Paul Erdos Joel Spencer Discrete Applied Mathematics"},{"key":"12","first-page":"397","article-title":"New constructive aspects of the Lov asz local lemma","author":"haeupler","year":"2010","journal-title":"FOCS"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20354"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"20","first-page":"163","article-title":"Papadimitriou. on selecting a satisfying truth assignment","author":"christos","year":"1991","journal-title":"FOCS"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020403"},{"key":"1","author":"achlioptas","year":"2014","journal-title":"The Lov Asz Local Lemma As A Random Walk"},{"key":"10","volume":"10","year":"1975","journal-title":"Colloq Math Soc J Anos Bolyai"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1391-z"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1659"},{"key":"5","first-page":"30","article-title":"Coloring non-uniform hypergraphs: A new algorithmic approach to the general Lov asz local lemma","author":"czumaj","year":"2000","journal-title":"Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco CA 2000)"},{"key":"4","first-page":"992","article-title":"Deterministic algorithms for the Lov asz local lemma","author":"chandrasekaran","year":"2010","journal-title":"SODA"},{"key":"9","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"2","author":"erdos","year":"0","journal-title":"Infinite and Finite Sets"},{"key":"8","doi-asserted-by":"crossref","first-page":"46p","DOI":"10.37236\/2055","article-title":"Rainbow hamilton cycles in uniform hypergraphs","volume":"19","author":"dudek","year":"2012","journal-title":"Electr J Comb"}],"event":{"name":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS)","location":"Philadelphia, PA, USA","start":{"date-parts":[[2014,10,18]]},"end":{"date-parts":[[2014,10,21]]}},"container-title":["2014 IEEE 55th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/6975722\/6978973\/06979034.pdf?arnumber=6979034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:22:00Z","timestamp":1602688920000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/6979034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":24,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/focs.2014.59","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}