Luca Trevisan

from Wikipedia, the free encyclopedia
Luca Trevisan

Luca Trevisan (born July 21, 1971 in Rome ) is an Italian mathematician and computer scientist.

Trevisan received his doctorate in 1997 from the University of La Sapienza in Rome under Pierluigi Crescenzi with the dissertation Reductions and (Non-) Approximability . He was a post-doc at MIT and in 1998 at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University and Princeton University . He was an assistant professor at Columbia University and is currently a professor at the University of California, Berkeley .

He deals with complexity theory, cryptography, approximation algorithms in combinatorial optimization, randomness problems in computability theory.

In 2000 he received the Oberwolfach Prize and was a Sloan Fellow that same year. In 2006 he was invited speaker at the ICM in Madrid (pseudorandomness and combinatorial constructions).

Web links

Individual evidence

  1. Luca Trevisan in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used