default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael O. Rabin
Refine list
refinements active!
zoomed in on 67 of 67 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2010 – 2019
- 2014
[j28]Silvio Micali, Michael O. Rabin:
Cryptography miracles, secure auctions, matching problem verification. Commun. ACM 57(2): 85-93 (2014)- 2012
- [c37]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 - [c36]Michael O. Rabin:
Never too early to begin: computer science for high-school students. ITiCSE 2012: 1 - no results
2000 – 2009
- 2009
- [c35]David C. Parkes, Michael O. Rabin, Christopher Thorpe:
Cryptographic Combinatorial Clock-Proxy Auctions. Financial Cryptography 2009: 305-324 - 2008
- [j27]David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe:
Practical secrecy-preserving, verifiably correct and trustworthy auctions. Electron. Commer. Res. Appl. 7(3): 294-312 (2008) - 2007
- [c34]Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. LICS 2007: 63-76 - [c33]Michael O. Rabin:
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. DISC 2007: 506-508 - 2006
- [c32]David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe:
Practical secrecy-preserving, verifiably correct and trustworthy auctions. ICEC 2006: 70-81 - 2005
- [c31]Michael O. Rabin:
Provably unbreakable hyper-encryption in the limited access model. ICITS 2005: 34-37 - [i2]Michael O. Rabin:
How To Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch. 2005: 187 (2005) - 2004
- [c30]Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin:
Identity-Based Zero Knowledge. SCN 2004: 180-192 - 2003
- [c29]Michael O. Rabin:
Hyper Encryption and Everlasting Secrets. CIAC 2003: 7-10 - [c28]Silvio Micali, Michael O. Rabin, Joe Kilian:
Zero-Knowledge Sets. FOCS 2003: 80-91 - 2002
- [j26]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) - [j25]Yonatan Aumann, Yan Zong Ding, Michael O. Rabin:
Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6): 1668-1680 (2002) - [c27]Yan Zong Ding, Michael O. Rabin:
Hyper-Encryption and Everlasting Security. STACS 2002: 1-26 - 2001
- [j24]Yonatan Aumann, Johan Håstad
, Michael O. Rabin, Madhu Sudan:
Linear-Consistency Testing. J. Comput. Syst. Sci. 62(4): 589-607 (2001) - 2000
- [c26]Michael A. Bender, Michael O. Rabin:
Scheduling Cilk multithreaded parallel programs on processors of different speeds. SPAA 2000: 13-21 - no results
1990 – 1999
- 1999
- [c25]Yonatan Aumann, Michael O. Rabin:
Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO 1999: 65-79 - [c24]Silvio Micali, Michael O. Rabin, Salil P. Vadhan:
Verifiable Random Functions. FOCS 1999: 120-130 - [c23]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. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j23]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman:
Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998) - [c22]Yonatan Aumann, Michael O. Rabin:
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO 1998: 299-303 - [c21]Rosario Gennaro, Michael O. Rabin, Tal Rabin:
Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. PODC 1998: 101-111 - 1997
- [c20]Michael O. Rabin:
Correctness of Programs and Protocols through Randomization (Extended Abstract). ASIAN 1997: 1-3 - [c19]Laura F. Landweber, Richard J. Lipton, Michael O. Rabin:
DNA2DNA computations: A potential "killer app?". DNA Based Computers 1997: 161-172 - [c18]Michael O. Rabin:
Hashing on strings, cryptography, and protection of privacy. SEQUENCES 1997 - 1996
- [c17]Michael O. Rabin:
Computationally Hard Algebraic Problems (extended abstract). FOCS 1996: 284-289 - 1995
- [j22]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin:
On Lotteries with Unique Winners. SIAM J. Discret. 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
- [j21]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
- [j20]Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:
Set systems with no union of cardinality 0 modulom. Graphs Comb. 7(2): 97-99 (1991) - no results
1980 – 1989
- 1989
- [j19]Noga Alon, Michael O. Rabin:
Biased Coins and Randomized Algorithms. Adv. Comput. Res. 5: 499-507 (1989) - [j18]Michael O. Rabin:
Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2): 335-348 (1989) - [j17]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: 1-15 - 1987
- [j16]Joseph Y. Halpern, Michael O. Rabin:
A Logic to Reason about Likelihood. Artif. Intell. 32(3): 379-405 (1987) - [j15]Richard M. Karp, Michael O. Rabin:
Efficient Randomized Pattern-Matching Algorithms. IBM J. Res. Dev. 31(2): 249-260 (1987) - [c8]Benny Chor, Michael O. Rabin:
Achieving Independence in Logarithmic Number of Rounds. PODC 1987: 260-268 - 1983
- [j14]Michael O. Rabin:
Transaction Protection by Beacons. J. Comput. Syst. Sci. 27(2): 256-267 (1983) - [c7]Michael O. Rabin:
Randomized Byzantine Generals. FOCS 1983: 403-409 - [c6]Joseph Y. Halpern, Michael O. Rabin:
A Logic to Reason about Likelihood. STOC 1983: 310-319 - 1982
- [j13]Michael O. Rabin:
The Choice Coordination Problem. Acta Informatica 17: 121-134 (1982) - [j12]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 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
- [j11]Michael O. Rabin:
Probabilistic Algorithms in Finite Fields. SIAM J. Comput. 9(2): 273-280 (1980) - [c4]Michael O. Rabin:
N-Process Synchronization by 4 log _2 N-Valued Shared Variables. FOCS 1980: 407-410 - no results
1970 – 1979
- 1977
- [j10]Michael O. Rabin:
Complexity of Computations. Commun. ACM 20(9): 625-633 (1977) - 1974
- [c3]Michael O. Rabin:
Theoretical Impediments to Artificial Intelligence. IFIP Congress 1974: 615-619 - [c2]Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. STOC 1974: 122-134 - 1972
- [j9]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
- [j8]Michael O. Rabin, Michael D. Morley:
Meeting of the Association for Symbolic Logic. J. Symb. Log. 36(4): 696-710 (1971) - no results
1960 – 1969
- 1966
- [j7]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
- [j6]Michael O. Rabin:
Probabilistic Automata. Inf. Control. 6(3): 230-245 (1963) - [j5]Michael O. Rabin, Hao Wang:
Words in the History of a Turing Machine with a Fixed Input. J. ACM 10(4): 526-527 (1963) - [j4]Micha A. Perles, Michael O. Rabin, Eliahu Shamir:
The Theory of Definite Automata. IEEE Trans. Electron. Comput. 12(3): 233-243 (1963) - no results
1950 – 1959
- 1959
- [j3]Michael O. Rabin, Dana S. Scott:
Finite Automata and Their Decision Problems. IBM J. Res. Dev. 3(2): 114-125 (1959) - [j2]W. Wesley Peterson, Michael O. Rabin:
On Codes for Checking Logical Operations. IBM J. Res. Dev. 3(2): 163-168 (1959) - 1958
- [j1]Michael O. Rabin:
On Recursively Enumerable and Arithmetic Models of Set Theory. J. Symb. Log. 23(4): 408-416 (1958) - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-09-27 03:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
