Talk:Russell Impagliazzo

Notability (academics)
Someone has challenged the notability of Impagliazzo. Let's discuss this.

I believe that Impagliazzo is academically notable. Given what I know about Impagliazzo at the moment, my best argument for his notability is that he is currently a member of the IAS. I think that this honor satisfies the second part of condition 3 for academic notability. Bender2k14 (talk) 03:31, 28 August 2010 (UTC)

Russell Impagliazzo is one of the foremost academics studying computational complexity theory, as those in the field will know. He's known for "Impagliazzo's Hard-Core Lemma", as well as a canonical proof of Ladner's Theorem (used in Arora and Barak) among other things. —Preceding unsigned comment added by Horacelamb (talk • contribs) 01:22, 5 October 2010 (UTC)

Microsoft Academic Search lists Impagliazzo (in the Algorithms and Theory top of authors) ahead of people like Stephen Cook, Nancy Lynch, Martin Abadi, and Laszlo Lovasz. Of course, an automatic algorithm that ranks people by citations is far from a perfect mechanism to judge the value of one's work. Still, you don't get to be ranked in Top 100 of all time in Algorithms and Theory unless you did something notable. Given this and the comments above, I will remove the notability question from the main article. Rgrig (talk) 15:06, 9 October 2013 (UTC)