Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
From MaRDI portal
Publication:5855252
DOI10.1145/3382734.3405730OpenAlexW3046870234MaRDI QIDQ5855252
Sebastian F. Brandt, Christoph Grunau, Václav Rozhoň
Publication date: 15 March 2021
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.04625
Related Items (3)
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022
This page was built for publication: Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
