5 citations · 25 across the 19 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.LO2021★ 5 cited
On Homomorphism Graphs
Sebastian Brandt, Yi-Jun Chang, Jan Grebík +3
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalizat…
cs.DS2021
The randomized local computation complexity of the Lovász local lemma
Sebastian Brandt, Christoph Grunau, Václav Rozhoň
The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-time algorithms that measures the complexity of an algorithm by the number of probes the al…