| 2012 | ||
|---|---|---|
| c34 | Michael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung: Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions. ICALP (1) 2012: 738-749 | |
| c33 | Michael O. Rabin: Never too early to begin: computer science for high-school students. ITiCSE 2012: 1 | |
| 2009 | ||
| c32 | David C. Parkes, Michael O. Rabin, Christopher Thorpe: Cryptographic Combinatorial Clock-Proxy Auctions. Financial Cryptography 2009: 305-324 | |
| 2008 | ||
| j23 | David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe: Practical secrecy-preserving, verifiably correct and trustworthy auctions. Electronic Commerce Research and Applications 7(3): 294-312 (2008) | |
| 2007 | ||
| c31 | Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe: Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. LICS 2007: 63-76 | |
| c30 | Michael O. Rabin: DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. DISC 2007: 506-508 | |
| 2006 | ||
| c29 | David C. Parkes, Michael O. Rabin, Stuart M. Shieber, C. A. Thorpe: Practical secrecy-preserving, verifiably correct and trustworthy auctions. ICEC 2006: 70-81 | |
| 2005 | ||
| i2 | Michael O. Rabin: How To Exchange Secrets with Oblivious Transfer. IACR Cryptology ePrint Archive 2005: 187 (2005) | |
| 2004 | ||
| c28 | ||
| 2003 | ||
| c27 | ||
| c26 | ||
| 2002 | ||
| j22 | Michael A. Bender, Michael O. Rabin: Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. Theory Comput. Syst. 35(3): 289-304 (2002) | |
| j21 | Yonatan Aumann, Yan Zong Ding, Michael O. Rabin: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 48(6): 1668-1680 (2002) | |
| c25 | ||
| 2001 | ||
| j20 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear-Consistency Testing. J. Comput. Syst. Sci. 62(4): 589-607 (2001) | |
| 2000 | ||
| c24 | Michael A. Bender, Michael O. Rabin: Scheduling Cilk multithreaded parallel programs on processors of different speeds. SPAA 2000: 13-21 | |
| 1999 | ||
| c23 | Yonatan Aumann, Michael O. Rabin: Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999: 65-79 | |
| c22 | ||
| c21 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear Consistency Testing. RANDOM-APPROX 1999: 109-120 | |
| i1 | Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan: Linear Consistency Testing. Electronic Colloquium on Computational Complexity (ECCC) 6(25) (1999) | |
| 1998 | ||
| j19 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998) | |
| c20 | Yonatan Aumann, Michael O. Rabin: Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998: 299-303 | |
| c19 | Rosario Gennaro, Michael O. Rabin, Tal Rabin: Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography. PODC 1998: 101-111 | |
| 1997 | ||
| c18 | Michael O. Rabin: Correctness of Programs and Protocols through Randomization (Extended Abstract). ASIAN 1997: 1-3 | |
| 1996 | ||
| c17 | ||
| 1995 | ||
| j18 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin: On Lotteries with Unique Winners. SIAM J. Discrete Math. 8(1): 93-98 (1995) | |
| c16 | Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin: Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach. ICDCS 1995: 467-474 | |
| 1994 | ||
| j17 | Yonatan Aumann, Michael O. Rabin: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Theor. Comput. Sci. 128(1&2): 3-30 (1994) | |
| 1993 | ||
| c15 | Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin: Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs. FOCS 1993: 271-280 | |
| c14 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower bounds for randomized mutual exclusion. STOC 1993: 154-163 | |
| 1992 | ||
| c13 | Yonatan Aumann, Michael O. Rabin: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract). FOCS 1992: 147-156 | |
| c12 | Michael O. Rabin: Dependable Parallel Computing by Randomization (Abstract). 25th Anniversary of INRIA 1992: 19-20 | |
| c11 | Eyal Kushilevitz, Michael O. Rabin: Randomized Mutual Exclusion Algorithms Revisited. PODC 1992: 275-283 | |
| c10 | Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan: Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version). STOC 1992: 306-317 | |
| 1991 | ||
| j16 | Noga Alon, Daniel J. Kleitman, Richard Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer: Set systems with no union of cardinality 0 modulom. Graphs and Combinatorics 7(2): 97-99 (1991) | |
| 1989 | ||
| j15 | Michael O. Rabin: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2): 335-348 (1989) | |
| j14 | Michael O. Rabin, Vijay V. Vazirani: Maximum Matchings in General Graphs Through Randomization. J. Algorithms 10(4): 557-567 (1989) | |
| c9 | Michael O. Rabin, J. D. Tygar: ITOSS: An Integrated Toolkit For Operating System Security. FODO 1989: 2-15 | |
| 1987 | ||
| j13 | Joseph Y. Halpern, Michael O. Rabin: A Logic to Reason about Likelihood. Artif. Intell. 32(3): 379-405 (1987) | |
| j12 | Richard M. Karp, Michael O. Rabin: Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development 31(2): 249-260 (1987) | |
| c8 | Benny Chor, Michael O. Rabin: Achieving Independence in Logarithmic Number of Rounds. PODC 1987: 260-268 | |
| 1983 | ||
| j11 | ||
| c7 | ||
| c6 | ||
| 1982 | ||
| j10 | ||
| j9 | Michael O. Rabin: N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable. J. Comput. Syst. Sci. 25(1): 66-75 (1982) | |
| 1981 | ||
| c5 | Daniel J. Lehmann, Michael O. Rabin: On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. POPL 1981: 133-138 | |
| 1980 | ||
| j8 | ||
| c4 | Michael O. Rabin: N-Process Synchronization by 4 log _2 N-Valued Shared Variables. FOCS 1980: 407-410 | |
| 1977 | ||
| j7 | ||
| 1974 | ||
| c3 | ||
| c2 | Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer: A Characterization of the Power of Vector Machines. STOC 1974: 122-134 | |
| 1972 | ||
| j6 | Michael O. Rabin: Proving Simultaneous Positivity of Linear Forms. J. Comput. Syst. Sci. 6(6): 639-650 (1972) | |
| c1 | Michael O. Rabin: Solving Linear Equations by Means of Scalar Products. Complexity of Computer Computations 1972: 11-20 | |
| 1971 | ||
| j5 | Michael O. Rabin, Michael Morley: Meeting of the Association for Symbolic Logic. J. Symb. Log. 36(4): 696-710 (1971) | |
| 1966 | ||
| j4 | Calvin C. Elgot, Michael O. Rabin: Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. J. Symb. Log. 31(2): 169-181 (1966) | |
| 1963 | ||
| j3 | ||
| j2 | ||
| 1958 | ||
| j1 | Michael O. Rabin: On Recursively Enumerable and Arithmetic Models of Set Theory. J. Symb. Log. 23(4): 408-416 (1958) | |
Data released under the ODC-BY 1.0 license — See also our legal information page