No. Title Author Year
1 Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems Abboud, Amir et al. 2022
2 Fine-Grained Hardness for Edit Distance to a Fixed Sequence Abboud, Amir et al. 2021
3 On the Fine-Grained Complexity of Parity Problems Abboud, Amir et al. 2020
4 Scheduling Lower Bounds via AND Subset Sum Abboud, Amir et al. 2020
5 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
6 Fine-Grained Reductions and Quantum Speedups for Dynamic Programming Abboud, Amir 2019
7 Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds Abboud, Amir et al. 2018
8 Tighter Connections Between Formula-SAT and Shaving Logs Abboud, Amir et al. 2018
9 Towards Hardness of Approximation for Polynomial Time Problems Abboud, Amir et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI