7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DS2020★ 7 cited
Approximate Trace Reconstruction
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian +1
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length after it passes through a deletion channel many times independently, p…
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…