Ari Freund
Impact in
-
- Optimization and Search Problems
- Distributed and Parallel Computing Systems
-
- Scheduling and Optimization Algorithms
- Optimization and Packing Problems
Papers in
-
- Optimization and Search Problems 10
- Distributed and Parallel Computing Systems 2
-
- Complexity and Algorithms in Graphs 5
- Advanced Graph Theory Research 3
- Co-authors
- Joseph Naor (7 shared papers)Amotz Bar-Noy (5 shared papers)Reuven Bar-Yehuda (4 shared papers)Baruch Schieber (2 shared papers)Dror Rawitz (2 shared papers)David Bernstein (1 shared paper)Doron Cohen (1 shared paper)Ariel Orda (2 shared papers)
- Journals
- Journal of Scheduling (2 papers)ACM Transactions on Algorithms (1 paper)SIAM Journal on Computing (1 paper)Journal of the ACM (1 paper)Proceedings of the American Mathematical Society (1 paper)
- Partner nations
- IsraelUnited StatesGermany
In The Last Decade
Ari Freund
23 papers receiving 559 citations
Peers
Comparison fields: 5 of 53
- Computer Networks and Communications 417
- Industrial and Manufacturing Engineering 170
- Hardware and Architecture 97
- Computational Theory and Mathematics 150
- Computer Graphics and Computer-Aided Design 25
Countries citing papers authored by Ari Freund
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
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-authors
The 25 scholars most cited alongside Ari Freund, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 23 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 229 | |
| 2 | 2001 | 65 | |
| 3 | 2004 | 58 | |
| 4 | 1995 | 41 | |
| 5 | 2000 | 32 | |
| 6 | 2010 | 24 | |
| 7 | 2004 | 21 | |
| 8 | 2009 | 17 | |
| 9 | 2007 | 14 | |
| 10 | 2004 | 12 | |
| 11 | 2006 | 12 | |
| 12 | 2000 | 11 | |
| 13 | 2013 | 11 | |
| 14 | 2000 | 10 | |
| 15 | 2002 | 7 | |
| 16 | 2015 | 7 | |
| 17 | 2006 | 6 | |
| 18 | 2005 | 4 | |
| 19 | 2008 | 3 | |
| 20 | Automatic Feature Generation for Setting Compilers Heuristics | 2008 | 3 |
About Ari Freund
Ari Freund is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Hardware and Architecture, Industrial and Manufacturing Engineering and Artificial Intelligence, having authored 23 papers that have together received 592 indexed citations. Recurring topics across this work include Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (5 papers), Scheduling and Optimization Algorithms (4 papers), Advanced Graph Theory Research (3 papers), Distributed and Parallel Computing Systems (2 papers), Software Reliability and Analysis Research (2 papers), Parallel Computing and Optimization Techniques (2 papers) and Game Theory and Applications (2 papers). The work is most often cited by research in Computer Networks and Communications (417 citations), Industrial and Manufacturing Engineering (170 citations), Hardware and Architecture (97 citations), Computational Theory and Mathematics (150 citations) and Computer Graphics and Computer-Aided Design (25 citations). Ari Freund has collaborated with scholars based in Israel, United States and Germany. Frequent co-authors include Joseph Naor, Amotz Bar-Noy, Reuven Bar-Yehuda, Baruch Schieber, Dror Rawitz, David Bernstein, Doron Cohen, Ariel Orda, Amir Nahir and Mircea Namolaru. Their work appears in journals such as Journal of Scheduling, ACM Transactions on Algorithms, SIAM Journal on Computing, Journal of the ACM and Proceedings of the American Mathematical Society.
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.