Russell Impagliazzo

Russell Impagliazzo is a professor of computer science at the University of California, San Diego. He received his doctorate from the University of California, Berkeley. His advisor was Manuel Blum. He spent two years as a postdoc at the University of Toronto. He is a 2004 Guggenheim fellow.

Impagliazzo's contributions to the field to computational complexity include: the construction of a pseudo-random generator from any one-way function, his proof of the XOR lemma via "hard core sets", his work on break through results in propositional proof complexity, such as the exponential size lower bound for constant-depth Hilbert proofs of the pigeonhole principle and the introduction of the polynomial calculus system, his work on connections between computational hardness and derandomization, and a recent break-through work on the construction of multi-source seedless extractors. He has contributed to 40 papers on topics within his specialities.

External links

* [http://www-cse.ucsd.edu/users/russell/ Russell Impagliazzo home page]
* [http://www.jacobsschool.ucsd.edu/faculty/faculty_bios/findprofile.pl?fmp_recid=112 UCSD Jacobs, School of Engineering faculty profile]