| No. | Title | Author | Year |
|---|---|---|---|
| 1 | An Algorithmic Bridge Between Hamming and Levenshtein Distances | Goldenberg, Elazar et al. | 2023 |
| 2 | Approximating LCS and Alignment Distance over Multiple Sequences | Das, Debarati et al. | 2022 |
| 3 | Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding | Das, Debarati et al. | 2022 |
| 4 | Sublinear Algorithms for Edit Distance (Invited Talk) | Saha, Barna | 2021 |
| 5 | Connectivity of Random Annulus Graphs and the Geometric Block Model | Galhotra, Sainyam et al. | 2019 |
| 6 | Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost | Saha, Barna et al. | 2019 |
| 7 | Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! | Jayaram, Rajesh et al. | 2017 |
| 8 | Renting a Cloud | Saha, Barna | 2013 |
| 9 | Energy Efficient Scheduling via Partial Shutdown | Khuller, Samir et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |