Noam Nisan
| Noam Nisan | |
|---|---|
| Native name | נעם ניסן |
| Born | June 20, 1961 |
| 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.
Nisan is the author of Using Hard Problems to Create Pseudorandom Generators (MIT Press, ACM Distinguished Dissertation Series, 1992, ) and the co-author with Eyal Kushilevitz of Communication Complexity (Cambridge University Press, 1997, , MR1426129). In addition, he co-edited Algorithmic Game Theory (Cambridge University Press, 2007, ).
He has written highly cited papers on mechanism design,combinatorial auctions, the computational complexity of pseudorandom number generators, and interactive proof systems, among other topics.
Nisan won an ACM Distinguished Dissertation Award for his Ph.D. thesis, on pseudorandom number generators. He won the Michael Bruno Memorial Award in 2004. 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. 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".
...
Wikipedia