Shlomo Moran

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Shlomo Moran (Hebrew: שלמה מורן‎‎; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel.[1]

Moran received his Ph.D. in 1979 from the Technion, under the supervision of Azaria Paz; his dissertation was entitled "NP Optimization Problems and their Approximation".[2]

In 1993 he shared the Gödel Prize with László Babai, Shafi Goldwasser, Silvio Micali, and Charles Rackoff for their work on Arthur–Merlin protocols and interactive proof systems.[3]


  1. ^ Faculty profile, the Technion, retrieved 2010-12-02.
  2. ^ Shlomo Moran at the Mathematics Genealogy Project.
  3. ^ 1993 Gödel Prize, ACM SIGACT, retrieved 2010-12-02.

External links[edit]