 | 2009 |
|---|
| 54 |       | David C. Parkes,
Michael O. Rabin,
Christopher Thorpe:
Cryptographic Combinatorial Clock-Proxy Auctions.
Financial Cryptography 2009: 305-324 |
| 2008 |
|---|
| 53 | | 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 |
|---|
| 52 | | Michael O. Rabin:
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.
DISC 2007: 506-508 |
| 51 | | Michael O. Rabin,
Rocco A. Servedio,
Christopher Thorpe:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications.
LICS 2007: 63-76 |
| 2006 |
|---|
| 50 | | David C. Parkes,
Michael O. Rabin,
Stuart M. Shieber,
C. A. Thorpe:
Practical secrecy-preserving, verifiably correct and trustworthy auctions.
ICEC 2006: 70-81 |
| 2004 |
|---|
| 49 | | Jonathan Katz,
Rafail Ostrovsky,
Michael O. Rabin:
Identity-Based Zero Knowledge.
SCN 2004: 180-192 |
| 2003 |
|---|
| 48 | | Michael O. Rabin:
Hyper Encryption and Everlasting Secrets.
CIAC 2003: 7-10 |
| 47 | | Silvio Micali,
Michael O. Rabin,
Joe Kilian:
Zero-Knowledge Sets.
FOCS 2003: 80-91 |
| 2002 |
|---|
| 46 | | Yan Zong Ding,
Michael O. Rabin:
Hyper-Encryption and Everlasting Security.
STACS 2002: 1-26 |
| 45 |  | 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) |
| 44 | | 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) |
| 2001 |
|---|
| 43 | | Yonatan Aumann,
Johan Håstad,
Michael O. Rabin,
Madhu Sudan:
Linear-Consistency Testing.
J. Comput. Syst. Sci. 62(4): 589-607 (2001) |
| 2000 |
|---|
| 42 | | Michael A. Bender,
Michael O. Rabin:
Scheduling Cilk multithreaded parallel programs on processors of different speeds.
SPAA 2000: 13-21 |
| 1999 |
|---|
| 41 | | Yonatan Aumann,
Michael O. Rabin:
Information Theoretically Secure Communication in the Limited Storage Space Model.
CRYPTO 1999: 65-79 |
| 40 | | Silvio Micali,
Michael O. Rabin,
Salil P. Vadhan:
Verifiable Random Functions.
FOCS 1999: 120-130 |
| 39 | | Yonatan Aumann,
Johan Håstad,
Michael O. Rabin,
Madhu Sudan:
Linear Consistency Testing.
RANDOM-APPROX 1999: 109-120 |
| 38 | | Yonatan Aumann,
Johan Håstad,
Michael O. Rabin,
Madhu Sudan:
Linear Consistency Testing
Electronic Colloquium on Computational Complexity (ECCC) 6(25): (1999) |
| 1998 |
|---|
| 37 | | Yonatan Aumann,
Michael O. Rabin:
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract).
CRYPTO 1998: 299-303 |
| 36 | | Rosario Gennaro,
Michael O. Rabin,
Tal Rabin:
Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography.
PODC 1998: 101-111 |
| 35 | | Eyal Kushilevitz,
Yishay Mansour,
Michael O. Rabin,
David Zuckerman:
Lower Bounds for Randomized Mutual Exclusion.
SIAM J. Comput. 27(6): 1550-1563 (1998) |
| 1997 |
|---|
| 34 | | Michael O. Rabin:
Correctness of Programs and Protocols through Randomization (Extended Abstract).
ASIAN 1997: 1-3 |
| 1996 |
|---|
| 33 | | Michael O. Rabin:
Computationally Hard Algebraic Problems (extended abstract).
FOCS 1996: 284-289 |
| 1995 |
|---|
| 32 | | Partha Dasgupta,
Zvi M. Kedem,
Michael O. Rabin:
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach.
ICDCS 1995: 467-474 |
| 31 | | Eyal Kushilevitz,
Yishay Mansour,
Michael O. Rabin:
On Lotteries with Unique Winners.
SIAM J. Discrete Math. 8(1): 93-98 (1995) |
| 1994 |
|---|
| 30 | | 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 |
|---|
| 29 | | Yonatan Aumann,
Zvi M. Kedem,
Krishna V. Palem,
Michael O. Rabin:
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs
FOCS 1993: 271-280 |
| 28 | | Eyal Kushilevitz,
Yishay Mansour,
Michael O. Rabin,
David Zuckerman:
Lower bounds for randomized mutual exclusion.
STOC 1993: 154-163 |
| 1992 |
|---|
| 27 | | Michael O. Rabin:
Dependable Parallel Computing by Randomization (Abstract).
25th Anniversary of INRIA 1992: 19-20 |
| 26 | | Yonatan Aumann,
Michael O. Rabin:
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)
FOCS 1992: 147-156 |
| 25 | | Eyal Kushilevitz,
Michael O. Rabin:
Randomized Mutual Exclusion Algorithms Revisited.
PODC 1992: 275-283 |
| 24 | | 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 |
| 1989 |
|---|
| 23 | | Michael O. Rabin,
J. D. Tygar:
ITOSS: An Integrated Toolkit For Operating System Security.
FODO 1989: 2-15 |
| 22 | | Michael O. Rabin:
Efficient dispersal of information for security, load balancing, and fault tolerance.
J. ACM 36(2): 335-348 (1989) |
| 21 | | Michael O. Rabin,
Vijay V. Vazirani:
Maximum Matchings in General Graphs Through Randomization.
J. Algorithms 10(4): 557-567 (1989) |
| 1987 |
|---|
| 20 | | Benny Chor,
Michael O. Rabin:
Achieving Independence in Logarithmic Number of Rounds.
PODC 1987: 260-268 |
| 19 | | Joseph Y. Halpern,
Michael O. Rabin:
A Logic to Reason about Likelihood.
Artif. Intell. 32(3): 379-405 (1987) |
| 18 | | Richard M. Karp,
Michael O. Rabin:
Efficient Randomized Pattern-Matching Algorithms.
IBM Journal of Research and Development 31(2): 249-260 (1987) |
| 1983 |
|---|
| 17 | | Michael O. Rabin:
Randomized Byzantine Generals
FOCS 1983: 403-409 |
| 16 | | Joseph Y. Halpern,
Michael O. Rabin:
A Logic to Reason about Likelihood
STOC 1983: 310-319 |
| 15 | | Michael O. Rabin:
Transaction Protection by Beacons.
J. Comput. Syst. Sci. 27(2): 256-267 (1983) |
| 1982 |
|---|
| 14 | | Michael O. Rabin:
The Choice Coordination Problem.
Acta Inf. 17: 121-134 (1982) |
| 13 | | 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 |
|---|
| 12 | | 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 |
|---|
| 11 | | Michael O. Rabin:
N-Process Synchronization by 4 log _2 N-Valued Shared Variables
FOCS 1980: 407-410 |
| 10 | | Michael O. Rabin:
Probabilistic Algorithms in Finite Fields.
SIAM J. Comput. 9(2): 273-280 (1980) |
| 1977 |
|---|
| 9 | | Michael O. Rabin:
Complexity of Computations.
Commun. ACM 20(9): 625-633 (1977) |
| 1974 |
|---|
| 8 | | Michael O. Rabin:
Theoretical Impediments to Artificial Intelligence.
IFIP Congress 1974: 615-619 |
| 7 | | Vaughan R. Pratt,
Michael O. Rabin,
Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines
STOC 1974: 122-134 |
| 1972 |
|---|
| 6 | | Michael O. Rabin:
Proving Simultaneous Positivity of Linear Forms.
J. Comput. Syst. Sci. 6(6): 639-650 (1972) |
| 1971 |
|---|
| 5 | | Michael O. Rabin,
Michael Morley:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 36(4): 696-710 (1971) |
| 1966 |
|---|
| 4 | | 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 |
|---|
| 3 | | Michael O. Rabin:
Probabilistic Automata
Information and Control 6(3): 230-245 (1963) |
| 2 | | Michael O. Rabin,
Hao Wang:
Words in the History of a Turing Machine with a Fixed Input.
J. ACM 10(4): 526-527 (1963) |
| 1958 |
|---|
| 1 | | Michael O. Rabin:
On Recursively Enumerable and Arithmetic Models of Set Theory.
J. Symb. Log. 23(4): 408-416 (1958) |
