Ari Freund

1.1k total citations
23 papers, 592 citations indexed

About

Ari Freund is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Ari Freund has authored 23 papers receiving a total of 592 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Networks and Communications, 8 papers in Computational Theory and Mathematics and 5 papers in Hardware and Architecture. Recurrent topics in Ari Freund's work include Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (5 papers) and Scheduling and Optimization Algorithms (4 papers). Ari Freund is often cited by papers focused on Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (5 papers) and Scheduling and Optimization Algorithms (4 papers). Ari Freund collaborates with scholars based in Israel, United States and Germany. Ari Freund's co-authors include Joseph Naor, Amotz Bar-Noy, Reuven Bar-Yehuda, Baruch Schieber, Dror Rawitz, David Bernstein, Doron Cohen, Ariel Orda, Amir Nahir and Howard Karloff and has published in prestigious journals such as ACM Computing Surveys, Journal of the ACM and IEEE Transactions on Computers.

In The Last Decade

Ari Freund

23 papers receiving 559 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ari Freund Israel	12	417	170	150	97	76	23	592
Ricardo C. Corrêa Brazil	9	224 0.5×	125 0.7×	94 0.6×	99 1.0×	76 1.0×	38	391
Evripidis Bampis France	12	381 0.9×	355 2.1×	96 0.6×	71 0.7×	49 0.6×	74	620
Ephraim Korach Israel	14	507 1.2×	34 0.2×	259 1.7×	133 1.4×	29 0.4×	54	703
Rumen Andonov France	12	225 0.5×	131 0.8×	57 0.4×	118 1.2×	35 0.5×	43	482
Kimbal George Marriott Australia	3	202 0.5×	72 0.4×	101 0.7×	44 0.5×	48 0.6×	7	433
Helmut Simonis Ireland	11	471 1.1×	189 1.1×	193 1.3×	36 0.4×	31 0.4×	40	816
Stavros G. Kolliopoulos Canada	13	370 0.9×	220 1.3×	156 1.0×	26 0.3×	37 0.5×	26	636
Sungjin Im United States	12	350 0.8×	133 0.8×	88 0.6×	48 0.5×	122 1.6×	67	507
Y. Edmund Lien United States	10	345 0.8×	50 0.3×	242 1.6×	90 0.9×	52 0.7×	22	622
Steven C. Bruell United States	12	271 0.6×	55 0.3×	220 1.5×	67 0.7×	40 0.5×	35	534

Countries citing papers authored by Ari Freund

Since Specialization

Citations

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

Fields of papers citing papers by Ari Freund

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ari Freund

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

Freund, Ari, et al.. (2022). Boundedness theorems for flowers and sharps. Proceedings of the American Mathematical Society. 150(9). 3973–3988. 1 indexed citations

Nahir, Amir, Ariel Orda, & Ari Freund. (2013). Topology Design of Communication Networks: A Game-Theoretic Perspective. IEEE/ACM Transactions on Networking. 22(2). 405–414. 11 indexed citations

Namolaru, Mircea, Albert Cohen, Grigori Fursin, Ayal Zaks, & Ari Freund. (2010). Practical aggregation of semantical program properties for machine learning based optimization. 197–206. 24 indexed citations

Nahir, Amir, Ariel Orda, & Ari Freund. (2009). Topology Design and Control: A Game-Theoretic Perspective. 1620–1628. 17 indexed citations

Freund, Ari, Dan Pelleg, & Yossi Richter. (2008). Clustering from Constraint Graphs. 301–312. 3 indexed citations

Leather, Hugh, Elad Yom‐Tov, Mircea Namolaru, & Ari Freund. (2008). Automatic Feature Generation for Setting Compilers Heuristics. 3 indexed citations

Leather, Hugh, Elad Yom‐Tov, Mircea Namolaru, & Ari Freund. (2008). 2nd Workshop on statistical and machine learning approaches to Architectures and compilation (SMART 2008). 2 indexed citations

Bhatia, Randeep, Julia Chuzhoy, Ari Freund, & Joseph Naor. (2007). Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms. 3(1). 1–19. 14 indexed citations

Fine, Shai, et al.. (2006). Harnessing Machine Learning to Improve the Success Rate of Stimuli Generation. IEEE Transactions on Computers. 55(11). 1344–1355. 12 indexed citations

10.

Fine, Shai, et al.. (2006). Harnessing machine learning to improve the success rate of stimuli generation. 112–118. 6 indexed citations

11.

Bar-Yehuda, Reuven, et al.. (2004). Local Ratio: A Unified Framework for Approximation Algorithms. 2 indexed citations

12.

Agbaria, Adnan, Ari Freund, & Roy Friedman. (2004). Evaluating distributed checkpointing protocols. 266–273. 12 indexed citations

13.

Freund, Ari & Joseph Naor. (2004). Approximating the Advertisement Placement Problem. Journal of Scheduling. 7(5). 365–374. 21 indexed citations

14.

Bar-Yehuda, Reuven, et al.. (2004). Local ratio. ACM Computing Surveys. 36(4). 422–463. 58 indexed citations

15.

Bar-Noy, Amotz, et al.. (2002). Competitive on-line switching policies. Symposium on Discrete Algorithms. 525–534. 7 indexed citations

16.

Bar-Noy, Amotz, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, & Baruch Schieber. (2001). A unified approach to approximating resource allocation and scheduling. Journal of the ACM. 48(5). 1069–1090. 229 indexed citations

17.

Bar-Noy, Amotz, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, & Baruch Schieber. (2000). A unified approach to approximating resource allocation and scheduling. 735–744. 32 indexed citations

18.

Freund, Ari & Howard Karloff. (2000). A lower bound of on the integrality ratio of the Călinescu–Karloff–Rabani relaxation for multiway cut. Information Processing Letters. 75(1-2). 43–50. 11 indexed citations

19.

Bar-Noy, Amotz, Ari Freund, & Joseph Naor. (2000). New algorithms for related machines with temporary jobs. Journal of Scheduling. 3(5). 259–272. 10 indexed citations

20.

Bernstein, David, Doron Cohen, & Ari Freund. (1995). Compiler techniques for data prefetching on the PowerPC. International Conference on Parallel Architectures and Compilation Techniques. 19–26. 41 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