Probabilistic constructions in continuous combinatorics and a bridge to
distributed algorithms

v1v2 (latest)

Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms

17 February 2021

Anton Bernshteyn

ArXiv (abs)PDF HTML

Papers citing "Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms"

7 / 7 papers shown

Title
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index Anton Bernshteyn F. Weilacher 58 6 0 28 Aug 2023
Borel Vizing's Theorem for Graphs of Subexponential Growth Anton Bernshteyn A. Dhawan 142 6 0 30 Jun 2023
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring Peter Davies 67 17 0 18 Aug 2022
Descriptive combinatorics and distributed algorithms Anton Bernshteyn 151 5 0 04 Aug 2022
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees S. Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 42 1 0 20 Apr 2022
Moser-Tardos Algorithm with small number of random bits Endre Csóka L. Grabowski András Máthé O. Pikhurko K. Tyros 45 7 0 11 Mar 2022
On Homomorphism Graphs S. Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 38 12 0 05 Nov 2021