Beyond trace reconstruction: Population recovery from the deletion channel F Ban, X Chen, A Freilich, RA Servedio, S Sinha 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 35 | 2019 |
Polynomial-time trace reconstruction in the smoothed complexity model X Chen, A De, CH Lee, RA Servedio, S Sinha ACM Transactions on Algorithms (TALG), 2020 | 26 | 2020 |
Efficient average-case population recovery in the presence of insertions and deletions F Ban, X Chen, RA Servedio, S Sinha arXiv preprint arXiv:1907.05964, 2019 | 20 | 2019 |
Near-optimal average-case approximate trace reconstruction from few traces X Chen, A De, CH Lee, RA Servedio, S Sinha Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 13 | 2022 |
Polynomial-time trace reconstruction in the low deletion rate regime X Chen, A De, CH Lee, RA Servedio, S Sinha arXiv preprint arXiv:2012.02844, 2020 | 10 | 2020 |
Estimating the longest increasing subsequence in nearly optimal time A Andoni, NS Nosatzki, S Sinha, C Stein 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 8 | 2022 |
Local decodability of the burrows-wheeler transform S Sinha, O Weinstein Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 5 | 2019 |
Approximate trace reconstruction from a single trace X Chen, A De, CH Lee, RA Servedio, S Sinha Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 2 | 2023 |