7 citations · 11 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 1 cited
Borel oracles. An analytical approach to constant-time algorithms
Gabor Elek, Gabor Lippner
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…
math.FA2009★ 3 cited
Sofic equivalence relations
Gábor Elek, Gábor Lippner
We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes' Embedding Conjecture as well as the Measurable Determinant Conjecture of Lück, S…
math.CO2008★ 7 cited
An analogue of the Szemeredi Regularity Lemma for bounded degree graphs
Gábor Elek, Gábor Lippner
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-V…