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. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Awardhonorary doctorate from University of Bordeaux-I 2 AwardForeign Member of the Royal Society 2 AwardJosiah Willard Gibbs Lectureship 2 Awardhonorary doctorate of the Weizmann Institute of Science 2 AwardThe EMET Prize for Art, Science and Culture 2 Connections
Associated With
Source Wikipedia: Michael O. Rabin
Invented
Verified en.wikipedia.org/wiki/Rabin_cryptosystem: "The Rabin trapdoor function was first published as part of the Rabin signature scheme in 1978 by Michael O. Rabin." The Rabin cryptosystem (1979 encryption scheme) shares this same trapdoor construction.
Invented By
Michael O. Rabin co-authored the 1959 paper with Dana Scott that formalized deterministic and nondeterministic finite automata and proved their equivalence.
Michael O. Rabin co-developed the string search algorithm with Richard M. Karp, published in 1987.
In the Other Atlases
- Also in Geography Atlas: Israel, nationality there.
- Also in Science Atlas: Turing Award, discussed there.
Sources
1. Wikipedia: Michael O. Rabin
Wikimedia FoundationLead section
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.
Infobox, Born
September 1, 1931
Infobox, Died
April 14, 2026
Associated With: Dana Scott, Career section
It was there that he and Dana Scott wrote the paper "Finite Automata and Their Decision Problems".
View the Source 2. Wikidata: Michael O. Rabin
Wikidata Q357965, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.