46 citations · 153 across the 21 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009
Betti numbers are testable
Gabor Elek
We prove that the Betti numbers of simplicial complexes of bounded vertex degrees are testable in constant time.
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…