Assoc. Prof. Yuval Rabani

Assoc. Prof. Yuval Rabani

Contact information
Homepage:
http://www.cs.technion.ac.il/~rabani/
Email:
rabani[at]cs.technion.ac.il
Office:
224
Phone:
5617
Research interests
Theory of computation, theory of algorithms, computational complexity, combinatorial optimization, computational metric geometry.
Selected publications
  • R. Ostrovsky and Y. Rabani.
    Low distortion embeddings for edit distance.
    In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 218--224, 2005 [bibtex] [pdf]
  • R. Ostrovsky and Y. Rabani.
    Polynomial time approximation schemes for geometric k-clustering.
    Journal of the Association for Computing Machinery, 49(2):139--156, 2002 [bibtex] [ps.gz]
  • G. Calinescu, H. J. Karloff and Y. Rabani.
    An improved approximation algorithm for MULTIWAY CUT.
    Journal of Computer and Systems Sciences, 60(3):564--574, 2000 [bibtex] [ps.gz]
  • E. Kushilevitz, R. Ostrovsky and Y. Rabani.
    Efficient search for approximate nearest neighbor in high dimensional spaces.
    SIAM Journal on Computing, 30(2):457--474, 2000 [bibtex] [ps.gz]
  • Y. Aumann and Y. Rabani.
    An O(log k) approximate min-cut max-flow theorem and approximation algorithm.
    SIAM Journal on Computing, 27(1):291--301, 1998 [bibtex] [ps.gz]
  • Y. Rabani and \'E. Tardos.
    Distributed packet switching in arbitrary networks.
    In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 366--375, 1996 [bibtex] [ps.gz]
  • Y. Bartal, A. Fiat and Y.~Rabani.
    Competitive algorithms for distributed data management.
    Journal of Computer and Systems Sciences, 51(3):341--358, 1995 [bibtex] [ps.gz]
  • A. Fiat, Y.~Rabani and Y. Ravid.
    Competitive k-server algorithms.
    Journal of Computer and Systems Sciences, 48(3):410--428, 1994 [bibtex] [ps.gz]