Michael O. Rabin

Michael Oser Rabin
Michael Oser Rabin
Born	September 1, 1931 (age 92); Breslau, Germany
Nationality	Israeli
Alma mater	Hebrew University of Jerusalem (MSc); University of Pennsylvania ; Princeton University (PhD)
Known for	Rabin cryptosystem; Rabin fingerprint; Rabin signature algorithm; Rabin–Karp string search algorithm; Rabin–Scott powerset construction; Adian–Rabin theorem; Berlekamp–Rabin algorithm; Miller–Rabin primality test; Hyper-encryption; Infinite-tree automaton; Decidability of S2S; Nondeterministic finite automata; Oblivious transfer; Probabilistic automaton; Pumping lemma; Randomized algorithms; Two-way finite automaton; Verifiable random function
Awards	Turing Award (1976); Harvey Prize (1980); Gibbs lecture (1985); Israel Prize (1995); IEEE Computer Society Charles Babbage Award (2000); Paris Kanellakis Award (2003); EMET Prize (2004); Gödel Lecture (2004); Dan David Prize (2010); Dijkstra Prize (2015);
	Scientific career
Fields	Computer science
Institutions	Harvard University; Hebrew University of Jerusalem; Columbia University
Thesis	Recursive Unsolvability of Group Theoretic Problems (1957)
Doctoral advisor	Alonzo Church
Doctoral students	Judit Bar-Ilan; Dov Gabbay; Moshé Machover; Saharon Shelah;

Michael Oser Rabin (Hebrew: מִיכָאֵל עוזר רַבִּין; born September 1, 1931) is an Israeli mathematician, computer scientist, and recipient of the Turing Award.

Quick facts: Michael Oser Rabin, Born, Nationality, Alma&n... ▼

Israeli mathematician and computer scientist / From Wikipedia, the free encyclopedia

Michael Oser Rabin

Born	(1931-09-01) September 1, 1931 (age 92) Breslau, Germany
Nationality	Israeli
Alma mater	Hebrew University of Jerusalem (MSc) University of Pennsylvania Princeton University (PhD)
Known for	Rabin cryptosystem Rabin fingerprint Rabin signature algorithm Rabin–Karp string search algorithm Rabin–Scott powerset construction Adian–Rabin theorem Berlekamp–Rabin algorithm Miller–Rabin primality test Hyper-encryption Infinite-tree automaton Decidability of S2S Nondeterministic finite automata Oblivious transfer Probabilistic automaton Pumping lemma Randomized algorithms Two-way finite automaton Verifiable random function
Awards	Turing Award (1976) Harvey Prize (1980) Gibbs lecture (1985) Israel Prize (1995) IEEE Computer Society Charles Babbage Award (2000) Paris Kanellakis Award (2003) EMET Prize (2004) Gödel Lecture (2004) Dan David Prize (2010) Dijkstra Prize (2015)
Scientific career
Fields	Computer science
Institutions	Harvard University Hebrew University of Jerusalem Columbia University
Thesis	Recursive Unsolvability of Group Theoretic Problems (1957)
Doctoral advisor	Alonzo Church
Doctoral students	Judit Bar-Ilan Dov Gabbay Moshé Machover Saharon Shelah