| Approximating LCS and Alignment Distance over Multiple Sequences. | 0 | 0.34 | 2022 |
| A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs | 0 | 0.34 | 2022 |
| Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding | 0 | 0.34 | 2022 |
| A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. | 0 | 0.34 | 2022 |
| AdBERT: An Effective Few Shot Learning Framework for Aligning Tweets to Superbowl Advertisements. | 0 | 0.34 | 2022 |
| A Linear-Time n0.4-Approximation for Longest Common Subsequence. | 0 | 0.34 | 2021 |
| Approximating the Median under the Ulam Metric | 0 | 0.34 | 2021 |
| Approximate Trace Reconstruction via Median String (In Average-Case). | 0 | 0.34 | 2021 |
| Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time | 1 | 0.40 | 2020 |
| Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time | 1 | 0.35 | 2018 |
| Approximate Online Pattern Matching in Sub-linear Time. | 0 | 0.34 | 2018 |
| Sparse Weight Tolerant Subgraph for Single Source Shortest Path. | 0 | 0.34 | 2018 |
| Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. | 0 | 0.34 | 2018 |
| Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. | 0 | 0.34 | 2018 |
| Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path. | 0 | 0.34 | 2017 |
| Dimension, Pseudorandomness And Extraction Of Pseudorandomness | 0 | 0.34 | 2017 |
| Optimal Quasi-Gray Codes: Does the Alphabet Matter? | 0 | 0.34 | 2017 |
| A Computational Analysis of Mahabharata. | 0 | 0.34 | 2016 |
| Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. | 0 | 0.34 | 2014 |
