Luca Trevisan is a professor of computer science at Stanford University. 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 in 1997-98 and at DIMACS in 1998, an assistant professor at Columbia University in 1999-2000, and on the faculty of the University of California, Berkeley from 2000 to 2010. He joined Stanford University in 2010.

Luca's research is in theoretical computer science, and most of his work has been in two areas: (i) the relation between pseudorandomness, derandomization,  average-case complexity, coding theory, and the explicit construction of expander-like graphs; and (ii) the theory of probabilistically checkable proofs and its relation to the approximability of combinatorial optimization problems. In the past three years he has been working on spectral graph theory and its applications to graph algorithmns.

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.

Luca lives, beyond his means, in San Francisco. When out of town, he can often be found in New York, Rome, or Beijing.