French
DeutschShlomo Moran
Shlomo Moran | |
|---|---|
שלמה מורן | |
| Born | 1947 |
| Alma mater | Technion – Israel Institute of Technology |
| Known for | Arthur–Merlin protocols, interactive proof systems |
| Awards | Gödel Prize (1993) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Technion – Israel Institute of Technology |
| Doctoral advisor | Azaria Paz |
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]
Several PhD students of Moran joined the academia as well, including Shlomi Dolev, Ilan Gronau, Shay Kutten, and Gadi Taubenfeld.
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
[edit]- ^ 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
[edit]- Home page at the Technion
