D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 42 Citations 21,833 93 World Ranking 5116 National Ranking 2518

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Programming language
  • Operating system

His primary scientific interests are in Discrete mathematics, Algorithm, Algebra, Automaton and Cryptography. His Discrete mathematics research includes elements of Solovay–Strassen primality test and Primality test. His Algorithm course of study focuses on Load balancing and Fault tolerance and Data slice.

His work carried out in the field of Algebra brings together such families of science as Computable model theory, Computable analysis and Church's thesis. His study on Sequential calculus and Monadic second-order logic is often connected to Emptiness and Monadic predicate calculus as part of broader study in Automaton. The study incorporates disciplines such as Alice and Bob and Alice in addition to Cryptography.

His most cited work include:

  • Efficient dispersal of information for security, load balancing, and fault tolerance (2263 citations)
  • Finite automata and their decision problems (1536 citations)
  • Decidability of second-order theories and automata on infinite trees. (1205 citations)

What are the main themes of his work throughout his whole career to date?

Michael O. Rabin mainly investigates Discrete mathematics, Theoretical computer science, Computer security, Algorithm and Cryptography. Michael O. Rabin is studying Decidability, which is a component of Discrete mathematics. His Theoretical computer science research includes themes of Distributed computing, Correctness, Bounded function, Protocol and Computation.

He has researched Computer security in several fields, including Beacon and Internet privacy. His work on Randomized algorithm as part of general Algorithm research is often related to Information dispersal, thus linking different fields of science. Michael O. Rabin has included themes like Hash function and Encryption, Secure communication in his Cryptography study.

He most often published in these fields:

  • Discrete mathematics (33.06%)
  • Theoretical computer science (29.84%)
  • Computer security (16.13%)

What were the highlights of his more recent work (between 1999-2014)?

  • Computer security (16.13%)
  • Theoretical computer science (29.84%)
  • Encryption (12.10%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Computer security, Theoretical computer science, Encryption, Cryptography and Hyper-encryption. His Computer security study incorporates themes from Identifier and Internet privacy. His Theoretical computer science study combines topics in areas such as End-to-end principle, Algorithm, Correctness, Computation and Quantum complexity theory.

His study in Algorithm is interdisciplinary in nature, drawing from both Value, Discrete mathematics and Verifiable secret sharing. His Discrete mathematics research is multidisciplinary, relying on both Class and Faithful representation, Pure mathematics. His Cryptography study integrates concerns from other disciplines, such as Trusted third party and Ciphertext.

Between 1999 and 2014, his most popular works were:

  • How To Exchange Secrets with Oblivious Transfer. (446 citations)
  • Zero-knowledge sets (155 citations)
  • Everlasting security in the bounded storage model (130 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Programming language
  • Algebra

Michael O. Rabin focuses on Computer security, Oblivious transfer, Alice and Bob, Shared secret and Key. His Computer security research incorporates elements of Identifier, Software and User device. His Oblivious transfer study contributes to a more complete understanding of Algorithm.

His studies in Algorithm integrate themes in fields like Theoretical computer science and Encryption. His research integrates issues of Computation and Computer security model in his study of Encryption. His biological study spans a wide range of topics, including Key generation and Pre-shared key, Key exchange, Key distribution.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Finite automata and their decision problems

M. O. Rabin;D. Scott.
Ibm Journal of Research and Development (1959)

2560 Citations

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

Michael O. Rabin.
Journal of the ACM (1989)

2312 Citations

How to Exchange Secrets with Oblivious Transfer

Michael O. Rabin.
IACR Cryptology ePrint Archive (1981)

1921 Citations

Efficient randomized pattern-matching algorithms

Richard M. Karp;Michael O. Rabin.
Ibm Journal of Research and Development (1987)

1861 Citations

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

Michael O. Rabin.
Transactions of the American Mathematical Society (1969)

1828 Citations

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

M. O. Rabin.
MIT Laboratory for Computer Science (1979)

1523 Citations

Scheme for information dispersal and reconstruction

Michael O. Rabin.
(1991)

1329 Citations

Probabilistic algorithm for testing primality

Michael O Rabin;Michael O Rabin.
Journal of Number Theory (1980)

1244 Citations

Randomized byzantine generals

Michael O. Rabin.
foundations of computer science (1983)

658 Citations

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

Rosario Gennaro;Michael O. Rabin;Tal Rabin.
principles of distributed computing (1998)

624 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Michael O. Rabin

Timothy W. Markison

Timothy W. Markison

IBM (United States)

Publications: 137

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 88

Orna Kupferman

Orna Kupferman

Hebrew University of Jerusalem

Publications: 65

Gary W. Grube

Gary W. Grube

Motorola (United States)

Publications: 50

Michel Raynal

Michel Raynal

Institut de Recherche en Informatique et Systèmes Aléatoires

Publications: 35

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 34

Gregory R. Ganger

Gregory R. Ganger

Carnegie Mellon University

Publications: 29

Joseph Y. Halpern

Joseph Y. Halpern

Cornell University

Publications: 29

Michael K. Reiter

Michael K. Reiter

Duke University

Publications: 27

Moni Naor

Moni Naor

Weizmann Institute of Science

Publications: 25

Silvio Micali

Silvio Micali

MIT

Publications: 24

Wolfgang Thomas

Wolfgang Thomas

RWTH Aachen University

Publications: 24

Paulo Veríssimo

Paulo Veríssimo

King Abdullah University of Science and Technology

Publications: 23

Shlomi Dolev

Shlomi Dolev

Ben-Gurion University of the Negev

Publications: 23

Nuno Neves

Nuno Neves

University of Lisbon

Publications: 22

Christian Cachin

Christian Cachin

University of Bern

Publications: 22

Trending Scientists

Hajo A. Reijers

Hajo A. Reijers

Utrecht University

Inmaculada Martínez-Zarzoso

Inmaculada Martínez-Zarzoso

University of Göttingen

Xiaojun Lin

Xiaojun Lin

Purdue University West Lafayette

Damon Honnery

Damon Honnery

Monash University

Timothy D. Lash

Timothy D. Lash

Illinois State University

Ruth Welti

Ruth Welti

Kansas State University

David A. Ray

David A. Ray

Texas Tech University

Harry J. Gilbert

Harry J. Gilbert

Newcastle University

Markus Bischoff

Markus Bischoff

Saarland University

Mustafizur Rahman

Mustafizur Rahman

International Centre for Diarrhoeal Disease Research

Anthony W. Confer

Anthony W. Confer

Oklahoma State University

Luiz R.G. Britto

Luiz R.G. Britto

Universidade de São Paulo

Debra Rickwood

Debra Rickwood

University of Canberra

Nicholas Colangelo

Nicholas Colangelo

University of Iowa

Michael E Zucker

Michael E Zucker

California Institute of Technology

Christian David

Christian David

Paul Scherrer Institute

Something went wrong. Please try again later.