( en | de | ru )

 

Disambiguation of "Rabin, Michael O."

Author of the publication

copydeleteadd this publication to your clipboard
Finite Automata and Their Decision Problems.

, and . IBM J. Res. Dev., 3 (2): 114-125 (1959)

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

Eugene Rabinowitch

 

Other publications of authors with the same name

Efficient Randomized Pattern-Matching Algorithms., and . IBM J. Res. Dev., 31 (2): 249-260 (1987)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)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)Lower Bounds for Randomized Mutual Exclusion., , , and . SIAM J. Comput., 27 (6): 1550-1563 (1998)Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk., and . Theory Comput. Syst., 35 (3): 289-304 (2002)Practical secrecy-preserving, verifiably correct and trustworthy auctions., , , and . ICEC, volume 156 of ACM International Conference Proceeding Series, page 70-81. ACM, (2006)Probabilistic Automata. Inf. Control., 6 (3): 230-245 (September 1963)Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor., and . J. Symb. Log., 31 (2): 169-181 (1966)On Recursively Enumerable and Arithmetic Models of Set Theory.. J. Symb. Log., 23 (4): 408-416 (1958)Hyper-Encryption and Everlasting Security., and . STACS, volume 2285 of Lecture Notes in Computer Science, page 1-26. Springer, (2002)