Michael O. Rabin

Michael Oser Rabin
Michael Oser Rabin
מִיכָאֵל עוזר רַבִּין
Born	September 1, 1931; Breslau, Germany
Education	Hebrew University (BS, MS); 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; Rabin automaton; Verifiable random function
Awards	Weizmann Prize (1959); 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 A. Bender;

Michael Oser Rabin (Hebrew: מִיכָאֵל עוזר רַבִּין; born September 1, 1931) is an Israeli mathematician, computer scientist, and recipient with Dana Scott of the 1976 ACM Turing Award for their work on computational complexity.