Ari Freund

This is an outdated photo. I am now thinner in the hairline and chubbier everywhere else.


People often have trouble pronouncing my name. My first name is pronounced are-ee (in Hebrew are-yeah) and my last name is pronounced froynd.

I am now at IBM Haifa Reasearch Lab (HRL) after completing a year as a postdoc at the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. I graduated 2002 from the Department of Computer Science, Technion; my advisor was Seffi Naor.


You can email me at arief@il.ibm.com.


Research Interests

I am interested mainly in theoretical stuff, but don't shy away from the applied. In the distant past I did compiler back-end optimizations, and more recently I was involved in competitive analysis of on-line algorithms as well as (off-line) approximation algorithms, focusing on scheduling and resource allocation problems. Following a stint in the Machine Learning group, I am now a member of the Constraint Satisfaction Group. I am also fascinated by data structures, although I haven't had a chance to do any research in this area.


Publications

(Copyrights held by the respective publishers.)
  1. D. Bernstein, D. Cohen, A. Freund, and D. Maydan.
    Compiler techniques for data prefetching on the PowerPC.
    Proc. 3rd Conference on Parallel Architectures and Compilation Techniques (PACT95), pp. 19-26, 1995.

  2. A. Bar-Noy, A. Freund, and J. (S.) Naor.
    On-line load balancing in a hierarchical server topology.
    Extended abstract: Proc. 7th European Symposium on Algorithms (ESA99), LNCS 1643:77-88, © Springer-Verlag, 1999. PostScript.
    Journal version: SIAM Journal on Computing 31(2):527-549, 2001. PostScript.

  3. A. Freund and H. Karloff.
    A lower bound of 8/(7+1/(k-1)) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut.
    Information Processing Letters 75(1-2):43-50, 2000. PDF.

    Reprinted from Information Processing Letters, Vol 75, Ari Freund and Howard Karloff, A lower bound of 8/(7+1/(k-1)) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut, Pages 43-50, Copyright (2000), with permission from Elsevier Science.
    Single copies of the article can be downloaded and printed for your personal research and study.

    Here is an appendix omitted from the paper for lack of space. PostScript.

  4. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. (S.) Naor, and B. Schieber.
    A unified approach to approximating resource allocation and scheduling.
    Extended abstract: Proc. 32nd Symposium on Theory of Computing (STOC00), pp. 735-744, 2000. PostScript.
    Journal version: Journal of the ACM 48(5):1069-1090, 2001. PostScript.

  5. A. Bar-Noy, A. Freund, and J. (S.) Naor.
    New algorithms for related machines with temporary jobs.
    Journal of Scheduling (special issue) 3(5):259-272, 2000. PostScript.

  6. A. Bar-Noy, A. Freund, S. Landa, and J. (S.) Naor.
    Competitive on-line switching policies.
    Extended Abstract: Proc. 13th Symposium on Discrete Algorithms (SODA02), pp. 525-534, 2002. PostScript.
    Journal Version: Algorithmica (special issue) 36(3):225--247, 2003. PostScript.

  7. A. Freund, and J. (S.) Naor.
    Approximating the advertisement placement problem.
    Extended Abstract: Proc. 9th Conference on Integer Programming and Combinatorial Optimization (IPCO02), LNCS 2337:415-424, © Springer-Verlag, 2002. PostScript.
    Journal Version: Journal of Scheduling 7(5): 365-374, 2004. PostScript.
    The published version is available (if you have access) through this link to Kluwer's web site.

  8. A. Agbaria, A. Freund, and R. Friedman.
    Evaluating distributed checkpointing protocols.
    Proc. 23rd International Conference on Distributed Computing Systems (ICDCS03), pp. 266-273, 2003. PostScript.

  9. R. Bhatia, J. Chuzhoy, A. Freund, and J. (S.) Naor.
    Algorithmic aspects of bandwidth trading.
    Extended abstract: Proc. 30th International Colloquium on Automata, Languages, and Programming (ICALP03), LNCS 2719:751-766, © Springer-Verlag, 2003. PostScript.
    Journal version: ACM Transactions on Algorithms 3(1): Article 10, 2007. PostScript, PDF.
    © Copyright 200 by ACM, Inc.
    © ACM, 20047 This is the author's version of the work. It is posted herre by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Algorithms, Volume 3, Issue 1 (February 2007), http://doi.acm.org/10.1145/1186810.1186820.

  10. A. Freund and D. Rawitz.
    Combinatorial interpretations of dual fitting and primal fitting.
    Proc. 1st Workshop on on Approximation and Online Algorithms (WAOA03), LNCS 2909:137-150, © Springer-Verlag, 2003. PostScript.

  11. R. Bar-Yehuda, K. Bendel, A. Freund, and D. Rawitz.
    Local Ratio: a unified framework for approximation algorithms.
    ACM Computing Surveys 36(4):422-463, 2004. PostScript, PDF.
    © Copyright 2004 by ACM, Inc.
    © ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Computing Surveys, Volume 36, Issue 4 (December 2004), http://doi.acm.org/10.1145/1041680.1041683.

  12. S. Fine, A. Freund, I. Jaeger, Y. Mansour, Y. Naveh, and A. Ziv.
    Harnessing machine learning to improve the success rate of stimuli generation.
    Extended abstract: Proc. 10th High Level Design Validation and Test Workshop (HLDVT05), pp. 112-118, 2005.
    Journal version: IEEE Transactions on Computers 55(11):1344-1355, 2006.

  13. Y. Richter, A. Freund, and Y. Naveh.
    Generalizing AllDifferent: the SomeDifferent constraint.
    Proc. 12th International Conference on Principles and Practice of Constraint Programming (CP06), LNCS 4204:468-483, © Springer-Verlag Berlin Heidelberg 2006. PostScript, PDF, publisher's electronic copy (may require access rights/payment).

  14. A. Freund, D. Pelleg, and Y. Richter.
    Clustering from constraint graphs.
    Proc. 2008 SIAM Conference on Data Mining (SDM08), pp. 301-312. PDF.

  15. A. Nahir, A. Orda, A. Freund.
    Topology design and control: a game-theoretic terspective.
    Proc. 28th Conference on Computer Communications (INFOCOM09), pp. 1620-1628, 2009.

  16. B. Dubrov, H. Eran, A. Freund, E.F. Mark, S. Ramji, T.A. Schell.
    Pin assignment using stochastic local search constraint programming.
    Proc. 15th International Conference on Principles and Practice of Constraint Programming (CP09), LNCS 5732:35-49, © Springer-Verlag Berlin Heidelberg 2009. PDF, publisher's electronic copy (may require access rights/payment).




This page has been visited times since the last reset.



Last update: November 30, 2009.