Michael Oser Rabin (1931–2026) was an Israeli mathematician and computer scientist who made foundational contributions to theoretical computer science. Co-recipient of the 1976 ACM Turing Award with Dana Scott for their work on nondeterministic finite automata, Rabin also invented the Miller–Rabin primality test, the Rabin signature algorithm (the first asymmetric cryptosystem proven as hard as integer factorization), the Rabin–Karp string search algorithm, probabilistic automata, and introduced the concept of polynomial time. He held professorships at Hebrew University, MIT, and Harvard, and received numerous honors including the Israel Prize and Paris Kanellakis Award.
Sort: