Amir Abboud

Amir Abboud is a Senior Scientist (equivalent to Associate Professor) in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science, where his research centers on theoretical computer science with primary focus on fine-grained complexity. This field investigates exact computational complexity of fundamental problems to establish tight upper and lower bounds.

His educational credentials include:

• Ph.D. from Stanford University
• M.Sc. from the Technion
• B.Sc. from the University of Haifa (via the "Etgar" program)

Abboud's research spans graph theory and algorithms, dynamic data structures, pattern matching, sequence alignment, exact algorithms, parameterized complexity, distributed computing, and circuit complexity. His work bridges theoretical insights with practical algorithmic advancements, particularly in understanding computational limits within polynomial time.

Analysis of his publications (2014-2022) reveals consistent focus on fine-grained complexity applications to graph algorithms and dynamic problems. Key contributions include breakthroughs in Gomory-Hu tree computation, hardness of approximation frameworks, and conditional lower bounds for dynamic data structures. His research demonstrates how conjectures about fundamental problems (e.g., SETH, 3SUM) propagate to diverse computational domains.

Scientific awards: No specific prizes, fellowships, or medals are documented in the source material.

Advising and grants: The provided text contains no information regarding graduate students supervised, postdoctoral mentoring, or research funding received.

Labs and teams: No details about laboratory leadership, research groups, or collaborative teams are mentioned in the available documentation.