11 citations · 11 across the 3 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 11 cited
On active and passive testing
Noga Alon, Rani Hod, Amit Weinstein
Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" fr…
math.CO2013
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Let , , and be integers satisfying . A Steiner system with parameters , , and is a -uniform hypergraph on vertices in which every set of d…
math.CO2013
Component Games on Regular Graphs
Rani Hod, Alon Naor
We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim…