4 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.DS2020★ 2 cited
Polynomial-time trace reconstruction in the smoothed complexity model
Xi Chen, Anindya De, Chin Ho Lee +2
In the \emph{trace reconstruction problem}, an unknown source string is sent through a probabilistic \emph{deletion channel} which independently deletes each bit…
cs.DS2019★ 4 cited
Efficient average-case population recovery in the presence of insertions and deletions
Frank Ban, Xi Chen, Rocco A. Servedio +1
Several recent works have considered the \emph{trace reconstruction problem}, in which an unknown source string is transmitted through a probabilistic channel which…
cs.DS2019
Beyond trace reconstruction: Population recovery from the deletion channel
Frank Ban, Xi Chen, Adam Freilich +2
\emph{Population recovery} is the problem of learning an unknown distribution over an unknown set of -bit strings, given access to independent draws from the distribution that h…