This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate? Excessive Violence Sexual Content Political / Social
Email Address:
Article Id: WHEBN0029861804 Reproduction Date:
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]
Jerusalem, West Bank, Hebrew language, Tel Aviv, Syria
Arabic language, Israel, Jerusalem, Hebrew alphabet, Ethnologue
Computer science, Cryptography, Massachusetts Institute of Technology, Weizmann Institute of Science, Carnegie Mellon University
Nobel Prize in chemistry, Albert Einstein, Nobel Laureates, Dan Shechtman, Google
Authority control, France, University of Bordeaux, Gödel Prize, Shafi Goldwasser
Computer science, Belgium, University of Liège, Gödel Prize, Moshe Y. Vardi
Dead Sea Scrolls, Big data, Gödel Prize, Google Trends, Tel Aviv University
Tokyo, Nihon University, Tokyo Institute of Technology, Gödel Prize, Computational complexity theory