Local Decodability of the Burrows-Wheeler Transform. - Sandip Sinha; Omri Weinstein (Electron. Colloquium Comput. Complex., 2018)

Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions. - Frank Ban; Xi Chen 001; Rocco A. Servedio; Sandip Sinha (APPROX-RANDOM, 2019)

Beyond Trace Reconstruction: Population Recovery from the Deletion Channel. - Frank Ban; Xi Chen 001; Adam Freilich; Rocco A. Servedio; Sandip Sinha (FOCS, 2019)

Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ITCS, 2021)

Estimating the Longest Increasing Subsequence in Nearly Optimal Time. - Alexandr Andoni; Negev Shekel Nosatzki; Sandip Sinha; Clifford Stein 001 (FOCS, 2022)

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2022)

Efficient recovery algorithms with restricted access to strings - Sandip Sinha (2022)

Approximate Trace Reconstruction from a Single Trace. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2023)

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ACM Trans. Algorithms, 2025)