| No. |
Title |
Author |
Year |
| 1 |
Approximating LCS and Alignment Distance over Multiple Sequences |
Das, Debarati et al. |
2022 |
| 2 |
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding |
Das, Debarati et al. |
2022 |
| 3 |
A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence |
Bringmann, Karl et al. |
2021 |
| 4 |
Approximate Trace Reconstruction via Median String (In Average-Case) |
Chakraborty, Diptarka et al. |
2021 |
| 5 |
Approximate Online Pattern Matching in Sublinear Time |
Chakraborty, Diptarka et al. |
2019 |
| 6 |
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication |
Das, Debarati et al. |
2018 |
| 7 |
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity |
Chakraborty, Diptarka et al. |
2018 |
| 8 |
Sparse Weight Tolerant Subgraph for Single Source Shortest Path |
Chakraborty, Diptarka et al. |
2018 |
| 9 |
Dimension, Pseudorandomness and Extraction of Pseudorandomness |
Agrawal, Manindra et al. |
2015 |
