Selected Publications:

• Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces,

with Xi Chen, Anindya De, Chin Ho Lee and Rocco Servedio.

SODA '22

• Polynomial-time trace reconstruction in the smoothed complexity model,

with Xi Chen, Anindya De, Chin Ho Lee and Rocco Servedio.

SODA '21

• Local Decodability of the Burrows-Wheeler Transform,

with Omri Weinstein.

STOC '19

• Beyond trace reconstruction: Population recovery from the deletion channel,

with Frank Ban, Xi Chen, Adam Freilich and Rocco Servedio.

FOCS '19

• Efficient average-case population recovery in the presence of insertions and deletions,

with Frank Ban, Xi Chen and Rocco Servedio.

RANDOM '19

• Polynomial-time trace reconstruction in the low deletion rate regime,

with Xi Chen, Anindya De, Chin Ho Lee and Rocco Servedio.

ITCS '21

• Estimating the Longest Increasing Subsequence in Nearly Optimal Time,

with Alexandr Andoni, Negev Shekel Nosatzki and Clifford Stein

Submitted to STOC '22

Teaching:

• Fall 2018: TA for COMS 4252: Introduction to Computational Learning Theory, taught by Rocco Servedio.

Miscellaneous:

• Reviewer for STOC, FOCS, SODA and other Computer Science theory conferences.

• Mentored PhD applicants to reduce inequity in the PhD application process via the Presubmission Application Review program.