Noam Nisan

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Noam Nisan
Native name נעם ניסן
Born (1961-06-20) June 20, 1961 (age 55)
Residence Rehovot, Israel
Nationality Israel
Fields Computer science
Institutions Hebrew University of Jerusalem
Microsoft Research
Alma mater Hebrew University of Jerusalem
University of California, Berkeley
Doctoral advisor Richard M. Karp
Notable awards Gödel Prize (2012)
Knuth Prize (2016)

Noam Nisan (Hebrew: נעם ניסן‎‎; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.


Nisan did his undergraduate studies at the Hebrew University, graduating in 1984. He went to the University of California, Berkeley for graduate school, and received a Ph.D. in 1988 under the supervision of Richard Karp. After postdoctoral studies at the Massachusetts Institute of Technology he joined the Hebrew University faculty in 1990.[1][2]

Selected publications[edit]

Nisan is the author of Using Hard Problems to Create Pseudorandom Generators (MIT Press, ACM Distinguished Dissertation Series, 1992, ISBN 978-0-262-64052-7) and the co-author with Eyal Kushilevitz of Communication Complexity (Cambridge University Press, 1997, ISBN 0-521-56067-5, MR1426129). In addition, he co-edited Algorithmic Game Theory (Cambridge University Press, 2007, ISBN 978-0-521-87282-9).

He has written highly cited papers on mechanism design,[3] combinatorial auctions,[4] the computational complexity of pseudorandom number generators,[5] and interactive proof systems,[6] among other topics.

Awards and honors[edit]

Nisan won an ACM Distinguished Dissertation Award for his Ph.D. thesis, on pseudorandom number generators.[7] He won the Michael Bruno Memorial Award in 2004.[8] In 2012 he won the Gödel Prize, shared with five other recipients, for his work with Amir Ronen in which he coined the phrase "algorithmic mechanism design" and presented many applications of this type of problem within computer science.[9] He won the Knuth Prize in 2016 "for fundamental and lasting contributions to theoretical computer science in areas including communication complexity, pseudorandom number generators, interactive proofs, and algorithmic game theory".[10]


  1. ^ Curriculum vitae, retrieved 2012-03-01.
  2. ^ Noam Nisan at the Mathematics Genealogy Project
  3. ^ Nisan, Noam; Ronen, Amir (1999), "Algorithmic mechanism design", Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99), pp. 129–140, doi:10.1145/301250.301287 .
  4. ^ Nisan, Noam (2000), "Bidding and allocation in combinatorial auctions", Proceedings of the 2nd ACM Conference on Electronic Commerce (EC '00), pp. 1–12, doi:10.1145/352871.352872 .
  5. ^ Nisan, Noam; Wigderson, Avi (1994), "Hardness vs randomness", J. Comput. Syst. Sci., 49 (2): 149–167, doi:10.1016/S0022-0000(05)80043-1 .
  6. ^ Lund, Carsten; Fortnow, Lance; Karloff, Howard; Nisan, Noam (1992), "Algebraic methods for interactive proof systems", J. ACM, 39 (4): 859–868, doi:10.1145/146585.146605 .
  7. ^ Publisher's web site, retrieved 2012-03-01.
  8. ^ Bruno Award recipients, retrieved 2012-03-01.
  9. ^ ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish Internet Use, ACM SIGACT, May 16, 2012, retrieved May 16, 2012 .
  10. ^ ACM Awards Knuth Prize to Pioneer of Algorithmic Game Theory, ACM, September 8, 2016 

External links[edit]