Michael O. Rabin

Michael Oser Rabin
מִיכָאֵל עוזר רַבִּין
Born(1931-09-01)September 1, 1931
Breslau, Lower Silesia, Prussia, Germany
DiedApril 14, 2026(2026-04-14) (aged 94)
EducationHebrew University (BS, MS)
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
Rabin automaton
Verifiable random function
Awards
Scientific career
FieldsComputer science
WorkplacesHarvard University
Hebrew University of Jerusalem
Columbia University
Thesis Recursive Unsolvability of Group Theoretic Problems  (1957)
Alonzo Church
Doctoral students

Michael Oser Rabin (Hebrew: מִיכָאֵל עוזר רַבִּין; September 1, 1931 – April 14, 2026) was a computer scientist who was co-recipient, with Dana Scott, of the 1976 ACM Turing Award for their work on computational complexity.