Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAri Freund 0001
Person information
- affiliation: Google Israel, Haifa, Israel
- affiliation (former): IBM Haifa Research Lab, Israel
- affiliation (PhD 2003): Technion, Haifa, Israel
Other persons with the same name
- Ari Freund 0002 — Mackenzie Presbyterian University, São Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j10]Ari Freund:
Improved Subquadratic 3SUM. Algorithmica 77(2): 440-458 (2017)- 2015
- [c15]Merav Aharoni, Odellia Boni, Ari Freund, Lidor Goren, Wesam Ibraheem, Tamir Segev:
Rectangle Placement for VLSI Testing. CPAIOR 2015: 18-30 - 2014
- [j9]Amir Nahir, Ariel Orda, Ari Freund:
Topology Design of Communication Networks: A Game-Theoretic Perspective. IEEE/ACM Trans. Netw. 22(2): 405-414 (2014) - 2010
- [c14]Mircea Namolaru, Albert Cohen, Grigori Fursin, Ayal Zaks, Ari Freund:
Practical aggregation of semantical program properties for machine learning based optimization. CASES 2010: 197-206
2000 – 2009
- 2009
- [c13]Bella Dubrov, Haggai Eran
, Ari Freund, Edward F. Mark, Shyam Ramji, Timothy A. Schell:
Pin Assignment Using Stochastic Local Search Constraint Programming. CP 2009: 35-49 - [c12]Amir Nahir, Ariel Orda, Ari Freund:
Topology Design and Control: A Game-Theoretic Perspective. INFOCOM 2009: 1620-1628 - 2008
- [c11]Ari Freund, Dan Pelleg, Yossi Richter:
Clustering from Constraint Graphs. SDM 2008: 301-312 - 2007
- [j8]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3(1): 10:1-10:19 (2007) - 2006
- [j7]Shai Fine, Ari Freund, Itai Jaeger, Yishay Mansour, Yehuda Naveh, Avi Ziv:
Harnessing Machine Learning to Improve the Success Rate of Stimuli Generation. IEEE Trans. Computers 55(11): 1344-1355 (2006) - [c10]Yossi Richter, Ari Freund, Yehuda Naveh:
Generalizing AllDifferent: The SomeDifferent Constraint. CP 2006: 468-483 - 2005
- [c9]Shai Fine, Ari Freund, Itai Jaeger, Yehuda Naveh, Avi Ziv, Yishay Mansour:
Harnessing machine learning to improve the success rate of stimuli generation. HLDVT 2005: 112-118 - 2004
- [j6]Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz:
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004. ACM Comput. Surv. 36(4): 422-463 (2004) - [j5]Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. J. Sched. 7(5): 365-374 (2004) - 2003
- [j4]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive On-Line Switching Policies. Algorithmica 36(3): 225-247 (2003) - [c8]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic Aspects of Bandwidth Trading. ICALP 2003: 751-766 - [c7]Adnan Agbaria, Ari Freund, Roy Friedman:
Evaluating Distributed Checkpointing Protocol. ICDCS 2003: 266-273 - [c6]Ari Freund, Dror Rawitz:
Combinatorial Interpretations of Dual Fitting and Primal Fitting. WAOA 2003: 137-150 - 2002
- [b1]Ari Freund:
On-line and off-line approximation algorithms for various resource allocation and scheduling problems and for the multiway cut problem. Technion - Israel Institute of Technology, Israel, 2002 - [c5]Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. IPCO 2002: 415-424 - [c4]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive on-line switching policies. SODA 2002: 525-534 - 2001
- [j3]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. J. ACM 48(5): 1069-1090 (2001) - [j2]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Balancing in a Hierarchical Server Topology. SIAM J. Comput. 31(2): 527-549 (2001) - 2000
- [j1]Ari Freund, Howard J. Karloff:
A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. Inf. Process. Lett. 75(1-2): 43-50 (2000) - [c3]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744
1990 – 1999
- 1999
- [c2]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Banancing in a Hierarchical Server Topology. ESA 1999: 77-88 - 1995
- [c1]David Bernstein, Doron Cohen, Ari Freund:
Compiler techniques for data prefetching on the PowerPC. PACT 1995: 19-26
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
