Luca Trevisan is
a professor of electrical engineering and computer science at U.C. Berkeley and
a senior scientist at the Simons Institute for the Theory of Computing.
Luca received his Dottorato (PhD) in 1997,
from the *Sapienza* University of Rome, working with Pierluigi Crescenzi.
After graduating, Luca was a post-doc at MIT and at DIMACS, and he was
on the faculty of Columbia University, U.C. Berkeley, and Stanford, before
returning to Berkeley in 2014.

Luca's research is in theoretical computer science, and most of his work has been in two areas: (i) pseudo-randomness and its relation to average-case complexity and derandomization; and (ii) the theory of probabilistically checkable proofs and its relation to the approximability of combinatorial optimization problems. Lately, he has been working on spectral graph theory and its applications to graph algorithms.

Luca received the STOC'97 Danny Lewin (best student paper) award, the 2000 Oberwolfach Prize, and the 2000 Sloan Fellowship. He was an invited speaker at the 2006 International Congress of Mathematicians in Madrid.