Hamed Hatami

Hamed Hatami is an Associate Professor in the School of Computer Science at McGill University. His research focuses on Computational Complexity and Discrete Mathematics, with an emphasis on analytic methods. He is also affiliated with the Department of Mathematics and Statistics as an Associate Member. Prior to joining McGill, he was a Veblen Fellow at the Institute for Advanced Study and Princeton University, and a PhD student at the University of Toronto. His current research interests include Learning Theory, Complexity Theory, Analysis of Boolean Functions, and Additive Combinatorics. He teaches courses such as Advanced Complexity Theory and Analysis of Boolean Functions.

Hamed Hatami is an Assistant Professor in the Department of Computer Science at McGill University, specializing in analytic methods in combinatorics and theoretical computer science. His research focuses on graph theory, combinatorial optimization, and theoretical aspects of computer science. Hatami's work includes studies on edge coloring, graph norms, homomorphism densities, and the complexity of constraint satisfaction problems. His publications explore topics such as the adjacent vertex distinguishing edge chromatic number, Sidorenko’s conjecture, and the implicit graph conjecture. His research contributes to understanding structural properties of graphs and their applications in computational theory.