Noam Nisan

from Wikipedia, the free encyclopedia
Noam Nisan

Noam Nisan (* 1961 ) is an Israeli computer scientist . He is a professor at the Hebrew University in Jerusalem .

Nisan received his bachelor's degree summa cum laude from the Hebrew University in 1984 , was a software engineer at Clarity Systems in Herzelia ( CAD for VLSI systems) in 1984/85 and then continued his studies at the University of California, Berkeley , with the Master's degree and PhD in 1988 with Richard Karp (Complexity of Pseudonumber Generation). He has been at the Hebrew University since 1990 with a full professorship since 1997.

From 2007 to 2009 he did research for Google Research in Tel Aviv.

He deals with the complexity of random number generators, algorithmic game theory (special electronic markets and auctions) and interactive evidence systems. From 1998 to 2002 he was the founder and CTO of the software company SeeRun.

For 2018, Nisan was awarded the EATCS Award and the Rothschild Prize . In 2016 he received the Knuth Prize and in 2012, together with Amir Ronen, the Gödel Prize for work on algorithmic game theory, in which they introduced the term Algorithmic Mechanism Design . In 2004 Nisan received the Bruno Award. In 1994 he was invited speaker at the International Congress of Mathematicians in Zurich (pseudorandom generators for derandomization of algorithms).


  • Using Hard Problems to Create Pseudorandom Generators , MIT Press * with Eyal Kushilevitz Communication Complexity , Cambridge University Press, 1997
  • Editor with Éva Tardos , Tim Roughgarden , Vijay Vazirani : Algorithmic Game Theory , Cambridge University Press, 2007
  • with Avi Wigderson Hardness vs randomness , J. Comput. Syst. Sci. 49, 1994, 149-167
  • with Carsten Lund , Lance Fortnow , Howard Karloff Algebraic methods for interactive proof systems , J. ACM 39, 1992, 859-868
  • Bidding and allocation in combinatorial auctions , Proceedings of the 2nd ACM Conference on Electronic Commerce (EC '00), 2000, pp. 1-12

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. Nisan, Amir Ronen Algorithmic mechanism design , Proc. 31. ACM Symp. Theory of Computing (STOC), 1999, pp. 129-140, pdf