Michael Ben-Or

10.7k total citations · 1 hit paper
52 papers, 4.5k citations indexed

About

Michael Ben-Or is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Michael Ben-Or has authored 52 papers receiving a total of 4.5k indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Artificial Intelligence, 25 papers in Computational Theory and Mathematics and 20 papers in Computer Networks and Communications. Recurrent topics in Michael Ben-Or's work include Distributed systems and fault tolerance (16 papers), Cryptography and Data Security (15 papers) and Quantum Information and Cryptography (10 papers). Michael Ben-Or is often cited by papers focused on Distributed systems and fault tolerance (16 papers), Cryptography and Data Security (15 papers) and Quantum Information and Cryptography (10 papers). Michael Ben-Or collaborates with scholars based in Israel, United States and Moldova. Michael Ben-Or's 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 and has published in prestigious journals such as IEEE Transactions on Information Theory, Physical Review A and Soil Science Society of America Journal.

In The Last Decade

Michael Ben-Or

50 papers receiving 4.1k 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.

Completeness theorems for non-cryptographic fault-tolerant distributed computation

1988 962 citations Michael Ben-Or, Avi Wigderson profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Michael Ben-Or Israel	27	3.3k	1.8k	1.3k	714	477	52	4.5k
Eyal Kushilevitz Israel	34	4.6k 1.4×	1.9k 1.1×	1.4k 1.1×	743 1.0×	201 0.4×	126	5.5k
Márió Szegedy United States	28	3.2k 1.0×	3.2k 1.8×	1.5k 1.2×	273 0.4×	205 0.4×	83	5.2k
Salil Vadhan United States	33	3.1k 0.9×	1.7k 0.9×	869 0.7×	457 0.6×	139 0.3×	137	4.2k
Michael Sipser United States	24	2.3k 0.7×	2.4k 1.3×	505 0.4×	188 0.3×	205 0.4×	41	3.7k
Russell Impagliazzo United States	40	4.0k 1.2×	4.4k 2.4×	1.1k 0.8×	320 0.4×	78 0.2×	154	6.1k
H. W. Lenstra United States	27	2.6k 0.8×	1.6k 0.9×	806 0.6×	1.1k 1.6×	60 0.1×	94	5.0k
Ken‐ichi Kawarabayashi Japan	26	1.3k 0.4×	1.8k 1.0×	745 0.6×	150 0.2×	192 0.4×	274	3.7k
Johan Håstad Sweden	30	2.4k 0.7×	2.7k 1.5×	1.2k 1.0×	221 0.3×	52 0.1×	111	4.6k
László Babai United States	40	4.0k 1.2×	4.2k 2.3×	936 0.7×	193 0.3×	104 0.2×	165	6.8k
David Zuckerman United States	31	1.8k 0.5×	1.7k 0.9×	1.2k 0.9×	122 0.2×	65 0.1×	96	3.5k

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-authorship network of co-authors of Michael Ben-Or

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Ben-Or. A scholar is included among the top collaborators of Michael Ben-Or 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 Ben-Or. Michael Ben-Or 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

1.

Lib, Ohad, et al.. (2025). High-dimensional quantum key distribution using a multi-plane light converter. 3(2). 182–182. 7 indexed citations

2.

Korenblit, S. É., et al.. (2025). High-dimensional coherent one-way quantum key distribution. npj Quantum Information. 11(1). 7 indexed citations

3.

Ben-Or, Michael, et al.. (2018). A Quasi-Random Approach to Matrix Spectral Analysis. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 94. 22. 1 indexed citations

4.

Ben-Or, Michael, et al.. (2014). Quantum Multiprover Interactive Proofs with Communicating Provers. SIAM Journal on Computing. 43(3). 987–1011. 1 indexed citations

5.

Ben-Or, Michael, Guy J. Levy, Yael G. Mishael, & Arie Nadler. (2013). Salinity Effects on the Fieldscout TDR 300 Soil Moisture Meter Readings. Soil Science Society of America Journal. 77(2). 412–416. 5 indexed citations

6.

Aharonov, Dorit, et al.. (2008). Interactive Proofs For Quantum Computations. ArXiv.org. 453–469. 38 indexed citations

7.

Aharonov, Dorit & Michael Ben-Or. (2008). Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM Journal on Computing. 38(4). 1207–1282. 289 indexed citations

8.

Aharonov, Dorit & Michael Ben-Or. (2002). Polynomial simulations of decohered quantum computers. 46–55. 19 indexed citations

9.

Feig, Ephraim & Michael Ben-Or. (1997). On algebras related to the discrete cosine transform. Linear Algebra and its Applications. 266. 81–106. 2 indexed citations

10.

Ben-Or, Michael, et al.. (1994). Asynchronous secure computations with optimal resilience (extended abstract). 183–192. 69 indexed citations

11.

Ben-Or, Michael, Ran Canetti, & Oded Goldreich. (1993). Asynchronous secure computation. 52–61. 78 indexed citations

12.

Ben-Or, Michael & Richard Cleve. (1992). Computing Algebraic Formulas Using a Constant Number of Registers. SIAM Journal on Computing. 21(1). 54–58. 62 indexed citations

13.

Ben-Or, Michael & Prasoon Tiwari. (1990). Simple algorithms for approximating all roots of a polynomial with real roots. Journal of Complexity. 6(4). 417–442. 31 indexed citations

14.

Rabin, Tal & Michael Ben-Or. (1989). Verifiable secret sharing and multiparty protocols with honest majority. 73–85. 352 indexed citations

15.

Ben-Or, Michael & Prasoon Tiwari. (1988). A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). 301–309. 11 indexed citations

16.

Ben-Or, Michael, Shafi Goldwasser, & Avi Wigderson. (1988). Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). 130 indexed citations

17.

Ben-Or, Michael, Dexter Kozen, & John H. Reif. (1986). The complexity of elementary algebra and geometry. Journal of Computer and System Sciences. 32(2). 251–264. 116 indexed citations

18.

Ben-Or, Michael & Nathan Linial. (1985). Collective coin flipping, robust voting schemes and minima of Banzhaf values. 408–416. 68 indexed citations

19.

Ben-Or, Michael. (1983). Lower Bounds for Algebraic Computation Trees (Preliminary Report). 80–86. 9 indexed citations

20.

Ben-Or, Michael. (1983). Another advantage of free choice (Extended Abstract). 27–30. 288 indexed citations

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