Noam Nisan: Difference between revisions
→Selected publications: Communication complexity book |
→External links: Add Wikipedia:Persondata using AWB (7961) |
||
| Line 55: | Line 55: | ||
*[http://scholar.google.com/citations?user=zXQZPnMAAAAJ Citations] on Google Scholar |
*[http://scholar.google.com/citations?user=zXQZPnMAAAAJ Citations] on Google Scholar |
||
{{Persondata |
|||
| NAME = Nisan, Noam |
|||
| ALTERNATIVE NAMES = |
|||
| SHORT DESCRIPTION = Computer scientist |
|||
| DATE OF BIRTH = |
|||
| PLACE OF BIRTH = |
|||
| DATE OF DEATH = |
|||
| PLACE OF DEATH = |
|||
}} |
|||
{{DEFAULTSORT:Nisan, Noam}} |
{{DEFAULTSORT:Nisan, Noam}} |
||
[[Category:Year of birth missing (living people)]] |
[[Category:Year of birth missing (living people)]] |
||
Revision as of 07:50, 3 March 2012
Noam Nisan 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.
Biography
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
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-0521872829).
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
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]
References
- ^ Curriculum vitae, retrieved 2012-03-01.
- ^ Noam Nisan at the Mathematics Genealogy Project
- ^ 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.
- ^ 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.
- ^ Nisan, Noam; Wigderson, Avi (1994), "Hardness vs randomness", J. Comput. Syst. Sci., 49 (2): 149–167, doi:10.1016/S0022-0000(05)80043-1.
- ^ 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.
- ^ Publisher's web site, retrieved 2012-03-01.
- ^ Bruno Award recipients, retrieved 2012-03-01.