Distributed Algorithms, the Lovász Local Lemma, and Descriptive Combinatorics

Anton Bernshteyn

Type: Preprint

Publication Date: 2020-01-01

Citations: 2

DOI: https://doi.org/10.48550/arxiv.2004.04905

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics	2023	Anton Bernshteyn
+	Distributed Algorithms, the Lov\'{a}sz Local Lemma, and Descriptive Combinatorics	2020	Anton Bernshteyn
+	Measurable versions of the Lovász Local Lemma and measurable graph colorings	2016	Anton Bernshteyn
+	Measurable versions of the Lovász Local Lemma and measurable graph colorings	2019	Anton Bernshteyn
+	Measurable versions of the Lov\'{a}sz Local Lemma and measurable graph colorings.	2016	Anton Bernshteyn
+	Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics	2021	Sebastian Brandt Yi‐Jun Chang Jan Grebík Christoph Grunau Václav Rozhoň Zoltán Vidnyánszky
+ PDF Chat	Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms	2023	Anton Bernshteyn
+	Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees	2022	Sebastian Brandt Yi‐Jun Chang Jan Grebík Christoph Grunau Václav Rozhoň Zoltán Vidnyánszky
+	Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index	2023	Anton Bernshteyn Felix Weilacher
+ PDF Chat	Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel	2023	David G. Harris
+ PDF Chat	Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel	2022	David G. Harris
+	Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms	2021	Anton Bernshteyn
+ PDF Chat	On Baire measurable colorings of group actions	2020	Anton Bernshteyn
+ PDF Chat	BROOKS’ THEOREM FOR MEASURABLE COLORINGS	2016	Clinton T. Conley Andrew Marks Robin Tucker-Drob
+	Borel Combinatorics of Locally Finite Graphs	2020	Oleg Pikhurko
+	Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel	2019	David G. Harris
+	Equitable Colorings of Borel Graphs	2019	Anton Bernshteyn Clinton T. Conley
+	Borel Combinatorics of Locally Finite Graphs	2020	Oleg Pikhurko
+ PDF Chat	An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model	2019	Yi‐Jun Chang Tsvi Kopelowitz Seth Pettie
+	Borel Vizing's Theorem for Graphs of Subexponential Growth	2023	Anton Bernshteyn Abhishek Dhawan

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	Borel combinatorics of locally finite graphs	2021	Oleg Pikhurko
+ PDF Chat	Equivariant maps to subshifts whose points have small stabilizers	2023	Anton Bernshteyn
+	Local coloring problems on smooth graphs	2021	Anton Bernshteyn
+ PDF Chat	Continuous 2-colorings and topological dynamics	2023	Dominique Lecomte
+	Descriptive Combinatorics and Distributed Algorithms	2022	Anton Bernshteyn

Works Cited by This (0)

Action	Title	Year	Authors