Michael O. Rabin | Academic Influence

Michael O. Rabin's AcademicInfluence.com Rankings

Michael O. Rabin

Computer Science

#138

World Rank

#144

Historical Rank

Theoretical Computer Science

#14

World Rank

#14

Historical Rank

computer-science Degrees

Michael O. Rabin

Mathematics

#268

World Rank

#571

Historical Rank

Measure Theory

#379

World Rank

#554

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Michael O. Rabin's Degrees

PhD Mathematics Princeton University

Why Is Michael O. Rabin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael Oser Rabin is an Israeli mathematician, computer scientist, and recipient of the Turing Award. Biography Early life and education Rabin was born in 1931 in Breslau, Germany , the son of a rabbi. In 1935, he emigrated with his family to Mandate Palestine. As a young boy, he was very interested in mathematics and his father sent him to the best high school in Haifa, where he studied under mathematician Elisha Netanyahu, who was then a high school teacher.

(See a Problem?)

Michael O. Rabin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Finite Automata and Their Decision Problems (1959) (1875)
Efficient dispersal of information for security, load balancing, and fault tolerance (1989) (1502)
Efficient Randomized Pattern-Matching Algorithms (1987) (1326)
How To Exchange Secrets with Oblivious Transfer (2005) (1305)
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION (1979) (1285)
Decidability of second-order theories and automata on infinite trees (1968) (1039)
Probabilistic algorithm for testing primality (1980) (845)
Decidability of second-order theories and automata on infinite trees. (1969) (612)
Randomized byzantine generals (1983) (591)
Verifiable random functions (1999) (547)
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography (1998) (492)
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC (1974) (404)
Computable algebra, general theory and theory of computable fields. (1960) (358)
Probabilistic Algorithms in Finite Fields (1980) (354)
Automata on Infinite Objects and Church's Problem (1972) (320)
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem (1981) (291)
Recursive Unsolvability of Group Theoretic Problems (1958) (230)
Weakly Definable Relations and Special Automata (1970) (222)
Transaction Protection by Beacons (1983) (207)
Zero-knowledge sets (2003) (169)
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor (1966) (140)
Everlasting security in the bounded storage model (2002) (139)
The Theory of Definite Automata (1963) (132)
An algorithm for a minimum cover of a graph (1959) (124)
Real time computation (1963) (119)
A logic to reason about likelihood (1983) (116)
Practical secrecy-preserving, verifiably correct and trustworthy auctions (2006) (114)
Maximum Matchings in General Graphs Through Randomization (1989) (109)
Degree of difficulty of computing a function and a partial ordering of recursive sets (1960) (91)
Lecture to the london mathematical society on 20 february 1947 Universal Turing Machine (88)
Hyper-Encryption and Everlasting Security (2002) (81)
Information Theoretically Secure Communication in the Limited Storage Space Model (1999) (80)
Proving Simultaneous Positivity of Linear Forms (1972) (80)
N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable (1982) (69)
Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk (2002) (65)
6. EFFECTIVE COMPUTABILITY OF WINNING STRATEGIES (1958) (56)
Authentication, enhanced security and error correcting codes (1998) (54)
Efficient program transformations for resilient parallel computation via randomization (preliminary version) (1992) (53)
Parallel processing on networks of workstations: a fault-tolerant, high performance approach (1995) (53)
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract) (1998) (51)
Clock construction in fully asynchronous parallel systems and PRAM simulation (1992) (50)
Achieving independence in logarithmic number of rounds (1987) (50)
In Foundations of secure computation (1978) (49)
The choice coordination problem (1982) (48)
On Codes for Checking Logical Operations (1959) (46)
The information dispersal algorithm and its applications (1990) (44)
Theoretical Impediments to Artificial Intelligence (1974) (41)
Highly efficient asynchronous execution of large-grained parallel programs (1993) (41)
Scheduling Cilk multithreaded parallel programs on processors of different speeds (2000) (39)
Probabilistic Automata (1963) (36)
Complexity of computations (1977) (36)
Time-Lapse Cryptography (2006) (34)
Fast evaluation of polynomials by rational preparation (1972) (34)
Randomized mutual exclusion algorithms revisited (1992) (33)
On the Use of Hilbert's ε-Operator in Scientific Theories (1971) (32)
N-process synchronization by 4.log2N-valued shared variable (1980) (31)
Discovering Repetitions in Strings (1985) (30)
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (2007) (24)
Arithmetical extensions with prescribed cardinality (1959) (20)
Cryptography miracles, secure auctions, matching problem verification (2014) (20)
Provably unbreakable hyper-encryption in the limited access model (2005) (20)
Biased Coins and Randomized Algorithms (1989) (19)
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (2012) (18)
Classes of models and sets of sentences with the intersection property (1962) (18)
Cryptographic Combinatorial Clock-Proxy Auctions (2009) (18)
An Adaptive Information Dispersal Algorithm for Time-critical Reliable Communication (1994) (17)
On recursively enumerable and arithmetic models of set theory (1958) (17)
Set systems with no union of cardinality 0 modulom (1991) (16)
Linear Consistency Testing (1999) (14)
Diophantine Equations and Non-Standard Models of Arithmetic (1966) (11)
Lower bounds for randomized mutual exclusion (1993) (11)
An information dispersal approach to issues in parallel processing (1990) (10)
Review: A. Frohlich, J. C. Shepherdson, On the Factorisation of Polynomials in a Finite Number of Steps; A. Frohlich, J. C. Shepherdson, Effective Procedures in Field Theory (1959) (10)
Provable everlasting security in the bounded storage model (2001) (10)
Identity-Based Zero Knowledge (2004) (10)
Words in the History of a Turing Machine with a Fixed Input (1963) (10)
Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking (2014) (7)
PROBABILISTIC ALGORITHM IN FINITE FIELDS (1979) (7)
Solving Linear Equations by Means of Scalar Products (1972) (7)
A note on Helly's theorem. (1955) (7)
Axiomatic Method and Intuitionism (1971) (6)
Efficient End to End Verifiable Electronic Voting Employing Split Value Representations (2014) (6)
Optimal Parallel Pattern Matching Through Randomization (1993) (5)
DNA2DNA computations: A potential "killer app?" (1997) (5)
Comparing the Axioms of Local and Universal Choice (1966) (4)
Hyper Encryption and Everlasting Secrets (2003) (4)
Time-Lapse Cryptography Technical Report TR-2206 (2006) (4)
Hyper encryption and everlasting secrets: a survey (2003) (4)
Mathematical theory of automata (1967) (4)
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata (1969) (3)
On Lotteries with Unique Winners (1995) (3)
Basic Verifiability in the Combinatory Theory of Restricted Generality (1970) (3)
ITOSS: An Integrated Toolkit For Operating System Security (1989) (3)
ON THE EXPANSION (N,+, 2) OF PRESBURGER ARITHMETIC (2007) (3)
New algorithms and metrics for scheduling (1998) (2)
Hashing on strings, cryptography, and protection of privacy (1997) (2)
UNIVERSAL GROUPS OF AUTOMORPHISMS OF MODELS (2014) (2)
Meeting of the Association for Symbolic Logic, Atlantic City, 1971 (1971) (2)
Practical Provably Correct Voter Privacy Protecting End-to-End Voting Employing Multiparty Computations and Split Value Representations of Votes (2014) (2)
Space complexity: (2019) (1)
Review: M. P. Schutzenberger, A Remark on Finite Transducers (1969) (1)
The Possibilities of Chance (1998) (1)
Review: M. P. Schutzenberger, On Context-Free Languages and Push-Down Automata (1969) (1)
Preventing piracy while preserving privacy (2005) (1)
Correctness of programs and protocols through randomization (1997) (1)
Michael Rabin Interview: February 22 and March 1, 2009 (2006) (1)
Provably unbreakable hyper-encryption using distributed systems (2006) (1)
Selecting Closest Vectors Through Randomization (2000) (1)
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems (2007) (0)
With 1952. the Chemical Basis of Morphogenesis Universal Turing Machine (0)
Applications of unconditional pseudorandomness in complexity theory (2007) (0)
Computationally Hard Algebraic Problems (extended abstract). (1996) (0)
Review: J. L. Britton, The Word Problem for Groups; John L. Britton, The Word Problem (1964) (0)
Higman G.. Subgroups of finitely presented groups. Proceedings of the Royal Society of London, series A, mathematical and physical sciences, vol. 262 (1961), pp. 455–475. (1964) (0)
Review: William W. Boone, Certain Simple, Unsolvable Problems of Group Theory I-IV (1957) (0)
Session VII. A new paradigm for the social sciences? (2004) (0)
List of officers and members of the Association for Symbolic Logic (1962) (0)
Cryptographic Combinatorial Clock-Proxy Auctions Please share how this access benefits you. Your story matters (2009) (0)
List of officers and members of the Association for Symbolic Logic (1963) (0)
Reflexivity of a Banach Space with a Countable Vector Space Basis (2022) (0)
Notice of two directories of philosophy (1971) (0)
Notes on memory ( 1945 ) Universal Turing Machine (2011) (0)
Dependable Parallel Computing by Randomization (Abstract) (1992) (0)
Schützenberger M. P.. A remark on finite transducers. Information and control , vol. 4 (1961), pp. 185–196. (1969) (0)
AIDA-based Communication for Distributed Time-critical (1993) (0)
Review: G. Higman, Subgroups of Finitely Presented Groups (1964) (0)
Aida: a Bandwidth Allocation Strategy for Distributed Real-time Systems (1993) (0)
List of officers and members of the Association for Symbolic Logic (1964) (0)
Never too early to begin: computer science for high-school students (2012) (0)
Topic : Practical Information Flow Control With Flume Advisor : Prof (1995) (0)
Computationally hard algebraic problems (1996) (0)
Practical secrecy-preserving, verifiably correct and trustworthy auctions. The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2007) (0)
List of officers and members of the Association for Symbolic Logic (1965) (0)
Correctness of Programs and Protocols through Randomization (Extended Abstract) (1997) (0)
secrecy-preserving , verifiably correct and trustworthy (2008) (0)
Schützenberger M. P.. On context-free languages and push-down automata. Information and control, vol. 6 (1963), pp. 246–264. (1969) (0)
Review: Yehoshua Bar-Hillel, On the Nature of Ethical Sentences (1958) (0)
Aida-based Communication for Distributed Time-critical Applications (1993) (0)
ASC3: Algorithmic Strategies for Compiler Controlled Caches (2003) (0)
In Algorithms and Complexity (1976) (0)
Boone William W.. Certain simple, unsolvable problems of group theory V–VI. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 60 (1957), pp. 22–27, 227–232; also Indagationes mathematicae, vol. 19 (1957), pp. 22–27, 227–232. (1957) (0)
A method for protecting information and the confidentiality (2001) (0)
Provably correct, secrecy preserving computation and its applications in auctions and securities exchanges (2008) (0)
UEbertragungsschaltung with several channels (1960) (0)

This paper list is powered by the following services:

Other Resources About Michael O. Rabin

en.wikipedia.org

What Schools Are Affiliated With Michael O. Rabin?

Michael O. Rabin is affiliated with the following schools:

Image Attributions

Image Source for Michael O. Rabin