Michael Ben-Or

10.8k citations
52 papers · 4.6k · 1 hit paper · h-index 27

Impact in

Papers in

    • Cryptography and Data Security 15
    • Quantum Information and Cryptography 10
    • Quantum Computing Algorithms and Architecture 8
    • Privacy-Preserving Technologies in Data 5
    • Complexity and Algorithms in Graphs 9
    • Polynomial and algebraic computation 8

Michael Ben-Or

50 papers receiving 4.2k citations

Michael Ben-Or's Hit Papers

Completeness theorems for non-cryptographic fault-tolerant distributed computation 1988 · 968 citations
9680+12+25Years since publication250500750

Peers

Michael Ben-Or
Comparison fields: 5 of 90
  • Computational Theory and Mathematics 1.8k
  • Artificial Intelligence 3.3k
  • Computer Graphics and Computer-Aided Design 208
  • Computer Networks and Communications 1.3k
  • Computational Mathematics 20
Replace Márió Szegedy with:
Márió Szegedy United States
Eyal Kushilevitz Israel
Russell Impagliazzo United States
Michael Sipser United States
H. W. Lenstra United States
Salil Vadhan United States
Larry Stockmeyer United States
Ran Raz Israel
Ken‐ichi Kawarabayashi Japan
Ronitt Rubinfeld United States
Michael Ben-Or relative to Márió Szegedy United States Márió Szegedy's profile →
Citations per field
00.5×6.5×
Márió Szegedy · 1×
Citations per year

Countries citing papers authored by Michael Ben-Or

Since Specialization
Citations

This map shows the geographic impact of Michael Ben-Or'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 Ben-Or with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Ben-Or more than expected).

Fields of papers citing papers by Michael Ben-Or

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Ben-Or. 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 Ben-Or. The network helps show where Michael Ben-Or may publish in the future.

Co-authors

The 25 scholars most cited alongside Michael Ben-Or, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michael Ben-Or Line = papers co-authored together Michael Ben-Or links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 52 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Hit paper breakdown →
1988968
2 1989352
3 1983317
4 1997316
5 2008297
6 1983292
7 1988227
8 1988177
9 1990149
10
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
1988131
11
Collective Coin Flipping.
1989128
12
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
2000126
13 1986116
14 1981106
15 199380
16 199470
17 198568
18 198467
19 199263
20 200560

About Michael Ben-Or

Michael Ben-Or is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Atomic and Molecular Physics, and Optics and Information Systems, having authored 52 papers that have together received 4.6k indexed citations. Recurring topics across this work include Distributed systems and fault tolerance (16 papers), Cryptography and Data Security (15 papers), Quantum Information and Cryptography (10 papers), Complexity and Algorithms in Graphs (9 papers), Quantum Computing Algorithms and Architecture (8 papers), Polynomial and algebraic computation (8 papers), Optimization and Search Problems (5 papers) and Privacy-Preserving Technologies in Data (5 papers). The work is most often cited by research in Computational Theory and Mathematics (1.8k citations), Artificial Intelligence (3.3k citations), Computer Graphics and Computer-Aided Design (208 citations), Computer Networks and Communications (1.3k citations) and Computational Mathematics (20 citations). Michael Ben-Or has collaborated with scholars based in Israel, United States and Moldova. Frequent co-authors include Avi Wigderson, Dorit Aharonov, Tal Rabin, Shafi Goldwasser, Nathan Linial, Oded Goldreich, Dexter Kozen, Joe Kilian, John H. Reif and Avinatan Hassidim. Their work appears in journals such as SIAM Journal on Computing, Distributed Computing, Physical Review A, Journal of Computer and System Sciences and Quantum.

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