66 citations · 66 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Search for the end of a path in the d-dimensional grid and in other graphs
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +2
We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph and a vertex . We denote th…
math.CO2012
Density-based group testing
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +1
In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are conside…