. "1080649513"^^ . . . . . . . "Schlomo Moran (hebr\u00E4isch \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF, englische Transkription Shlomo Moran, * 1947) ist ein israelischer Informatiker. Moran wurde 1979 am Technion in Haifa bei promoviert (NP optimization problems and their approximation). Er ist Professor f\u00FCr Informatik am Technion. Moran besch\u00E4ftigt sich mit Komplexit\u00E4tstheorie, aber auch zum Beispiel mit phylogenetischen B\u00E4umen und Web-Suchmaschinen sowie mit Graphentheorie. 1993 erhielt er den G\u00F6del-Preis f\u00FCr seine Arbeit mit L\u00E1szl\u00F3 Babai zur Einf\u00FChrung interaktiver Beweissysteme 1985 (unabh\u00E4ngig von Goldwasser, Micali, Rackoff zur gleichen Zeit). Von ihm und Babai stammt das Arthur-Merlin-Protokoll."@de . . . . . . . . "Shlomo Moran (Hebrew: \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion \u2013 Israel Institute of Technology in Haifa, Israel. Moran received his Ph.D. in 1979 from the Technion, under the supervision of ; his dissertation was entitled \"NP Optimization Problems and their Approximation\". Several PhD students of Moran joined the academia as well, including Shlomi Dolev, , Shay Kutten, and ."@en . . . . . . . . . "\u041C\u043E\u0440\u0430\u043D, \u0428\u043B\u043E\u043C\u043E"@ru . . . . . "Shlomo Moran, n\u00E9 en 1947, est un informaticien isra\u00E9lien, titulaire de la chaire Bernard Elkin en informatique au Technion (Institut isra\u00E9lien de technologie) \u00E0 Ha\u00EFfa, en Isra\u00EBl. Shlomo Moran obtient un doctorat (Ph.D.) en 1979 au Technion, sous la direction d'Azaria Paz. Sa th\u00E8se est intitul\u00E9e NP Optimization Problems and their Approximation. En 1993 il obtient, conjointement avec L\u00E1szl\u00F3 Babai, Shafi Goldwasser, Silvio Micali, et Charles Rackoff, le prix G\u00F6del pour leurs travaux sur les syst\u00E8mes de preuves interactives et notamment le protocole Arthur-Merlin"@fr . . . . "\u0634\u0644\u0648\u0645\u0648 \u0645\u0648\u0631\u0627\u0646"@ar . . . "1735"^^ . . "29861804"^^ . . . . "\u0428\u043B\u043E\u043C\u043E \u041C\u043E\u0440\u0430\u043D (\u0438\u0432\u0440. \u200F\u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF\u200F\u200E, \u0440.1947) \u2014 \u0438\u0437\u0440\u0430\u0438\u043B\u044C\u0441\u043A\u0438\u0439 \u0441\u043F\u0435\u0446\u0438\u0430\u043B\u0438\u0441\u0442 \u0432 \u043E\u0431\u043B\u0430\u0441\u0442\u0438 \u043A\u043E\u043C\u043F\u044C\u044E\u0442\u0435\u0440\u043D\u044B\u0445 \u043D\u0430\u0443\u043A, \u043B\u0430\u0443\u0440\u0435\u0430\u0442 \u043C\u0435\u0436\u0434\u0443\u043D\u0430\u0440\u043E\u0434\u043D\u044B\u0445 \u043F\u0440\u0435\u043C\u0438\u0439."@ru . . "Shlomo Moran (Hebrew: \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion \u2013 Israel Institute of Technology in Haifa, Israel. Moran received his Ph.D. in 1979 from the Technion, under the supervision of ; his dissertation was entitled \"NP Optimization Problems and their Approximation\". Several PhD students of Moran joined the academia as well, including Shlomi Dolev, , Shay Kutten, and . In 1993 he shared the G\u00F6del Prize with L\u00E1szl\u00F3 Babai, Shafi Goldwasser, Silvio Micali, and Charles Rackoff for their work on Arthur\u2013Merlin protocols and interactive proof systems."@en . . . . . . . . . . "\u0634\u0644\u0648\u0645\u0648 \u0645\u0648\u0631\u0627\u0646 (\u0628\u0627\u0644\u0639\u0628\u0631\u064A\u0629: \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF\u200F) \u0647\u0648 \u0639\u0627\u0644\u0645 \u062D\u0627\u0633\u0648\u0628 \u0625\u0633\u0631\u0627\u0626\u064A\u0644\u064A\u060C \u0648\u0644\u062F \u0641\u064A 1947. \u0639\u0645\u0644 \u0628\u0631\u0648\u0641\u064A\u0633\u0648\u0631\u0627\u064B \u0641\u064A \u0639\u0644\u0648\u0645 \u0627\u0644\u0643\u0645\u0628\u064A\u0648\u062A\u0631 \u0641\u064A \u0627\u0644\u062A\u062E\u0646\u064A\u0648\u0646 (\u0648\u0647\u0648 \u0645\u0639\u0647\u062F \u0625\u0633\u0631\u0627\u0626\u064A\u0644 \u0644\u0644\u062A\u0643\u0646\u0648\u0644\u0648\u062C\u064A\u0627) \u0641\u064A \u062D\u064A\u0641\u0627 \u0641\u064A \u0625\u0633\u0631\u0627\u0626\u064A\u0644 . \u062D\u0635\u0644 \u0639\u0644\u0649 \u062F\u0631\u062C\u0629 \u0627\u0644\u062F\u0643\u062A\u0648\u0631\u0627\u0647 \u0641\u064A \u0639\u0627\u0645 1979 \u0645\u0646 \u0627\u0644\u062A\u062E\u0646\u064A\u0648\u0646 \u062A\u062D\u062A \u0627\u0634\u0631\u0627\u0641 \u0623\u0632\u0627\u0631\u064A\u0627 \u0628\u0627\u0632. \u0641\u064A \u0639\u0627\u0645 1993 \u062D\u0635\u0644 \u0639\u0644\u0649 \u062C\u0627\u0626\u0632\u0629 \u062C\u0648\u062F\u0644 \u0628\u0627\u0644\u0627\u0634\u062A\u0631\u0627\u0643 \u0645\u0639 \u0644\u0627\u0632\u0644\u0648 \u0628\u0627\u0628\u0627\u064A \u0648\u0634\u0627\u0641\u064A \u063A\u0648\u0644\u0641\u0627\u0633\u0631 \u0648\u0633\u064A\u0644\u0641\u064A\u0648 \u0645\u064A\u0643\u0627\u0644\u064A \u0648\u0634\u0627\u0631\u0644 \u0631\u0627\u0643\u0648\u0641\u060C \u0644\u0639\u0645\u0644\u0647\u0645 \u0639\u0644\u0649 \u0628\u0631\u0648\u062A\u0648\u0643\u0648\u0644\u0627\u062A \u0622\u0631\u062B\u0631 \u0645\u064A\u0631\u0644\u064A\u0646 \u0648\u0623\u0646\u0638\u0645\u0629 \u0627\u0644\u062D\u0645\u0627\u064A\u0629 \u0627\u0644\u062A\u0641\u0627\u0639\u0644\u064A\u0629 ."@ar . "Shlomo Moran, n\u00E9 en 1947, est un informaticien isra\u00E9lien, titulaire de la chaire Bernard Elkin en informatique au Technion (Institut isra\u00E9lien de technologie) \u00E0 Ha\u00EFfa, en Isra\u00EBl. Shlomo Moran obtient un doctorat (Ph.D.) en 1979 au Technion, sous la direction d'Azaria Paz. Sa th\u00E8se est intitul\u00E9e NP Optimization Problems and their Approximation. En 1993 il obtient, conjointement avec L\u00E1szl\u00F3 Babai, Shafi Goldwasser, Silvio Micali, et Charles Rackoff, le prix G\u00F6del pour leurs travaux sur les syst\u00E8mes de preuves interactives et notamment le protocole Arthur-Merlin Ses recherches actuelles portent sur les aspects algorithmiques de la bio-informatique, et notamment la phylog\u00E9n\u00E9tique, la combinatoire et la th\u00E9orie des graphes."@fr . . . "\u0634\u0644\u0648\u0645\u0648 \u0645\u0648\u0631\u0627\u0646 (\u0628\u0627\u0644\u0639\u0628\u0631\u064A\u0629: \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF\u200F) \u0647\u0648 \u0639\u0627\u0644\u0645 \u062D\u0627\u0633\u0648\u0628 \u0625\u0633\u0631\u0627\u0626\u064A\u0644\u064A\u060C \u0648\u0644\u062F \u0641\u064A 1947. \u0639\u0645\u0644 \u0628\u0631\u0648\u0641\u064A\u0633\u0648\u0631\u0627\u064B \u0641\u064A \u0639\u0644\u0648\u0645 \u0627\u0644\u0643\u0645\u0628\u064A\u0648\u062A\u0631 \u0641\u064A \u0627\u0644\u062A\u062E\u0646\u064A\u0648\u0646 (\u0648\u0647\u0648 \u0645\u0639\u0647\u062F \u0625\u0633\u0631\u0627\u0626\u064A\u0644 \u0644\u0644\u062A\u0643\u0646\u0648\u0644\u0648\u062C\u064A\u0627) \u0641\u064A \u062D\u064A\u0641\u0627 \u0641\u064A \u0625\u0633\u0631\u0627\u0626\u064A\u0644 . \u062D\u0635\u0644 \u0639\u0644\u0649 \u062F\u0631\u062C\u0629 \u0627\u0644\u062F\u0643\u062A\u0648\u0631\u0627\u0647 \u0641\u064A \u0639\u0627\u0645 1979 \u0645\u0646 \u0627\u0644\u062A\u062E\u0646\u064A\u0648\u0646 \u062A\u062D\u062A \u0627\u0634\u0631\u0627\u0641 \u0623\u0632\u0627\u0631\u064A\u0627 \u0628\u0627\u0632. \u0641\u064A \u0639\u0627\u0645 1993 \u062D\u0635\u0644 \u0639\u0644\u0649 \u062C\u0627\u0626\u0632\u0629 \u062C\u0648\u062F\u0644 \u0628\u0627\u0644\u0627\u0634\u062A\u0631\u0627\u0643 \u0645\u0639 \u0644\u0627\u0632\u0644\u0648 \u0628\u0627\u0628\u0627\u064A \u0648\u0634\u0627\u0641\u064A \u063A\u0648\u0644\u0641\u0627\u0633\u0631 \u0648\u0633\u064A\u0644\u0641\u064A\u0648 \u0645\u064A\u0643\u0627\u0644\u064A \u0648\u0634\u0627\u0631\u0644 \u0631\u0627\u0643\u0648\u0641\u060C \u0644\u0639\u0645\u0644\u0647\u0645 \u0639\u0644\u0649 \u0628\u0631\u0648\u062A\u0648\u0643\u0648\u0644\u0627\u062A \u0622\u0631\u062B\u0631 \u0645\u064A\u0631\u0644\u064A\u0646 \u0648\u0623\u0646\u0638\u0645\u0629 \u0627\u0644\u062D\u0645\u0627\u064A\u0629 \u0627\u0644\u062A\u0641\u0627\u0639\u0644\u064A\u0629 ."@ar . . . . . . . . . "\u0428\u043B\u043E\u043C\u043E \u041C\u043E\u0440\u0430\u043D (\u0438\u0432\u0440. \u200F\u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF\u200F\u200E, \u0440.1947) \u2014 \u0438\u0437\u0440\u0430\u0438\u043B\u044C\u0441\u043A\u0438\u0439 \u0441\u043F\u0435\u0446\u0438\u0430\u043B\u0438\u0441\u0442 \u0432 \u043E\u0431\u043B\u0430\u0441\u0442\u0438 \u043A\u043E\u043C\u043F\u044C\u044E\u0442\u0435\u0440\u043D\u044B\u0445 \u043D\u0430\u0443\u043A, \u043B\u0430\u0443\u0440\u0435\u0430\u0442 \u043C\u0435\u0436\u0434\u0443\u043D\u0430\u0440\u043E\u0434\u043D\u044B\u0445 \u043F\u0440\u0435\u043C\u0438\u0439."@ru . . . . . "Shlomo Moran"@fr . . . . . . . . . . "Schlomo Moran (hebr\u00E4isch \u05E9\u05DC\u05DE\u05D4 \u05DE\u05D5\u05E8\u05DF, englische Transkription Shlomo Moran, * 1947) ist ein israelischer Informatiker. Moran wurde 1979 am Technion in Haifa bei promoviert (NP optimization problems and their approximation). Er ist Professor f\u00FCr Informatik am Technion."@de . . . "Shlomo Moran"@en . . . . . . "Schlomo Moran"@de . . . .