On Recursively Enumerable and Arithmetic Models of Set Theory. - Michael O. Rabin (J. Symb. Log., 1958)

On Codes for Checking Logical Operations. - W. Wesley Peterson; Michael O. Rabin (IBM J. Res. Dev., 1959)

Finite Automata and Their Decision Problems. - Michael O. Rabin; Dana S. Scott (IBM J. Res. Dev., 1959)

Words in the History of a Turing Machine with a Fixed Input. - Michael O. Rabin; Hao Wang 001 (J. ACM, 1963)

The Theory of Definite Automata. - Micha A. Perles; Michael O. Rabin; Eliahu Shamir (IEEE Trans. Electron. Comput., 1963)

Probabilistic Automata - Michael O. Rabin (Inf. Control., 1963)

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. - Calvin C. Elgot; Michael O. Rabin (J. Symb. Log., 1966)

Meeting of the Association for Symbolic Logic. - Michael O. Rabin; Michael D. Morley (J. Symb. Log., 1971)

Solving Linear Equations by Means of Scalar Products. - Michael O. Rabin (Complexity of Computer Computations, 1972)

Proving Simultaneous Positivity of Linear Forms. - Michael O. Rabin (J. Comput. Syst. Sci., 1972)

Theoretical Impediments to Artificial Intelligence. - Michael O. Rabin (IFIP Congress, 1974)

A Characterization of the Power of Vector Machines - Vaughan R. Pratt; Michael O. Rabin; Larry J. Stockmeyer (STOC, 1974)

Complexity of Computations. - Michael O. Rabin (Commun. ACM, 1977)

N-Process Synchronization by 4 log _2 N-Valued Shared Variables - Michael O. Rabin (FOCS, 1980)

Probabilistic Algorithms in Finite Fields. - Michael O. Rabin (SIAM J. Comput., 1980)

On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. - Daniel Lehmann 001; Michael O. Rabin (POPL, 1981)

The Choice Coordination Problem. - Michael O. Rabin (Acta Informatica, 1982)

N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable. - Michael O. Rabin (J. Comput. Syst. Sci., 1982)

Randomized Byzantine Generals - Michael O. Rabin (FOCS, 1983)

Transaction Protection by Beacons. - Michael O. Rabin (J. Comput. Syst. Sci., 1983)

Achieving Independence in Logarithmic Number of Rounds. - Benny Chor; Michael O. Rabin (PODC, 1987)

A Logic to Reason about Likelihood. - Joseph Y. Halpern; Michael O. Rabin (Artif. Intell., 1987)

Efficient Randomized Pattern-Matching Algorithms. - Richard M. Karp; Michael O. Rabin (IBM J. Res. Dev., 1987)

ITOSS: An Integrated Toolkit For Operating System Security. - Michael O. Rabin; J. D. Tygar (FODO, 1989)

Biased Coins and Randomized Algorithms. - Noga Alon; Michael O. Rabin (Adv. Comput. Res., 1989)

Efficient dispersal of information for security, load balancing, and fault tolerance. - Michael O. Rabin (J. ACM, 1989)

Maximum Matchings in General Graphs Through Randomization. - Michael O. Rabin; Vijay V. Vazirani (J. Algorithms, 1989)

Set systems with no union of cardinality 0 modulom. - Noga Alon; Daniel J. Kleitman; Richard J. Lipton; Roy Meshulam; Michael O. Rabin; Joel H. Spencer (Graphs Comb., 1991)

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) - Yonatan Aumann; Michael O. Rabin (FOCS, 1992)

Dependable Parallel Computing by Randomization (Abstract). - Michael O. Rabin (25th Anniversary of INRIA, 1992)

Randomized Mutual Exclusion Algorithms Revisited. - Eyal Kushilevitz; Michael O. Rabin (PODC, 1992)

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version) - Zvi M. Kedem; Krishna V. Palem; Michael O. Rabin; A. Raghunathan (STOC, 1992)

Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs - Yonatan Aumann; Zvi M. Kedem; Krishna V. Palem; Michael O. Rabin (FOCS, 1993)

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. - Yonatan Aumann; Michael O. Rabin (Theor. Comput. Sci., 1994)

Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach. - Partha Dasgupta; Zvi M. Kedem; Michael O. Rabin (ICDCS, 1995)

On Lotteries with Unique Winners. - Eyal Kushilevitz; Yishay Mansour; Michael O. Rabin (SIAM J. Discret. Math., 1995)

Computationally Hard Algebraic Problems (extended abstract). - Michael O. Rabin (FOCS, 1996)

Correctness of Programs and Protocols through Randomization (Extended Abstract). - Michael O. Rabin (ASIAN, 1997)

DNA2DNA computations: A potential "killer app?". - Laura F. Landweber; Richard J. Lipton; Michael O. Rabin (DNA Based Computers, 1997)

Hashing on strings, cryptography, and protection of privacy. - Michael O. Rabin (SEQUENCES, 1997)

Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). - Yonatan Aumann; Michael O. Rabin (CRYPTO, 1998)

Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. - Rosario Gennaro; Michael O. Rabin; Tal Rabin (PODC, 1998)

Lower Bounds for Randomized Mutual Exclusion. - Eyal Kushilevitz; Yishay Mansour; Michael O. Rabin; David Zuckerman (SIAM J. Comput., 1998)

Information Theoretically Secure Communication in the Limited Storage Space Model. - Yonatan Aumann; Michael O. Rabin (CRYPTO, 1999)

Verifiable Random Functions. - Silvio Micali; Michael O. Rabin; Salil P. Vadhan (FOCS, 1999)

Scheduling Cilk multithreaded parallel programs on processors of different speeds. - Michael A. Bender; Michael O. Rabin (SPAA, 2000)

Linear-Consistency Testing. - Yonatan Aumann; Johan Håstad; Michael O. Rabin; Madhu Sudan 001 (J. Comput. Syst. Sci., 2001)

Hyper-Encryption and Everlasting Security. - Yan Zong Ding; Michael O. Rabin (STACS, 2002)

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. - Michael A. Bender; Michael O. Rabin (Theory Comput. Syst., 2002)

Everlasting security in the bounded storage model. - Yonatan Aumann; Yan Zong Ding; Michael O. Rabin (IEEE Trans. Inf. Theory, 2002)

Hyper Encryption and Everlasting Secrets. - Michael O. Rabin (CIAC, 2003)

Zero-Knowledge Sets. - Silvio Micali; Michael O. Rabin; Joe Kilian (FOCS, 2003)

Identity-Based Zero Knowledge. - Jonathan Katz; Rafail Ostrovsky; Michael O. Rabin (SCN, 2004)

Provably unbreakable hyper-encryption in the limited access model. - Michael O. Rabin (ICITS, 2005)

How To Exchange Secrets with Oblivious Transfer. - Michael O. Rabin (IACR Cryptol. ePrint Arch., 2005)

Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. - Michael O. Rabin; Rocco A. Servedio; Christopher Thorpe (LICS, 2007)

DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. - Michael O. Rabin (DISC, 2007)

Practical secrecy-preserving, verifiably correct and trustworthy auctions. - David C. Parkes; Michael O. Rabin; Stuart M. Shieber; Christopher Thorpe (Electron. Commer. Res. Appl., 2008)

Cryptographic Combinatorial Clock-Proxy Auctions. - David C. Parkes; Michael O. Rabin; Christopher Thorpe (Financial Cryptography, 2009)

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions. - Michael O. Rabin; Yishay Mansour; S. Muthukrishnan 001; Moti Yung (ICALP (1), 2012)

Never too early to begin: computer science for high-school students. - Michael O. Rabin (ITiCSE, 2012)

Cryptography miracles, secure auctions, matching problem verification. - Silvio Micali; Michael O. Rabin (Commun. ACM, 2014)