Died 2026-04-14.
Text from Wikipedia, available under CC BY-SA 4.0.
- #wikidata
- #death

Figure timeline
Michael Oser Rabin was a computer scientist who was co-recipient, with Dana Scott, of the 1976 ACM Turing Award for their work on computational complexity.
Text from Wikipedia, available under CC BY-SA 4.0.
science · Israeli mathematician and computer scientist (1931–2026) · computer scientist · mathematician · cryptographer · pedagogue · university teacher · also Michael O. Rabin, Michael Rabin, Michael Oser Rabin, Rabin
Born 1 September 1931 · Died 14 April 2026 · Q357965
32 published statements · 0 followers
See & hear
1 photos
Media from Wikimedia Commons, hotlinked at the source under its own licence — see each file for author and terms.
Live now
Pulling headlines from trusted outlets — this usually takes a few seconds
Checking the wires…
Feed scan
These are live links, not archived citations — they only join the timeline once a collect run verifies and archives them.
Live pulse
Most recent outstanding titles, awards, and quotes
Died 2026-04-14.
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded ACM Fellow (2020).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Dan David Prize (2010).
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin was awarded the Tel Aviv University Dan David Prize ("Future" category), jointly with Leonard Kleinrock and Gordon E
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded IACR Fellow (2009).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Foreign Member of the Royal Society (2007).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded The EMET Prize for Art, Science and Culture (2004).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Gödel Lecturer (2004).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Paris Kanellakis Award (2003).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Charles Babbage Award (2000).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Israel Prize (1995).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded honorary doctorate from University of Bordeaux-I (1995).
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin was awarded the Israel Prize, in computer sciences
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin, together with Richard Karp, created one of the most well-known efficient string search algorithms, the Rabin–Karp string search algorithm, known for its rolling hash
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Josiah Willard Gibbs Lectureship (1985).
Text from Wikipedia, available under CC BY-SA 4.0.
Was a professor at the Hebrew University
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin reinvented a weak variant of the technique of oblivious transfer invented by Wiesner under the name of multiplexing, allowing a sender to transmit a message to a receiver where the receiver has some probability bet
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Harvey Prize (1980).
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin invented the Rabin signature algorithm, the first asymmetric cryptosystem whose security was proved equivalent to the intractability of integer factorization
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Turing Award (1976).
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin was invited by Joseph Traub to meet at Carnegie Mellon University and presented the primality test, which Traub called "revolutionary"
Text from Wikipedia, available under CC BY-SA 4.0.
The Turing Award was awarded jointly to Rabin and Dana Scott for a paper written in 1959, the citation for which states that the award was granted:
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin finished his tenure as Rector of the Hebrew University of Jerusalem and went to the Massachusetts Institute of Technology in the USA as a visiting professor
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin introduced infinite-tree automata and proved that the monadic second-order theory of n successors (S2S when n = 2) is decidable
Text from Wikipedia, available under CC BY-SA 4.0.
(published in conference proceedings in 1967), Rabin introduced the notion of polynomial time (introduced independently and very shortly before by Cobham and Edmonds)
Text from Wikipedia, available under CC BY-SA 4.0.
Rabin was invited by Edward F
Text from Wikipedia, available under CC BY-SA 4.0.
Studied at Princeton University, Doctor of Philosophy (1956).
Text from Wikipedia, available under CC BY-SA 4.0.
And was drafted into the army during the 1948 Arab–Israeli War
Text from Wikipedia, available under CC BY-SA 4.0.
Studied at Hebrew Reali School (1948).
Text from Wikipedia, available under CC BY-SA 4.0.
Emigrated with his family to Mandatory Palestine
Text from Wikipedia, available under CC BY-SA 4.0.
Born 1931-09-01.
Text from Wikipedia, available under CC BY-SA 4.0.
In Breslau, Lower Silesia, Prussia, Germany (today Wrocław, in Poland), the son of a rabbi
Text from Wikipedia, available under CC BY-SA 4.0.
Connections