Gourt Home::Gourt :: 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 at Berkeley. His advisor was Manuel Blum. He spent two years as a postdoc at the University of Toronto.
Russell Impagliazzo has had a big red beard for most of professional life and is recognized by this, at least within the UCSD computer science department, and the FOCS/STOC/Complexity circle of computer science researchers. He does all of his professional talks with hand-drawn slides and frequently inserts himself as a cartoon character observer of mathematical events. The only way the audience can identify the highly abstracted stick figure as Prof. Impagliazzo is by the pronounced red beard.
Impagliazzo is well respected in the field of computational complexity for such contributions as: 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.
Awards and honors
- Guggenheim Fellowship, 2004.
- Outstanding Paper Award, Society of Industrial and Applied Mathematicians, 2003.
- Best Paper Award at STOC, 2003.
External links
"Russell Impagliazzo"