( en | de | ru )

 

Disambiguation of "Rabin, Michael O"

Author of the publication

copydeleteadd this publication to your clipboard
Probabilistic algorithm for testing primality

. Journal of Number Theory, 12 (1): 128 - 138 (1980)
DOI: http://dx.doi.org/10.1016/0022-314X(80)90084-0

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Isaak Rabinowitsch

Aladár Rabinek

Gennadi Rabinovitch

Michael -O Jung

Mirjam Rabinowitsch

 

Other publications of authors with the same name

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk., and . Theory Comput. Syst., 35 (3): 289-304 (2002)Efficient Randomized Pattern-Matching Algorithms., and . IBM J. Res. Dev., 31 (2): 249-260 (1987)DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.. DISC, volume 4731 of Lecture Notes in Computer Science, page 506-508. Springer, (2007)On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem., and . POPL, page 133-138. ACM Press, (1981)Practical secrecy-preserving, verifiably correct and trustworthy auctions., , , and . ICEC, volume 156 of ACM International Conference Proceeding Series, page 70-81. ACM, (2006)DNA2DNA computations: A potential "killer app?"., , and . DNA Based Computers, volume 48 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 161-172. DIMACS/AMS, (1997)Words in the History of a Turing Machine with a Fixed Input., and . J. ACM, 10 (4): 526-527 (1963)Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)., and . CRYPTO, volume 1462 of Lecture Notes in Computer Science, page 299-303. Springer, (1998)Lower bounds for randomized mutual exclusion., , , and . STOC, page 154-163. ACM, (1993)Information Theoretically Secure Communication in the Limited Storage Space Model., and . CRYPTO, volume 1666 of Lecture Notes in Computer Science, page 65-79. Springer, (1999)