Faster algorithms for all-pairs bounded min-cuts
- Amir Abboud
- Loukas Georgiadis
- et al.
- 2019
- ICALP 2019
Conference paper
Publications
19 results for Amir Abboud
Fine-grained reductions and quantum speedups for dynamic programming
- Amir Abboud
- 2019
- ICALP 2019
Conference paperDynamic set cover: Improved algorithms and lower bounds
- Amir Abboud
- Raghavendra Addanki
- et al.
- 2019
- STOC 2019
Conference paperIf the current Clique algorithms are optimal, so is Valiant's parser
- Amir Abboud
- Arturs Backurs
- et al.
- 2018
- SIAM Journal on Computing
PaperTighter connections between formula-SAT and shaving logs
- Amir Abboud
- Karl Bringmann
- 2018
- ICALP 2018
Conference paperMore consequences of falsifying SETH and the orthogonal vectors conjecture
- Amir Abboud
- Holger Dell
- et al.
- 2018
- STOC 2018
Conference paperFast and deterministic constant factor approximation algorithms for lcs imply new circuit lower bounds
- Amir Abboud
- Aviad Rubinstein
- 2018
- ITCS 2018
Conference paperReachability preservers: New extremal bounds and approximation algorithms
- Amir Abboud
- Greg Bodwin
- 2018
- SODA 2018
Conference paperMatching triangles and basing hardness on an extremely popular conjecture
- Amir Abboud
- Virginia Vassilevska Williams
- et al.
- 2018
- SIAM Journal on Computing
Paper