7 citations · 11 across the 11 of their papers we have counts for
4 papers · 1 filter
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Łukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
On directed analogues of expander and hyperfinite graph sequences
Endre Csóka, Łukasz Grabowski
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences,…
Upper bounds for the necklace folding problems
Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1
A necklace can be considered as a cyclic list of red and blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…
Locally common graphs
Endre Csóka, Tamás Hubai, László Lovász
Goodman proved that the sum of the number of triangles in a graph on nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a…