13 citations · 34 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Finding a planted clique by adaptive probing
Miklós Z. Rácz, Benjamin Schiffer
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. W…
cs.CC2019
Reconstructing Trees from Traces
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian
We study the problem of learning a node-labeled tree given independent traces from an appropriately defined deletion channel. This problem, tree trace reconstruction, generalizes s…