Shlomo Moran is an Israeli computer scientist

Computer scientist

A computer scientist is a scientist who has acquired knowledge of computer science, the study of the theoretical foundations of information and computation and their application in computer systems....

, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa

Haifa

Haifa is the largest city in northern Israel, and the third-largest city in the country, with a population of over 268,000. Another 300,000 people live in towns directly adjacent to the city including the cities of the Krayot, as well as, Tirat Carmel, Daliyat al-Karmel and Nesher...

, Israel

Israel

The State of Israel is a parliamentary republic located in the Middle East, along the eastern shore of the Mediterranean Sea...

.

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".

In 1993 he shared the Gödel Prize

Gödel Prize

The Gödel Prize is a prize for outstanding papers in theoretical computer science, named after Kurt Gödel and awarded jointly by the European Association for Theoretical Computer Science and the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory .The...

 with László Babai

László Babai

László Babai is a Hungarian professor of mathematics and computer science at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields...

, Shafi Goldwasser

Shafi Goldwasser

Shafrira Goldwasser is the RSA Professor of electrical engineering and computer science at MIT, and a professor of mathematical sciences at the Weizmann Institute of Science, Israel.-Biography:...

, Silvio Micali

Silvio Micali

Silvio Micali is an Italian-born computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983. His research centers on the theory of cryptography and information...

, and Charles Rackoff

Charles Rackoff

Charles Weill Rackoff is an American cryptologist. Born and raised in New York City, Rackoff attended MIT as both an undergraduate and graduate student, and earned a Ph.D. degree in Computer Science in 1974. He spent a year as a postdoctoral scholar at INRIA in France.He currently works at the...

 for their work on Arthur–Merlin protocols and interactive proof system

Interactive proof system

In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to ascertain whether a given string belongs to a...

s.

External links

• Home page at the Technion