Home Page of  Anna Moss (Formerly Rudshtein)


  • Teaching
  • Theses
  • Publications 
  • Research Interests
  • Personal Information
  • Contact Me

    • Teaching

    In the 2001/2002 winter term I teach the courses Introduction to Computer Science and Graph Algorithms.


    Theses

  • A. Rudshtein, Quantifying the reliability of feature-based object recognition, Master Thesis, Technion, 1996.

  • A. Moss, High Profit for Low Cost: Approximation Algorithms in Node-Weighted Graphs, Ph.D Thesis, Technion, 2001.


    Publications

  • A. Rudshtein and M. Lindenbaum, Quantifying the performance of feature-based recognition. Proceedings of the 12th International Conference on Pattern Recognition, Vol. I, pp. 35-39, 1996.

  • S. Khuller, A. Moss, and S. Naor, The Budgeted Maximum Coverage Problem. Information Processing Letters, Vol. 70/1, pp. 39-45.    

  • S. Guha, A. Moss, J. Naor, and B. Schieber, Efficient Recovery from Power Outage. Proceedings of the 31-th ACM Symposium on Theory of Computing, 1999.

  • A. Moss and Y. Rabani, Approximation Algorithms for Constrained Node-Weighted Steiner Tree Problems. Proceedings of the 33-th ACM Symposium on Theory of Computing, 2001.

    The postscript versions of the papers are available upon request.


    Research Interests

  • Combinatorial Optimization
  • Approximation Algorithms
  • Computational Complexity
  • Network Design


    Personal Information

    I was born in St. Petersburg, Russia, where I graduated from the 239 school. You can see the school graduates list .

    Since 1990 I am living in Israel.

    I have recently got the Ph.D. degree at the Computer Science Department, Technion.
    My advisors were Yuval Rabani and Seffi Naor.

    Contact Me:

    Taub bldg., Room 713
    Computer Science Dept.
    Technion City
    Haifa
    Israel  32000

    EMail:  annaru@cs.technion.ac.il
    Office Phone: +972-4-8294956


     
      This page is currently under construction