Luca Trevisan is an associate professor of computer science at U.C. Berkeley. Luca received his Laurea (BSc) degree in 1993 and his Dottorato (PhD) in 1997, both from the University of Rome La Sapienza. Before coming to Berkeley in 2000, Luca was a post-doc at MIT and at DIMACS, and an assistant professor at Columbia University.

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.

Luca received the STOC'97 student paper award (now known as the Danny Lewin award), the 2000 Oberwolfach Prize, the 2000 Sloan Fellowship, the NSF Career Award and the Okawa Foundation Research Fellowship. He  lectured in the 2000 IAS/PCMI Summer School and he will be an invited speaker at ICM in Madrid.

Luca lives in San Francisco and hopes, one day, to be able to afford to buy a house there.

Last modified on March 2, 2006.