Michael O. Rabin

12.1k total citations · 4 hit papers
59 papers, 5.5k citations indexed

About

Michael O. Rabin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Michael O. Rabin has authored 59 papers receiving a total of 5.5k indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 28 papers in Artificial Intelligence and 16 papers in Computer Networks and Communications. Recurrent topics in Michael O. Rabin's work include Computability, Logic, AI Algorithms (14 papers), Cryptography and Data Security (12 papers) and semigroups and automata theory (11 papers). Michael O. Rabin is often cited by papers focused on Computability, Logic, AI Algorithms (14 papers), Cryptography and Data Security (12 papers) and semigroups and automata theory (11 papers). Michael O. Rabin collaborates with scholars based in United States, Israel and Bulgaria. Michael O. Rabin's co-authors include Richard M. Karp, Daniel Lehmann, Rosario Gennaro, Tal Rabin, Robert Z. Norman, Calvin C. Elgot, Joseph Y. Halpern, Vijay V. Vazirani, Michael A. Bender and C. Thorpe and has published in prestigious journals such as Communications of the ACM, Artificial Intelligence and Journal of the ACM.

In The Last Decade

Michael O. Rabin

57 papers receiving 4.7k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Efficient dispersal of information for security, load balancing, and fault tolerance

1989 872 citations Michael O. Rabin profile →
Efficient randomized pattern-matching algorithms

1987 668 citations Michael O. Rabin et al. profile →
Decidability of second-order theories and automata on infinite trees.

1969 536 citations Michael O. Rabin Transactions of the American Mathematical Society profile →
Probabilistic algorithm for testing primality

1980 370 citations Michael O. Rabin Journal of Number Theory profile →

Peers

Countries citing papers authored by Michael O. Rabin

Since Specialization

Citations

This map shows the geographic impact of Michael O. Rabin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael O. Rabin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael O. Rabin more than expected).

Fields of papers citing papers by Michael O. Rabin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael O. Rabin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael O. Rabin. The network helps show where Michael O. Rabin may publish in the future.

Co-authorship network of co-authors of Michael O. Rabin

This figure shows the co-authorship network connecting the top 25 collaborators of Michael O. Rabin. A scholar is included among the top collaborators of Michael O. Rabin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael O. Rabin. Michael O. Rabin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	WITHDRAWN: Practical secrecy-preserving, verifiably correct and trustworthy auctions 2008 ·Electronic Commerce Research and Applications ·David C. Parkes, Michael O. Rabin, Stuart M. Shieber, (unknown)	4
2	Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk 2002 ·Theory of Computing Systems ·Michael A. Bender, Michael O. Rabin	25
3	Clock construction in fully asynchronous parallel systems and PRAM simulation 1994 ·Theoretical Computer Science ·Yonatan Aumann, Michael O. Rabin	13
4	The advantages of free choice: a symmetric and fully distributed solution for the dining philosophers problem 1994 ·Michael O. Rabin, Daniel Lehmann	14
5	Achieving independence in logarithmic number of rounds 1987 ·Benny Chor, Michael O. Rabin	21
6	Transaction protection by beacons 1983 ·Journal of Computer and System Sciences ·Michael O. Rabin	80
7	N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variable 1982 ·Journal of Computer and System Sciences ·Michael O. Rabin	33
8	Probabilistic algorithm for testing primality breakdown → 1980 ·Journal of Number Theory ·Michael O. Rabin	370
9	Probabilistic Algorithms in Finite Fields 1980 ·SIAM Journal on Computing ·Michael O. Rabin	193
10	Theoretical Impediments to Artificial Intelligence. 1974 ·IFIP Congress ·Michael O. Rabin	18
11	Automata on Infinite Objects and Church’s Problem 1972 ·Michael O. Rabin	130
12	Proving simultaneous positivity of linear forms 1972 ·Journal of Computer and System Sciences ·Michael O. Rabin	54
13	Decidability and undecidability of extensions of second (first) order theory of (generalized) successor 1966 ·Journal of Symbolic Logic ·Calvin C. Elgot, Michael O. Rabin	69
14	Probabilistic automata 1963 ·Information and Control ·Michael O. Rabin	338
15	Classes of models and sets of sentences with the intersection property 1962 ·French digital mathematics library (Numdam) ·Michael O. Rabin	10
16	Computable algebra, general theory and theory of computable fields. 1960 ·Transactions of the American Mathematical Society ·Michael O. Rabin	199
17	An algorithm for a minimum cover of a graph 1959 ·Proceedings of the American Mathematical Society ·Robert Z. Norman, Michael O. Rabin	74
18	Arithmetical extensions with prescribed cardinality 1959 ·Indagationes Mathematicae (Proceedings) ·Michael O. Rabin	15
19	On recursively enumerable and arithmetic models of set theory 1958 ·Journal of Symbolic Logic ·Michael O. Rabin	6
20	A note on Helly’s theorem 1955 ·Pacific Journal of Mathematics ·Michael O. Rabin	16

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact