{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:21:41Z","timestamp":1782778901992,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Horizon 2020 research and innovation programme","award":["853109"],"award-info":[{"award-number":["853109"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467931","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"307-317","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Brandt","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Grunau","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00e1clav","family":"Rozho\u0148","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.89"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90102-4"},{"key":"e_1_3_2_2_3_1","unstructured":"Sebastian Brandt Yi-Jun Chang Jan Greb\u00edk Christoph Grunau V\u00e1clav Rozho? and Zolt\u00e1n Vidny\u00e1nszky. 2021 a. Local Problems on Trees from the Perspectives of Distributed Algorithms Finitary Factors and Descriptive Combinatorics. arxiv: 2106.02066 [math.CO] https:\/\/arxiv.org\/abs\/2106.02066  Sebastian Brandt Yi-Jun Chang Jan Greb\u00edk Christoph Grunau V\u00e1clav Rozho? and Zolt\u00e1n Vidny\u00e1nszky. 2021 a. Local Problems on Trees from the Perspectives of Distributed Algorithms Finitary Factors and Descriptive Combinatorics. arxiv: 2106.02066 [math.CO] https:\/\/arxiv.org\/abs\/2106.02066"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897570"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405730"},{"key":"e_1_3_2_2_6_1","volume-title":"2021 b. The randomized local computation complexity of the Lov\u00e1 sz local lemma. CoRR","author":"Brandt Sebastian","year":"2021","unstructured":"Sebastian Brandt , Christoph Grunau , and V\u00e1 clav Rozhon . 2021 b. The randomized local computation complexity of the Lov\u00e1 sz local lemma. CoRR , Vol. abs\/ 2103 .16251 ( 2021 ). arxiv: 2103.16251 https:\/\/arxiv.org\/abs\/2103.16251 Sebastian Brandt, Christoph Grunau, and V\u00e1 clav Rozhon. 2021 b. The randomized local computation complexity of the Lov\u00e1 sz local lemma. CoRR , Vol. abs\/2103.16251 (2021). arxiv: 2103.16251 https:\/\/arxiv.org\/abs\/2103.16251"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331636"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.72"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.23"},{"key":"e_1_3_2_2_10_1","volume-title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs. arXiv preprint arXiv:2103.10990","author":"Dorobisz Andrzej","year":"2021","unstructured":"Andrzej Dorobisz and Jakub Kozik . 2021. Local Computation Algorithms for Coloring of Uniform Hypergraphs. arXiv preprint arXiv:2103.10990 ( 2021 ). Andrzej Dorobisz and Jakub Kozik. 2021. Local Computation Algorithms for Coloring of Uniform Hypergraphs. arXiv preprint arXiv:2103.10990 (2021)."},{"key":"e_1_3_2_2_11_1","volume-title":"Coll Math Soc J Bolyai","volume":"10","author":"Erd's Paul","year":"1974","unstructured":"Paul Erd's and Lov\u00e1sz L\u00e1szl\u00f3 . 1974 . Problems and results on 3-chromatic Hypergraphs and some related questions . Coll Math Soc J Bolyai , Vol. 10 (01 1974). Paul Erd's and Lov\u00e1sz L\u00e1szl\u00f3. 1974. Problems and results on 3-chromatic Hypergraphs and some related questions. Coll Math Soc J Bolyai , Vol. 10 (01 1974)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_33"},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. 31st Symp. on Distributed Computing (DISC). 18:1--18:16","author":"Fischer Manuela","year":"2017","unstructured":"Manuela Fischer and Mohsen Ghaffari . 2017 . Sublogarithmic Distributed Algorithms for Lov\u00e1sz Local lemma, and the complexity hierarchy . In Proc. 31st Symp. on Distributed Computing (DISC). 18:1--18:16 . Manuela Fischer and Mohsen Ghaffari. 2017. Sublogarithmic Distributed Algorithms for Lov\u00e1sz Local lemma, and the complexity hierarchy. In Proc. 31st Symp. on Distributed Computing (DISC). 18:1--18:16."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.50"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.166"},{"key":"e_1_3_2_2_17_1","volume-title":"Distributed Computing ,","author":"G\u00f6\u00f6s Mika","unstructured":"Mika G\u00f6\u00f6s , Juho Hirvonen , Reut Levi , Moti Medina , and Jukka Suomela . 2016. Non-local Probes Do Not Help with Many Graph Problems . In Distributed Computing , , Cyril Gavoille and David Ilcinkas (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 201--214. Mika G\u00f6\u00f6s, Juho Hirvonen, Reut Levi, Moti Medina, and Jukka Suomela. 2016. Non-local Probes Do Not Help with Many Graph Problems. In Distributed Computing , , Cyril Gavoille and David Ilcinkas (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 201--214."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.181"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/836"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1280283.1280327"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405721"},{"key":"e_1_3_2_2_26_1","volume-title":"Proc. Symposium on Theory of Computation (STOC) .","author":"Rozhovn V\u00e1clav","year":"2020","unstructured":"V\u00e1clav Rozhovn and Mohsen Ghaffari . 2020 . Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization . In Proc. Symposium on Theory of Computation (STOC) . V\u00e1clav Rozhovn and Mohsen Ghaffari. 2020. Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. In Proc. Symposium on Theory of Computation (STOC) ."},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings . 223--238","author":"Rubinfeld Ronitt","year":"2011","unstructured":"Ronitt Rubinfeld , Gil Tamir , Shai Vardi , and Ning Xie . 2011 . Fast Local Computation Algorithms. In Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7--9, 2011 . Proceedings . 223--238 . http:\/\/conference.iiis.tsinghua.edu.cn\/ICS2011\/content\/papers\/36.html Ronitt Rubinfeld, Gil Tamir, Shai Vardi, and Ning Xie. 2011. Fast Local Computation Algorithms. In Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7--9, 2011. Proceedings . 223--238. http:\/\/conference.iiis.tsinghua.edu.cn\/ICS2011\/content\/papers\/36.html"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":27,"alternative-id":["10.1145\/3465084.3467931","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467931","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}