Michael O. Rabin

Michael Oser Rabin
Born (1931-09-01) September 1, 1931 (age 93)
NationalityIsraeli
Alma materHebrew University of Jerusalem (MSc)
University of Pennsylvania
Princeton University (PhD)
Known forRabin 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
Scientific career
FieldsComputer science
InstitutionsHarvard University
Hebrew University of Jerusalem
Columbia University
Thesis Recursive Unsolvability of Group Theoretic Problems  (1957)
Doctoral advisorAlonzo Church
Doctoral students

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