Остановите войну!
for scientists:
default search action
Michael O. Rabin
- > Home > Persons > Michael O. Rabin
Publications
- 2012
- [c36]Michael O. Rabin:
Never too early to begin: computer science for high-school students. ITiCSE 2012: 1 - 2007
- [c33]Michael O. Rabin:
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. DISC 2007: 506-508 - 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) - 2003
- [c29]Michael O. Rabin:
Hyper Encryption and Everlasting Secrets. CIAC 2003: 7-10 - 1997
- [c20]Michael O. Rabin:
Correctness of Programs and Protocols through Randomization (Extended Abstract). ASIAN 1997: 1-3 - [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 - 1992
- [c12]Michael O. Rabin:
Dependable Parallel Computing by Randomization (Abstract). 25th Anniversary of INRIA 1992: 19-20 - 1989
- [j18]Michael O. Rabin:
Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2): 335-348 (1989) - 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 - 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) - 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 - 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 - 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 - 1963
- [j6]Michael O. Rabin:
Probabilistic Automata. Inf. Control. 6(3): 230-245 (1963) - 1958
- [j1]Michael O. Rabin:
On Recursively Enumerable and Arithmetic Models of Set Theory. J. Symb. Log. 23(4): 408-416 (1958)
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2023-09-28 02:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint