Contents

Michael O. Rabin
Advancing automata theory and probabilistic algorithms.
Finite Automata and Their Decision Problems · Primality testing
- Born
- 1 September 1931
- Birthplace
- Wrocław
- Died
- 14 April 2026
More people
Michael O. Rabin
Michael O. Rabin was a computer scientist whose research helped establish theoretical computing and modern approaches to cryptography.
Early life
Education
Grew up in Haifa, studied at the Hebrew University and completed a Princeton doctorate in 1956.
Career
- 1959
Automata paper
Published joint work with Dana Scott.
- 1976
Turing Award
Shared the award with Scott.
- 1981
Harvard
Joined Harvard’s computer science faculty.
Contributions
Finite Automata and Their Decision Problems
Introduced influential nondeterministic models.
Primality testing
Developed the probabilistic approach known as the Miller–Rabin test.
Rabin–Karp search
Co-developed a string-search algorithm using hashing.
Beyond research
Family
His daughter Tal Rabin also became a computer scientist.
Sources & photo credit
Biography and career ↗Biographical references ↗Additional biographical source ↗Original photograph. Cropped and displayed in monochrome.
Photo: Konrad Jacobs, Erlangen, Copyright is MFO. CC BY-SA 2.0 de · Original image. Cropped and displayed in monochrome.