| Finite automata and their decision problems MO Rabin, D Scott IBM journal of research and development 3 (2), 114-125, 1959 | 2753 | 1959 |
| Efficient dispersal of information for security, load balancing, and fault tolerance MO Rabin Journal of the ACM (JACM) 36 (2), 335-348, 1989 | 2150 | 1989 |
| Efficient randomized pattern-matching algorithms RM Karp, MO Rabin IBM journal of research and development 31 (2), 249-260, 1987 | 2003 | 1987 |
| Decidability of second-order theories and automata on infinite trees. MO Rabin Transactions of the american Mathematical Society 141, 1-35, 1969 | 1894 | 1969 |
| Digitalized signatures and public-key functions as intractable as factorization MO Rabin | 1654 | 1979 |
| Scheme for information dispersal and reconstruction MO Rabin US Patent 5,485,474, 1996 | 1458 | 1996 |
| Probabilistic algorithm for testing primality MO Rabin Journal of number theory 12 (1), 128-138, 1980 | 1359 | 1980 |
| Fingerprinting by random polynomials MO Rabin Technical report, 1981 | 1345 | 1981 |
| Probabilistic automata MO Rabin Information and control 6 (3), 230-245, 1963 | 1182 | 1963 |
| Verifiable random functions S Micali, M Rabin, S Vadhan 40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999 | 939 | 1999 |
| Randomized byzantine generals MO Rabin 24th annual symposium on foundations of computer science (sfcs 1983), 403-409, 1983 | 771 | 1983 |
| PROBABILISTIC ALGORITHMS. MO Rabin | 717 | 1976 |
| Simplified VSS and fast-track multiparty computations with applications to threshold cryptography R Gennaro, MO Rabin, T Rabin Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998 | 691 | 1998 |
| Super-exponential complexity of Presburger arithmetic MJ Fischer, MO Rabin Quantifier Elimination and Cylindrical Algebraic Decomposition, 122-135, 1998 | 557 | 1998 |
| Probabilistic algorithms in finite fields MO Rabin SIAM Journal on computing 9 (2), 273-280, 1980 | 499 | 1980 |
| Computable algebra, general theory and theory of computable fields. MO Rabin Transactions of the American Mathematical Society 95 (2), 341-360, 1960 | 477 | 1960 |
| Automata on infinite objects and Church's problem MO Rabin American Mathematical Soc., 1972 | 427 | 1972 |
| Digitalized signatures MO Rabin Foundations of secure computation, 155-168, 1978 | 418 | 1978 |
| On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem D Lehmann, MO Rabin Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of …, 1981 | 350 | 1981 |
| Recursive unsolvability of group theoretic problems MO Rabin Annals of Mathematics 67 (1), 172-194, 1958 | 348 | 1958 |
