This article must adhere to the biographies of living persons (BLP) policy, even if it is not a biography, because it contains material about living persons. Contentious material about living persons that is unsourced or poorly sourcedmust be removed immediately from the article and its talk page, especially if potentially libellous. If such material is repeatedly inserted, or if you have other concerns, please report the issue to this noticeboard.If you are a subject of this article, or acting on behalf of one, and you need help, please see this help page.
This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:
This article is within the scope of WikiProject Biography, a collaborative effort to create, develop and organize Wikipedia's articles about people. All interested editors are invited to join the project and contribute to the discussion. For instructions on how to use this banner, please refer to the documentation.BiographyWikipedia:WikiProject BiographyTemplate:WikiProject Biographybiography articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
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)[reply]
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)[reply]
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)[reply]
