Shlomo Moran

from Wikipedia, the free encyclopedia

Shlomo Moran ( Hebrew שלמה מורן, English transcription Shlomo Moran, * 1947 ) is an Israeli computer scientist.

Moran received his doctorate in 1979 at the Technion in Haifa with Azaria Paz ( NP optimization problems and their approximation ). He is a professor of computer science at the Technion.

Moran deals with complexity theory , but also, for example, with phylogenetic trees and web search engines as well as with graph theory . In 1993 he received the Gödel Prize for his work with László Babai on the introduction of interactive evidence systems in 1985 (independent of Goldwasser , Micali , Rackoff at the same time). He and Babai wrote the Arthur Merlin Protocol.

Web links

Individual evidence

  1. ↑ László Babai, Shlomo Moran: Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes , Journal of Computer and System Sciences, Volume 36, 1988, pp. 254-276
personal data
SURNAME Moran, Schlomo
ALTERNATIVE NAMES Moran, Shlomo; שלמה מורן (Hebrew)
BRIEF DESCRIPTION Israeli computer scientist
DATE OF BIRTH 1947