Ronen Shaltiel

2.3k total citations
56 papers, 691 citations indexed

About

Ronen Shaltiel is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Ronen Shaltiel has authored 56 papers receiving a total of 691 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Artificial Intelligence, 48 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Ronen Shaltiel's work include Complexity and Algorithms in Graphs (44 papers), Cryptography and Data Security (30 papers) and Computability, Logic, AI Algorithms (15 papers). Ronen Shaltiel is often cited by papers focused on Complexity and Algorithms in Graphs (44 papers), Cryptography and Data Security (30 papers) and Computability, Logic, AI Algorithms (15 papers). Ronen Shaltiel collaborates with scholars based in Israel, United States and Canada. Ronen Shaltiel's co-authors include Avi Wigderson, Christopher Umans, Chris Umans, Boaz Barak, Russell Impagliazzo, Amnon Ta‐Shma, Dan Gutfreund, Anup Rao, Omer Reingold and Ariel Gabizon and has published in prestigious journals such as Journal of the ACM, Annals of Mathematics and SIAM Journal on Computing.

In The Last Decade

Ronen Shaltiel

52 papers receiving 639 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ronen Shaltiel Israel 15 532 531 93 81 58 56 691
Anup Rao United States 16 368 0.7× 340 0.6× 97 1.0× 109 1.3× 50 0.9× 40 527
Zeev Dvir United States 13 332 0.6× 346 0.7× 115 1.2× 111 1.4× 104 1.8× 53 562
Valentine Kabanets Canada 15 647 1.2× 507 1.0× 64 0.7× 103 1.3× 25 0.4× 50 728
Tali Kaufman Israel 15 368 0.7× 343 0.6× 53 0.6× 158 2.0× 58 1.0× 51 542
Nati Linial Israel 11 216 0.4× 169 0.3× 48 0.5× 52 0.6× 92 1.6× 35 353
Doug Wiedemann Canada 6 224 0.4× 276 0.5× 137 1.5× 67 0.8× 45 0.8× 6 435
Mauricio Karchmer Israel 14 544 1.0× 429 0.8× 107 1.2× 141 1.7× 33 0.6× 19 696
Alexander A. Sherstov United States 17 470 0.9× 505 1.0× 99 1.1× 77 1.0× 11 0.2× 55 624
Mikael Goldmann Sweden 11 312 0.6× 313 0.6× 91 1.0× 74 0.9× 15 0.3× 19 463
V. Arvind India 11 305 0.6× 236 0.4× 35 0.4× 48 0.6× 20 0.3× 86 398

Countries citing papers authored by Ronen Shaltiel

Since Specialization
Citations

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

Fields of papers citing papers by Ronen Shaltiel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ronen Shaltiel

This figure shows the co-authorship network connecting the top 25 collaborators of Ronen Shaltiel. A scholar is included among the top collaborators of Ronen Shaltiel 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 Ronen Shaltiel. Ronen Shaltiel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Kopparty, Swastik, et al.. (2019). Quasilinear Time List-Decodable Codes for Space Bounded Channels. 302–333. 5 indexed citations
3.
Haitner, Iftach, et al.. (2018). Computational Two-Party Correlation.. 25. 71. 2 indexed citations
4.
5.
Chen, Ruiwen, et al.. (2013). Mining Circuit Lower Bound Proofs for Meta-Algorithms.. Electronic colloquium on computational complexity. 20. 57. 1 indexed citations
6.
Fefferman, Bill, Ronen Shaltiel, Christopher Umans, & Emanuele Viola. (2013). . Theory of Computing. 9(1). 809–843. 11 indexed citations
7.
Shaltiel, Ronen. (2011). Dispersers for Affine Sources with Sub-polynomial Entropy. 247–256. 13 indexed citations
8.
Barak, Boaz, Guy Kindler, Ronen Shaltiel, Benny Sudakov, & Avi Wigderson. (2010). Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors.. Electronic colloquium on computational complexity. 17. 37. 2 indexed citations
9.
Shaltiel, Ronen. (2010). Typically-correct derandomization. ACM SIGACT News. 41(2). 57–72. 5 indexed citations
10.
Shaltiel, Ronen & Christopher Umans. (2009). Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM Journal on Computing. 39(3). 1006–1037. 6 indexed citations
11.
Shaltiel, Ronen. (2008). How to get more mileage from randomness extractors. Random Structures and Algorithms. 33(2). 157–186. 8 indexed citations
12.
Shaltiel, Ronen & Emanuele Viola. (2008). Hardness Amplification Proofs Require Majority. SIAM Journal on Computing. 39(7). 3122–3154.
13.
Ding, Yan Zong, Danny Harnik, Alon Rosen, & Ronen Shaltiel. (2007). Constant-Round Oblivious Transfer in the Bounded Storage Model. Journal of Cryptology. 20(2). 165–202. 8 indexed citations
14.
Gutfreund, Dan, Ronen Shaltiel, & Amnon Ta‐Shma. (2007). If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity. 16(4). 412–441. 23 indexed citations
15.
Barak, Boaz, Anup Rao, Ronen Shaltiel, & Avi Wigderson. (2006). 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. 77. 671–680. 49 indexed citations
16.
Barak, Boaz, Guy Kindler, Ronen Shaltiel, Benny Sudakov, & Avi Wigderson. (2005). Simulating independence. 1–10. 43 indexed citations
17.
Shaltiel, Ronen & Christopher Umans. (2005). Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM. 52(2). 172–216. 82 indexed citations
18.
Shaltiel, Ronen & Christopher Umans. (2005). Pseudorandomness for Approximate Counting and Sampling. Computational Complexity. 15(4). 212–226. 2 indexed citations
19.
Gabizon, Ariel, Ran Raz, & Ronen Shaltiel. (2004). Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. 1267. 394–403. 14 indexed citations
20.
Reingold, Omer, Ronen Shaltiel, & Avi Wigderson. (2000). Extracting Randomness via Repeated Condensing. Electronic colloquium on computational complexity. 7. 1 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

Breakdown of academic impact, for papers by Anup Rao Breakdown of academic impact, for papers by Zeev Dvir Breakdown of academic impact, for papers by Valentine Kabanets Breakdown of academic impact, for papers by Tali Kaufman Breakdown of academic impact, for papers by Nati Linial Breakdown of academic impact, for papers by Doug Wiedemann Breakdown of academic impact, for papers by Mauricio Karchmer Breakdown of academic impact, for papers by Alexander A. Sherstov Breakdown of academic impact, for papers by Mikael Goldmann Breakdown of academic impact, for papers by V. Arvind
Rankless by CCL
2026