Shlomo Moran
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 ; his dissertation was entitled "NP Optimization Problems and their Approximation".[2]
Several PhD students of Moran joined the academia as well, including Shlomi Dolev, , Shay Kutten, and .
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]
References[]
- ^ Faculty profile, the Technion, retrieved 2010-12-02.
- ^ Shlomo Moran at the Mathematics Genealogy Project.
- ^ 1993 Gödel Prize Archived 2015-12-08 at the Wayback Machine, ACM SIGACT, retrieved 2010-12-02.
External links[]
- Home page at the Technion
| show Authority control  |
|---|
Categories:
- Living people
- 1947 births
- Theoretical computer scientists
- Israeli computer scientists
- Technion – Israel Institute of Technology alumni
- Technion – Israel Institute of Technology faculty
- Gödel Prize laureates