Jump to content

Noam Nisan: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
→‎Selected publications: Communication complexity book
m add {{EATCS Award laureates}}
 
(46 intermediate revisions by 30 users not shown)
Line 1: Line 1:
{{Short description|Israeli computer scientist}}
⚫
'''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]].
{{Infobox scientist
| name = Noam Nisan
| native_name = נעם ניסן
| native_name_lang = he
| image = נעם ניסן.jpg
| image_size =
| alt =
| caption = Nisan in 2016
| birth_date = {{birth date and age|1961|06|20}}
| birth_place =
| death_date = <!--{{death date and age |YYYY|MM|DD |YYYY|MM|DD}} (death date then birth date)-->
| death_place =
| death_cause =
| resting_place =
| resting_place_coordinates = <!--{{coord|LAT|LONG|type:landmark|display=inline,title}}-->
| other_names =
| nationality = Israeli
| fields = [[Computer science]]
| workplaces = [[Hebrew University of Jerusalem]]<br />[[Microsoft Research]]
| patrons =
| education =
| alma_mater = [[Hebrew University of Jerusalem]]<br />[[University of California, Berkeley]]
| thesis_title = <!--(or | thesis1_title = and | thesis2_title = )-->
| thesis_url = <!--(or | thesis1_url = and | thesis2_url = )-->
| thesis_year = <!--(or | thesis1_year = and | thesis2_year = )-->
| doctoral_advisor = [[Richard M. Karp]]
| academic_advisors =
| doctoral_students = [[Michal Parnas]]
| notable_students =
| known_for =
| influences =
| influenced =
| awards = [[Gödel Prize]] (2012)<br /> [[Knuth Prize]] (2016)<br /> [[EATCS Award]] (2018)
| author_abbrev_bot =
| author_abbrev_zoo =
| spouse = <!--(or | spouses = )-->
| partner = <!--(or | partners = )-->
| children =
| signature = <!--(filename only)-->
| signature_alt =
| website = <!--{{URL|www.example.com}}-->
| footnotes =
}}

⚫
'''Noam Nisan''' ({{lang-he|נעם ניסן}}; 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]].


==Biography==
==Biography==
Line 5: Line 50:


==Selected publications==
==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, {{MR|1426129}}). In addition, he co-edited ''Algorithmic Game Theory'' (Cambridge University Press, 2007, ISBN 978-0521872829).
Nisan is the author of ''[https://mitpress.mit.edu/books/using-hard-problems-create-pseudorandom-generators Using Hard Problems to Create Pseudorandom Generators]'' ([[MIT Press]], ACM Distinguished Dissertation Series, 1992), co-author with Eyal Kushilevitz of the book ''[https://www.cambridge.org/core/books/communication-complexity/427E022FCBAC3FB5CEE4D39008D1E118 Communication Complexity]'' ([[Cambridge University Press]], 1997), and co-author with Shimon Schocken of ''[https://mitpress.mit.edu/books/elements-computing-systems The Elements of Computing Systems: Building a Modern Computer from First Principles]'' (The MIT Press, 2005). In 2007 he co-edited the book ''[https://www.cambridge.org/core/books/algorithmic-game-theory/0092C07CA8B724E1B1BE2238DDD66B38 Algorithmic Game Theory]'' (Cambridge University Press, 2007).


He has written highly cited papers on [[mechanism design]],<ref>{{citation
He has written highly cited papers on [[mechanism design]],<ref name="nr99">{{citation
| last1 = Nisan | first1 = Noam
| last1 = Nisan | first1 = Noam
| last2 = Ronen | first2 = Amir
| last2 = Ronen | first2 = Amir
Line 14: Line 59:
| pages = 129–140
| pages = 129–140
| title = Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99)
| title = Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99)
| year = 1999}}.</ref>
| year = 1999| s2cid = 8316937
| doi-access = free
}}.</ref>
[[combinatorial auction]]s,<ref>{{citation
[[combinatorial auction]]s,<ref>{{citation
| last = Nisan | first = Noam
| last = Nisan | first = Noam
Line 21: Line 68:
| pages = 1–12
| pages = 1–12
| title = Proceedings of the 2nd ACM Conference on Electronic Commerce (EC '00)
| title = Proceedings of the 2nd ACM Conference on Electronic Commerce (EC '00)
| year = 2000}}.</ref>
| year = 2000| s2cid = 8982056
}}.</ref>
the [[computational complexity]] of [[pseudorandom number generator]]s,<ref>{{citation
the [[Computational complexity theory|computational complexity]] of [[pseudorandom number generator]]s,<ref>{{citation
| last1 = Nisan | first1 = Noam
| last1 = Nisan | first1 = Noam
| last2 = Wigderson | first2 = Avi | author2-link = Avi Wigderson
| last2 = Wigderson | first2 = Avi | author2-link = Avi Wigderson
Line 31: Line 79:
| title = Hardness vs randomness
| title = Hardness vs randomness
| volume = 49
| volume = 49
| year = 1994}}.</ref> and [[interactive proof system]]s,<ref>{{citation
| year = 1994| doi-access = free
}}.</ref> and [[interactive proof system]]s,<ref>{{citation
| last1 = Lund | first1 = Carsten | author1-link = Carsten Lund
| last1 = Lund | first1 = Carsten | author1-link = Carsten Lund
| last2 = Fortnow | first2 = Lance | author2-link = Lance Fortnow
| last2 = Fortnow | first2 = Lance | author2-link = Lance Fortnow
Line 42: Line 91:
| title = Algebraic methods for interactive proof systems
| title = Algebraic methods for interactive proof systems
| volume = 39
| volume = 39
| year = 1992}}.</ref>
| year = 1992| s2cid = 207170996 | doi-access = free
}}.</ref>
among other topics.
among other topics.


==Awards and honors==
==Awards and honors==
Nisan won an [[Association for Computing Machinery|ACM]] Distinguished Dissertation Award for his Ph.D. thesis, on [[pseudorandom number generator]]s.<ref>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=9809 Publisher's web site], retrieved 2012-03-01.</ref> He won the [[Michael Bruno]] Memorial Award in 2004.<ref>[http://www.yadhanadiv.org.il/node/616/view/recipients Bruno Award recipients], retrieved 2012-03-01.</ref>
Nisan won an [[Association for Computing Machinery|ACM]] Distinguished Dissertation Award for his Ph.D. thesis, on [[pseudorandom number generator]]s.<ref>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=9809 Publisher's web site], retrieved 2012-03-01.</ref> He won the [[Michael Bruno (economist)|Michael Bruno]] Memorial Award in 2004.<ref>[http://www.yadhanadiv.org.il/node/616/view/recipients Bruno Award recipients] {{Webarchive|url=https://web.archive.org/web/20181012023047/http://www.yadhanadiv.org.il/node/616/view/recipients |date=2018-10-12 }}, retrieved 2012-03-01.</ref> 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.<ref>{{citation|url=http://www.acm.org/press-room/news-releases/2012/goedel-prize-2012|title=ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish Internet Use|publisher=[[ACM SIGACT]]|date=May 16, 2012|access-date=May 16, 2012|url-status=dead|archive-url=https://web.archive.org/web/20130718154540/http://www.acm.org/press-room/news-releases/2012/goedel-prize-2012|archive-date=July 18, 2013}}.</ref>

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".<ref>{{citation|url=http://www.acm.org/media-center/2016/september/knuth-prize-2016|title=ACM Awards Knuth Prize to Pioneer of Algorithmic Game Theory|publisher=ACM|date=September 8, 2016}}</ref>

In 2018 he won the [[Yad Hanadiv|Rothschild Prize]]<ref>{{Cite web|url=https://www.cs.huji.ac.il/item/news/1812|title=The Rachel and Selim Benin School of Computer Science and Engineering {{!}} The Rachel and Selim Benin School of Computer Science and Engineering {{!}} The Hebrew University|website=www.cs.huji.ac.il|access-date=2019-09-11}}</ref> and the [https://eatcs.org/index.php/component/content/article/1-news/2642-the-eatcs-award-2018-laudatio-for-noam-nisan- EATCS Award] for "his decisive influence on a range of areas in computational complexity theory and for algorithmic mechanism design, an elegant and rigorous computational theory that aptly informs economics".


==References==
==References==
Line 53: Line 107:
==External links==
==External links==
*[http://www.cs.huji.ac.il/~noam/ Home page] at the Hebrew University
*[http://www.cs.huji.ac.il/~noam/ Home page] at the Hebrew University
*[http://scholar.google.com/citations?user=zXQZPnMAAAAJ Citations] on Google Scholar
*[https://scholar.google.com/citations?user=zXQZPnMAAAAJ Citations] on Google Scholar

{{Gödel winners}}
{{Knuth Prize laureates}}
{{EATCS Award laureates}}

{{Authority control}}


{{DEFAULTSORT:Nisan, Noam}}
{{DEFAULTSORT:Nisan, Noam}}
[[Category:Year of birth missing (living people)]]
[[Category:1961 births]]
[[Category:Living people]]
[[Category:Living people]]
[[Category:Israeli computer scientists]]
[[Category:Israeli computer scientists]]
Line 62: Line 122:
[[Category:Hebrew University of Jerusalem alumni]]
[[Category:Hebrew University of Jerusalem alumni]]
[[Category:University of California, Berkeley alumni]]
[[Category:University of California, Berkeley alumni]]
[[Category:Hebrew University of Jerusalem faculty]]
[[Category:Academic staff of the Hebrew University of Jerusalem]]
[[Category:Gödel Prize laureates]]
[[Category:Knuth Prize laureates]]

Latest revision as of 22:15, 31 March 2023

Noam Nisan
נעם ניסן
Nisan in 2016
Born (1961-06-20) June 20, 1961 (age 63)
NationalityIsraeli
Alma materHebrew University of Jerusalem
University of California, Berkeley
AwardsGödel Prize (2012)
Knuth Prize (2016)
EATCS Award (2018)
Scientific career
FieldsComputer science
InstitutionsHebrew University of Jerusalem
Microsoft Research
Doctoral advisorRichard M. Karp
Doctoral studentsMichal Parnas

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.

Biography

[edit]

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), co-author with Eyal Kushilevitz of the book Communication Complexity (Cambridge University Press, 1997), and co-author with Shimon Schocken of The Elements of Computing Systems: Building a Modern Computer from First Principles (The MIT Press, 2005). In 2007 he co-edited the book Algorithmic Game Theory (Cambridge University Press, 2007).

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]

In 2018 he won the Rothschild Prize[11] and the EATCS Award for "his decisive influence on a range of areas in computational complexity theory and for algorithmic mechanism design, an elegant and rigorous computational theory that aptly informs economics".

References

[edit]
  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, S2CID 8316937.
  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, S2CID 8982056.
  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, S2CID 207170996.
  7. ^ Publisher's web site, retrieved 2012-03-01.
  8. ^ Bruno Award recipients Archived 2018-10-12 at the Wayback Machine, 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, archived from the original on July 18, 2013, retrieved May 16, 2012.
  10. ^ ACM Awards Knuth Prize to Pioneer of Algorithmic Game Theory, ACM, September 8, 2016
  11. ^ "The Rachel and Selim Benin School of Computer Science and Engineering | The Rachel and Selim Benin School of Computer Science and Engineering | The Hebrew University". www.cs.huji.ac.il. Retrieved 2019-09-11.
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Noam_Nisan&oldid=1147583733"