Michael O. Rabin
Awards & Honours
3
Awards Won
3
Honours
2
Records
Michael Rabin's career was marked by a series of firsts. He was among the first to formalize nondeterministic computation, and his 1959 paper with Dana Scott introduced the concept that would earn them the Turing Award. His randomized algorithm for primality testing, developed with Gary Miller, remains a standard tool in number theory and cryptography. Rabin's influence extends across multiple subfields, and his work is cited in thousands of papers. He is rightly regarded as one of the architects of modern computer science.
Awards
Honours & Distinctions
ACM Turing Award
Highest honor in computer science, shared with Dana Scott.
EMET Prize
Israeli prize for excellence in science, art, and culture.
Dan David Prize
International prize for outstanding achievements, shared $1 million.
Records & Feats
Co-developer of the Miller–Rabin primality test
One of the most widely used probabilistic algorithms for testing large numbers for primality.
Pioneer of randomized algorithms
Introduced the concept that algorithms can use randomness to achieve efficiency, now fundamental in cryptography and machine learning.