| Edit distance in near-linear time: It's a constant factor A Andoni, NS Nosatzki 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 53 | 2020 |
| Lsh forest: Practical algorithms made theoretical A Andoni, I Razenshteyn, NS Nosatzki Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 50 | 2017 |
| Two party distribution testing: Communication and security A Andoni, T Malkin, NS Nosatzki arXiv preprint arXiv:1811.04065, 2018 | 15 | 2018 |
| 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 |
| Approximating the longest common subsequence problem within a sub-polynomial factor in linear time NS Nosatzki arXiv preprint arXiv:2112.08454, 2021 | 5 | 2021 |
