| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence | Bringmann, Karl et al. | 2021 |
| 2 | Approximate Trace Reconstruction via Median String (In Average-Case) | Chakraborty, Diptarka et al. | 2021 |
| 3 | Approximate Online Pattern Matching in Sublinear Time | Chakraborty, Diptarka et al. | 2019 |
| 4 | Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication | Das, Debarati et al. | 2018 |
| 5 | Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity | Chakraborty, Diptarka et al. | 2018 |
| 6 | Sparse Weight Tolerant Subgraph for Single Source Shortest Path | Chakraborty, Diptarka et al. | 2018 |
| 7 | Dimension, Pseudorandomness and Extraction of Pseudorandomness | Agrawal, Manindra et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |