2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.CO2026★ 2 cited
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…
math.GR2025
Unimodular random graphs with Property (T) have cost one
Åukasz Grabowski, Héctor Jardón-Sánchez, Sam Mellick
Hutchcroft and Pete showed that countably infinite groups with Property (T) admit cost one actions, resolving a question of Gaboriau. We give a streamlined proof of their theorem,…