| Near-optimal quantum algorithms for string problems S Akmal, C Jin Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 39 | 2022 |
| Quantifying degrees of controllability in temporal networks with uncertainty S Akmal, S Ammons, H Li, JC Boerkoel Jr Proceedings of the International Conference on Automated Planning and …, 2019 | 15 | 2019 |
| Faster Algorithms for Bounded Tree Edit Distance S Akmal, C Jin arXiv preprint arXiv:2105.02428, 2021 | 13 | 2021 |
| Majority-3sat (and related problems) in polynomial time S Akmal, R Williams 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 12 | 2022 |
| Quantifying controllability in temporal networks with uncertainty S Akmal, S Ammons, H Li, M Gao, L Popowski, JC Boerkoel Jr Artificial Intelligence 289, 103384, 2020 | 11 | 2020 |
| Improved Merlin–Arthur protocols for central problems in fine-grained complexity S Akmal, L Chen, C Jin, M Raj, R Williams Algorithmica 85 (8), 2395-2426, 2023 | 8 | 2023 |
| Improved Approximation for Longest Common Subsequence over Small Alphabets S Akmal, VV Williams arXiv preprint arXiv:2105.03028, 2021 | 7 | 2021 |
| On a convex set with nondifferentiable metric projection SS Akmal, NM Nam, JJP Veerman Optimization Letters 9, 1039-1052, 2015 | 7 | 2015 |
| A Local-to-Global Theorem for Congested Shortest Paths S Akmal, N Wein arXiv preprint arXiv:2211.07042, 2022 | 3 | 2022 |
| Detecting Disjoint Shortest Paths in Linear Time and More S Akmal, VV Williams, N Wein arXiv preprint arXiv:2404.15916, 2024 | 2 | 2024 |
| Longest Common Subsequence Over Constant-Sized Alphabets: Beating the Naive Approximation Ratio S Akmal Massachusetts Institute of Technology, 2021 | 1 | 2021 |
| Parameterized Relaxations for Circuits and Graphs S Akmal MASSACHUSETTS INSTITUTE OF TECHNOLOGY, 2024 | | 2024 |
| An efficient algorithm for all-pairs bounded edge connectivity S Akmal, C Jin Algorithmica, 1-34, 2024 | | 2024 |
| An Enumerative Perspective on Connectivity S Akmal 2024 Symposium on Simplicity in Algorithms (SOSA), 179-198, 2024 | | 2024 |
| Faster Detours in Undirected Graphs S Akmal, VV Williams, R Williams, Z Xu arXiv preprint arXiv:2307.01781, 2023 | | 2023 |
| Quantifying controllability in temporal networks with uncertainty JC Boerkoel Jr, L Popowski, M Gao, H Li, S Ammons, S Akmal | | 2020 |
Ce JinMITEmail verificata su mit.edu