Luca Trevisan is a Professor of computer science at Bocconi University. Luca received his PhD in 1997 from the Sapienza University of Rome, working with Pierluigi Crescenzi. After graduating, Luca was a postdoc at MIT and at DIMACS. Luca was on the faculty of Columbia University, UC Berkeley, and Stanford, before returning to Berkeley in 2014 and, at long last, returning to Italy in 2019.
Luca's research is in theoretical computer science, with a focus on computational complexity, on the analysis of algorithms, on the foundations of cryptography, and on topics at the intersection of theoretical computer science and pure mathematics. Luca received the STOC'97 Danny Lewin (best student paper) award, the 2000 Oberwolfach Prize, the 2000 Sloan Fellowship and an NSF CAREER Award. He was an invited speaker at the 2006 International Congress of Mathematicians. In 2019, he received an ERC Advanced Grant.
- Computational Complexity of Statistical Inference, Fall 2021. Visiting Scientist and Workshop Organizer.
- Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion, Summer 2019. Visiting Scientist.
- Pseudorandomness, Spring 2017. Visiting Scientist, Program Organizer and Workshop Organizer.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist and Program Organizer.
- Real Analysis in Computer Science, Fall 2013. Visiting Scientist, Program Organizer and Workshop Organizer.