Yuval Filmus recently completed his PhD at the University of Toronto, under the supervision of Toni Pitassi. He completed his MSc at the Weizmann institute, under the supervision of Uri Feige. His research interests are varied and include computational complexity, proof complexity, approximation algorithms and combinatorics. He is especially interested in applications of real analysis to complexity and combinatorics. Recently, he has been collaborating with David Ellis and Ehud Friedgut on the applications of Fourier analysis to combinatorics. Their joint work includes a proof of a conjecture by Simonovits and Sós on triangle-intersecting families of graphs, which had been open for twenty-five years.
- Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion, Summer 2019. Visiting Scientist.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Scientist.
- Real Analysis in Computer Science, Fall 2013. Research Fellow.