Michael O.
Rabin, an Israeli mathematician and computer scientist, died on April 14, 2026, at the age of 94. Born on September 1, 1931, in Breslau, Germany, Rabin was known for work including the Rabin cryptosystem, the Rabin fingerprint, the Rabin signature algorithm, the Rabin–Karp string search algorithm, the Rabin–Scott powerset construction, the Adian–Rabin theorem, the Berlekamp–Rabin algorithm, and the Miller–Rabin primality test.
He was a recipient, with Dana Scott, of the 1976 ACM Turing Award for work on computational complexity.
Michael O. Rabin, 94, Israeli mathematician and computer scientist.