Anton Bernshteyn

activity

20162026

most citedFree Subshifts with Invariant Measures from the Lovász Local Lemma

6 citations · 12 across the 11 of their papers we have counts for

collaborators

Showing 2020 · math.COShow all

2 papers · 2 filters

math.CO2020

A Fast Distributed Algorithm for $(Δ + 1)$ -Edge-Coloring

Anton Bernshteyn

We present a deterministic distributed algorithm in the LOCAL model that finds a proper $(Δ + 1)$ -edge-coloring of an $n$ -vertex graph of maximum degree $Δ$ in $\mathrm{poly}(Δ, \lo…

math.CO2020

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

Anton Bernshteyn

In this paper we consider coloring problems on graphs and other combinatorial structures on standard Borel spaces. Our goal is to obtain sufficient conditions under which such colo…

A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring

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

A Fast Distributed Algorithm for $(Δ + 1)$ -Edge-Coloring