Michael O. Rabin
According to our database1, Michael O. Rabin authored at least 63 papers between 1958 and 2014.
Turing Prize recipient
Turing Prize 1976, "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" awarded to Dana S. Scott and Michael O. Rabin.
Legend:Book In proceedings Article PhD thesis Other
Cryptography miracles, secure auctions, matching problem verification.
Commun. ACM, 2014
Never too early to begin: computer science for high-school students.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Cryptographic Combinatorial Clock-Proxy Auctions.
Proceedings of the Financial Cryptography and Data Security, 2009
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Practical secrecy-preserving, verifiably correct and trustworthy auctions.
Proceedings of the 8th International Conference on Electronic Commerce: The new e-commerce, 2006
How To Exchange Secrets with Oblivious Transfer.
IACR Cryptology ePrint Archive, 2005
Provably unbreakable hyper-encryption in the limited access model.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005
Identity-Based Zero Knowledge.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Hyper Encryption and Everlasting Secrets.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
Everlasting security in the bounded storage model.
IEEE Trans. Information Theory, 2002
Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk.
Theory Comput. Syst., 2002
Hyper-Encryption and Everlasting Security.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Scheduling Cilk multithreaded parallel programs on processors of different speeds.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
Linear Consistency Testing
Electronic Colloquium on Computational Complexity (ECCC), 1999
Linear Consistency Testing.
Proceedings of the Randomization, 1999
Verifiable Random Functions.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
Information Theoretically Secure Communication in the Limited Storage Space Model.
Proceedings of the Advances in Cryptology, 1999
Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998
DNA2DNA computations: A potential "killer app?".
Proceedings of the DNA Based Computers, 1997
Correctness of Programs and Protocols through Randomization (Extended Abstract).
Proceedings of the Advances in Computing Science, 1997
Computationally Hard Algebraic Problems (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
On Lotteries with Unique Winners.
SIAM J. Discrete Math., 1995
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach.
Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation.
Theor. Comput. Sci., 1994
Lower bounds for randomized mutual exclusion.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Randomized Mutual Exclusion Algorithms Revisited.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992
Dependable Parallel Computing by Randomization (Abstract).
Proceedings of the Future Tendencies in Computer Science, 1992
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
Set systems with no union of cardinality 0 modulom.
Graphs and Combinatorics, 1991
Maximum Matchings in General Graphs Through Randomization.
J. Algorithms, 1989
Efficient dispersal of information for security, load balancing, and fault tolerance.
J. ACM, 1989
Biased Coins and Randomized Algorithms.
Advances in Computing Research, 1989
ITOSS: An Integrated Toolkit For Operating System Security.
Proceedings of the Foundations of Data Organization and Algorithms, 1989
Efficient Randomized Pattern-Matching Algorithms.
IBM Journal of Research and Development, 1987
A Logic to Reason about Likelihood.
Artif. Intell., 1987
Achieving Independence in Logarithmic Number of Rounds.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987
Transaction Protection by Beacons.
J. Comput. Syst. Sci., 1983
A Logic to Reason about Likelihood
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
Randomized Byzantine Generals
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable.
J. Comput. Syst. Sci., 1982
The Choice Coordination Problem.
Acta Inf., 1982
On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem.
Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981
Probabilistic Algorithms in Finite Fields.
SIAM J. Comput., 1980
N-Process Synchronization by 4 log _2 N-Valued Shared Variables
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980
Complexity of Computations.
Commun. ACM, 1977
A Characterization of the Power of Vector Machines
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974
Theoretical Impediments to Artificial Intelligence.
IFIP Congress, 1974
Proving Simultaneous Positivity of Linear Forms.
J. Comput. Syst. Sci., 1972
Solving Linear Equations by Means of Scalar Products.
Proceedings of a symposium on the Complexity of Computer Computations, 1972
Meeting of the Association for Symbolic Logic.
J. Symb. Log., 1971
Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.
J. Symb. Log., 1966
Information and Control, September, 1963
The Theory of Definite Automata.
IEEE Trans. Electronic Computers, 1963
Words in the History of a Turing Machine with a Fixed Input.
J. ACM, 1963
Finite Automata and Their Decision Problems.
IBM Journal of Research and Development, 1959
On Codes for Checking Logical Operations.
IBM Journal of Research and Development, 1959
On Recursively Enumerable and Arithmetic Models of Set Theory.
J. Symb. Log., 1958