Amos Beimel

4.9k total citations
63 papers, 1.5k citations indexed

About

Amos Beimel is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Amos Beimel has authored 63 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Artificial Intelligence, 43 papers in Computational Theory and Mathematics and 15 papers in Computer Networks and Communications. Recurrent topics in Amos Beimel's work include Cryptography and Data Security (44 papers), Complexity and Algorithms in Graphs (41 papers) and Privacy-Preserving Technologies in Data (21 papers). Amos Beimel is often cited by papers focused on Cryptography and Data Security (44 papers), Complexity and Algorithms in Graphs (41 papers) and Privacy-Preserving Technologies in Data (21 papers). Amos Beimel collaborates with scholars based in Israel, United States and United Kingdom. Amos Beimel's co-authors include Yuval Ishai, Eyal Kushilevitz, Benny Chor, Shlomi Dolev, Enav Weinreb, Kobbi Nissim, Tal Malkin, Uri Stemmer, Mike Paterson and Tamir Tassa and has published in prestigious journals such as IEEE Transactions on Information Theory, Artificial Intelligence and Journal of the ACM.

In The Last Decade

Amos Beimel

58 papers receiving 1.4k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Amos Beimel Israel	19	1.3k	518	340	331	168	63	1.5k
Tal Rabin United States	21	1.5k 1.1×	405 0.8×	603 1.8×	579 1.7×	195 1.2×	46	1.8k
Yuval Ishai Israel	27	2.1k 1.6×	834 1.6×	390 1.1×	452 1.4×	178 1.1×	104	2.3k
Ronald Cramer Netherlands	17	1.5k 1.1×	337 0.7×	336 1.0×	464 1.4×	235 1.4×	45	1.6k
Tal Malkin United States	20	1.1k 0.8×	310 0.6×	416 1.2×	268 0.8×	134 0.8×	54	1.4k
Gilles Barthe Spain	23	1.8k 1.4×	563 1.1×	440 1.3×	315 1.0×	78 0.5×	148	2.0k
Eli Ben‐Sasson Israel	22	1.3k 1.0×	1.1k 2.1×	360 1.1×	270 0.8×	64 0.4×	85	1.7k
Yuliang Zheng Australia	15	849 0.6×	197 0.4×	248 0.7×	350 1.1×	222 1.3×	103	1.1k
Stanisław Jarecki United States	16	1.1k 0.8×	239 0.5×	410 1.2×	609 1.8×	208 1.2×	31	1.3k
Chris Peikert United States	17	1.5k 1.1×	566 1.1×	243 0.7×	461 1.4×	305 1.8×	31	1.6k
Rosario Gennaro United States	27	2.1k 1.6×	389 0.8×	657 1.9×	896 2.7×	367 2.2×	70	2.4k

Countries citing papers authored by Amos Beimel

Since Specialization

Citations

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

Fields of papers citing papers by Amos Beimel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Amos Beimel

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

Beimel, Amos, et al.. (2022). Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM Journal on Computing. 51(4). 1126–1171.

Beimel, Amos, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, & Uri Stemmer. (2020). The power of synergy in differential privacy: Combining a small curator with local randomizers. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 1 indexed citations

Beimel, Amos, Kobbi Nissim, & Uri Stemmer. (2019). Characterizing the Sample Complexity of Pure Private Learners. Journal of Machine Learning Research. 20(146). 1–33. 3 indexed citations

Beimel, Amos, et al.. (2017). Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.. 24. 168. 2 indexed citations

Beimel, Amos, Kobbi Nissim, & Uri Stemmer. (2016). . Theory of Computing. 12(1). 1–61. 22 indexed citations

Beimel, Amos, Yeow Meng Chee, Huaxiong Wang, & Liang Feng Zhang. (2012). Communication-efficient distributed oblivious transfer. Journal of Computer and System Sciences. 78(4). 1142–1157.

Karpas, Erez, Solomon Eyal Shimony, & Amos Beimel. (2009). Approximate belief updating in max-2-connected Bayes networks is NP-hard. Artificial Intelligence. 173(12-13). 1150–1153. 3 indexed citations

Beimel, Amos, et al.. (2008). On Matroids and Nonideal Secret Sharing. IEEE Transactions on Information Theory. 54(6). 2626–2643. 8 indexed citations

Beimel, Amos, et al.. (2006). On Matroids and Non-ideal Secret Sharing. 1 indexed citations

10.

Beimel, Amos, Yuval Ishai, & Eyal Kushilevitz. (2005). General constructions for information-theoretic private information retrieval. Journal of Computer and System Sciences. 71(2). 213–247. 63 indexed citations

11.

Beimel, Amos, et al.. (2003). Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval. 261–270. 118 indexed citations

12.

Beimel, Amos, et al.. (2001). The Query Complexity of Finding Local Minima in the Lattice. Information and Computation. 171(1). 69–83. 1 indexed citations

13.

Beimel, Amos & Yuval Ishai. (2001). Information-Theoretic Private Information Retrieval: A Unified Construction. Lecture notes in computer science. 8. 912–926. 8 indexed citations

14.

Beimel, Amos & Anna Gál. (1999). On Arithmetic Branching Programs. Journal of Computer and System Sciences. 59(2). 195–220. 8 indexed citations

15.

Beimel, Amos & Matthew Franklin. (1999). Reliable communication over partially authenticated networks. Theoretical Computer Science. 220(1). 185–210. 19 indexed citations

16.

Beimel, Amos & Benny Chor. (1998). Secret sharing with public reconstruction. IEEE Transactions on Information Theory. 44(5). 1887–1896. 32 indexed citations

17.

Beimel, Amos & Benny Chor. (1995). Secret Sharing with Public Reconstruction (Extended Abstract). 353–366. 1 indexed citations

18.

Beimel, Amos & Benny Chor. (1994). Universally ideal secret-sharing schemes. IEEE Transactions on Information Theory. 40(3). 786–794. 60 indexed citations

19.

Beimel, Amos & Benny Chor. (1993). Interaction in Key Distribution Schemes (Extended Abstract). 444–455. 2 indexed citations

20.

Beimel, Amos & Benny Chor. (1992). Universally Ideal Secret Sharing Schemes (Preliminary Version). 183–195. 5 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