معرفی
Dr. Amir Abboud is a Senior Scientist in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science, a leading research institution in Israel. His work is centered on the theory of computation, particularly fine-grained complexity, aiming to establish exact computational complexity bounds for fundamental problems.
Research Interests: Amir Abboud's research spans a broad spectrum of theoretical computer science, with a primary focus on Fine-Grained Complexity. He investigates conditional lower bounds based on popular conjectures such as SETH and 3SUM. His work extends to graph algorithms, dynamic data structures, pattern matching, sequence alignment, exact and parameterized algorithms, distributed computing, and circuit complexity. He employs deep connections between parsing, clique problems, edit distance, and spanner constructions to derive new hardness results.
Publication Trends: His recent publications, appearing in top venues like FOCS and STOC, reveal a consistent focus on proving conditional lower bounds and developing improved algorithms for graph problems. Themes include subcubic algorithms for Gomory-Hu trees, additive spanners, and the interplay between parsing and clique detection. His work often bridges algorithmic improvements with complexity-theoretic limitations.
Scientific Service:
- Program Committee Member, FOCS 2023
- Program Committee Member, ICALP 2023
- Program Committee Member, STOC 2023
- Program Committee Member, SWAT 2022
- Program Committee Member, SODA 2022
- Program Committee Member, SOSA 2022
- Program Committee Member, ESA 2020
- Program Committee Member, CPM 2020
- Program Committee Member, IPEC 2019
- Program Committee Member, STOC 2019
- Program Committee Member, FOCS 2018
- Program Committee Member, CPM 2016
Advising and Grants: While the text does not list any formal students or advisees, Dr. Abboud leads significant research in theoretical computer science and collaborates with top researchers worldwide. His publication record and program committee roles indicate a well-funded and influential research trajectory, likely supported by institutional and national research grants, though specific grants are not mentioned.
Labs and Research Groups: Dr. Abboud is affiliated with the theoretical computer science group at the Weizmann Institute of Science. He also organizes a Course on Fine-Grained Complexity and is part of a research group focused on algorithms and complexity, as indicated by the website structure.
