Scholar
Amir Abboud
Google Scholar ID: LDttuSAAAAAJ
Weizmann Institute of Science
Citations & Impact
Citations
2,531
H-index
31
i10-index
48
Publications
20
Co-authors
0
Publications
Resume (English only)
Academic Achievements
- Selected Papers:
- - Gomory-Hu Tree in Subcubic Time
- - Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs
- - Distributed PCP Theorems and Hardness of Approximation in P
- - The 4/3 Additive Spanner Exponent is Tight
- - Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made
- - If the Current Clique Algorithms are Optimal, so is Valiant's Parser
- - Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
Research Experience
- Current Position: Senior Scientist, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science. Previously: Research Staff Member at IBM Almaden Research Center.
Education
- Ph.D.: Stanford University; M.Sc.: Technion; B.Sc.: University of Haifa (via the 'Etgar' program).
Background
- Research Interests: Theory of Computation, broadly. Main focus is on 'Fine-Grained Complexity' aiming to understand the exact computational complexity of basic and fundamental problems. Other topics include: Graph Theory and Algorithms, Dynamic Data Structures, Pattern Matching and Sequence Alignment, Exact Algorithms and Parameterized Complexity, Distributed Computing, and Circuit Complexity.
Miscellany
- PC Member: FOCS 2023, ICALP 2023, STOC 2023, SWAT 2022, SODA 2022, SOSA 2022, ESA 2020, CPM 2020, IPEC 2019, STOC 2019, FOCS 2018, CPM 2016
Co-authors