Michael O. Rabin

Research.com Recognitions

• 2020 - ACM Fellow For fundamental, pioneering contributions to the theory of computation, probabilistic algorithms, and cryptography
• 2007 - Fellow of the Royal Society, United Kingdom
• 2003 - ACM Paris Kanellakis Theory and Practice Award Development of efficient randomized tests of primality
• 1984 - Member of the National Academy of Sciences
• 1976 - A. M. Turing Award Along with Dana S. Scott, for their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.
• 1975 - Fellow of the American Academy of Arts and Sciences

Overview

Best Publications

• Finite automata and their decision problems

  M. O. Rabin;D. Scott

  2754
  Citations

• Efficient dispersal of information for security, load balancing, and fault tolerance

  Michael O. Rabin

  2353
  Citations

• How to Exchange Secrets with Oblivious Transfer

  Michael O. Rabin

  2069
  Citations

• Efficient randomized pattern-matching algorithms

  Richard M. Karp;Michael O. Rabin

  1967
  Citations

• Decidability of second-order theories and automata on infinite trees.

  Michael O. Rabin

  1862
  Citations

• DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

  M. O. Rabin

  1562
  Citations

• Probabilistic algorithm for testing primality

  Michael O Rabin;Michael O Rabin

  1355
  Citations

• Scheme for information dispersal and reconstruction

  Michael O. Rabin

  1329
  Citations

• Verifiable random functions

  S. Micali;M. Rabin;S. Vadhan

  869
  Citations

• Randomized byzantine generals

  Michael O. Rabin

  746
  Citations

• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

  Rosario Gennaro;Michael O. Rabin;Tal Rabin

  675
  Citations

• SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC

  M. J. Fischer;M. O. Rabin

  555
  Citations

• Probabilistic Algorithms in Finite Fields

  Michael O. Rabin

  495
  Citations

• Automata on Infinite Objects and Church's Problem

  Michael Oser Rabin

  409
  Citations

• On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

  Daniel Lehmann;Michael O. Rabin

  347
  Citations

• Transaction protection by beacons

  Michael O. Rabin;Michael O. Rabin

  296
  Citations

• Weakly Definable Relations and Special Automata

  Michael O. Rabin

  269
  Citations

• Zero-knowledge sets

  S. Micali;M. Rabin;J. Kilian

  263
  Citations

• Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor

  Calvin C. Elgot;Michael O. Rabin

  195
  Citations

• Practical secrecy-preserving, verifiably correct and trustworthy auctions

  David C. Parkes;Michael O. Rabin;Stuart M. Shieber;Christopher Thorpe

  187
  Citations

• The advantages of free choice: a symmetric and fully distributed solution for the dining philosophers problem

  Michael O. Rabin;Daniel Lehmann

  16
  Citations