Adi Rosén

1.6k total citations
64 papers, 745 citations indexed

About

Adi Rosén is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Adi Rosén has authored 64 papers receiving a total of 745 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computer Networks and Communications, 26 papers in Computational Theory and Mathematics and 17 papers in Artificial Intelligence. Recurrent topics in Adi Rosén's work include Optimization and Search Problems (33 papers), Complexity and Algorithms in Graphs (25 papers) and Cryptography and Data Security (17 papers). Adi Rosén is often cited by papers focused on Optimization and Search Problems (33 papers), Complexity and Algorithms in Graphs (25 papers) and Cryptography and Data Security (17 papers). Adi Rosén collaborates with scholars based in Israel, France and United States. Adi Rosén's co-authors include Eyal Kushilevitz, Rafail Ostrovsky, William Aiello, Zvi Lotker, Boaz Patt-Shamir, Amos Fiat, Yair Bartal, Baruch Awerbuch, Alex Kesselman and Yuval Emek and has published in prestigious journals such as Cognition, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Adi Rosén

62 papers receiving 695 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Adi Rosén Israel 17 613 250 157 155 82 64 745
Ephraim Korach Israel 14 507 0.8× 259 1.0× 105 0.7× 78 0.5× 34 0.4× 54 703
I. Gopal United States 18 921 1.5× 98 0.4× 112 0.7× 427 2.8× 17 0.2× 40 1.0k
Babak Hamidzadeh Canada 12 215 0.4× 83 0.3× 64 0.4× 62 0.4× 226 2.8× 56 518
Gérard Tel Netherlands 9 517 0.8× 174 0.7× 172 1.1× 46 0.3× 11 0.1× 20 662
Ravishankar Krishnaswamy United States 13 220 0.4× 80 0.3× 83 0.5× 34 0.2× 109 1.3× 39 375
Michael D. Moffitt United States 15 225 0.4× 36 0.1× 106 0.7× 364 2.3× 60 0.7× 38 570
David Daly United States 9 306 0.5× 125 0.5× 59 0.4× 72 0.5× 7 0.1× 30 515
Shlomit S. Pinter Israel 12 418 0.7× 132 0.5× 151 1.0× 48 0.3× 17 0.2× 25 665
John Augustine India 13 285 0.5× 43 0.2× 52 0.3× 37 0.2× 44 0.5× 38 389
Tiko Kameda Canada 12 446 0.7× 102 0.4× 140 0.9× 30 0.2× 13 0.2× 34 548

Countries citing papers authored by Adi Rosén

Since Specialization
Citations

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

Fields of papers citing papers by Adi Rosén

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Adi Rosén

This figure shows the co-authorship network connecting the top 25 collaborators of Adi Rosén. A scholar is included among the top collaborators of Adi Rosén 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 Adi Rosén. Adi Rosén 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.
Katzin, Naama, David Katzin, Adi Rosén, Avishai Henik, & Moti Salti. (2019). Putting the world in mind: The case of mental representation of quantity. Cognition. 195. 104088–104088. 3 indexed citations
2.
Angelopoulos, Spyros, et al.. (2018). Online Bin Packing with Advice of Small Size. Theory of Computing Systems. 62(8). 2006–2034. 9 indexed citations
3.
Rosén, Adi, et al.. (2015). Online algorithms with advice for bin packing and scheduling problems. Theoretical Computer Science. 600. 155–170. 26 indexed citations
4.
Fraigniaud, Pierre, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, & Adi Rosén. (2015). Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica. 74(4). 1205–1223. 2 indexed citations
5.
Carmi, Paz, Matthew J. Katz, Zvi Lotker, & Adi Rosén. (2011). Connectivity guarantees for wireless networks with directional antennas. Computational Geometry. 44(9). 477–485. 20 indexed citations
6.
Naor, Joseph, Adi Rosén, & Gabriel Scalosub. (2010). Online time-constrained scheduling in linear and ring networks. Journal of Discrete Algorithms. 8(4). 346–355. 2 indexed citations
7.
Emek, Yuval, Pierre Fraigniaud, Amos Korman, & Adi Rosén. (2010). Online computation with advice. Theoretical Computer Science. 412(24). 2642–2656. 57 indexed citations
8.
Kesselman, Alex & Adi Rosén. (2008). CONTROLLING CIOQ SWITCHES WITH PRIORITY QUEUING AND IN MULTISTAGE INTERCONNECTION NETWORKS. Journal of Interconnection Networks. 9(01n02). 53–72. 9 indexed citations
9.
Rosén, Adi & Gabriel Scalosub. (2007). Rate vs. buffer size. 305–314. 5 indexed citations
10.
Räcke, Harald & Adi Rosén. (2005). Distributed online call control on general networks. Symposium on Discrete Algorithms. 791–800. 2 indexed citations
11.
Aiello, William, Rafail Ostrovsky, Eyal Kushilevitz, & Adi Rosén. (2003). Dynamic routing on networks with fixed-size buffers. Symposium on Discrete Algorithms. 771–780. 29 indexed citations
12.
Kesselman, Alex & Adi Rosén. (2003). Scheduling policies for CIOQ switches. 1 indexed citations
13.
Gál, Anna & Adi Rosén. (2003). Lower bounds on the amount of randomness in private computation. 659–666. 4 indexed citations
14.
Aiello, William, Eyal Kushilevitz, Rafail Ostrovsky, & Adi Rosén. (2000). Adaptive Packet Routing for Bursty Adversarial Traffic. Journal of Computer and System Sciences. 60(3). 482–509. 18 indexed citations
15.
Canetti, Ran, Eyal Kushilevitz, Rafail Ostrovsky, & Adi Rosén. (2000). Randomness versus Fault-Tolerance. Journal of Cryptology. 13(1). 107–142. 10 indexed citations
16.
Kushilevitz, Eyal, Rafail Ostrovsky, & Adi Rosén. (1999). Characterizing Linear Size Circuits in Terms of Privacy. Journal of Computer and System Sciences. 58(1). 129–136. 14 indexed citations
17.
Adler, Micah, Sanjeev Khanna, Rajmohan Rajaraman, & Adi Rosén. (1999). Time-constrained scheduling of weighted packets on trees and meshes. 1–12. 8 indexed citations
18.
Leonardi, Stefano, et al.. (1998). On-line randomized call control revisited. Symposium on Discrete Algorithms. 323–332. 16 indexed citations
19.
Berman, Piotr, Avrim Blum, Amos Fiat, et al.. (1996). Randomized robot navigation algorithms. Symposium on Discrete Algorithms. 75–84. 27 indexed citations
20.
Awerbuch, Baruch, Yair Bartal, Amos Fiat, & Adi Rosén. (1994). Competitive non-preemptive call control. Symposium on Discrete Algorithms. 312–320. 88 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

Rankless by CCL
2026