Lee-Ad Gottlieb

In January 2009, I was awarded a Ph.D. in Computer Science from the Courant Institute, where I was fortunate to have Richard Cole as my advisor.

From October 2008 to October 2010, I was a postdoctoral fellow at the Weizmann Institute of Science, hosted by Robi Krauthgamer. As of October 2010, I am a postdoctoral fellow at Hebrew University, hosted by Yair Bartal and Yuval Rabani.

My current research focuses primarily on proximity problems in metric space, with emphasis on problems in machine learning, computational geometry and metric embeddings. Here's my CV and research statement.

Publications.

• The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme.
  Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer.
  STOC 2012 (to appear). arXiv.

• Efficient regression in metric space via approximate Lipschitz extension.
  Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthgamer.
  Submitted to COLT 2012 and SIAM Journal on Computing (SICOMP). arXiv.

• Dimension reduction techniques for l_p, 1 < p < ∞.
  Yair Bartal, Lee-Ad Gottlieb.
  Manuscript.

• VC bounds on the cardinality of nearly orthogonal function classes.
  Lee-Ad Gottlieb, Aryeh Kontorovich, Elchanan Mossel.
  Discrete Mathematics, to appear. arXiv.

• Fast, precise and dynamic distance queries.
  Yair Bartal, Lee-Ad Gottlieb, Liam Roditty, Tsvi Kopelowitz, Moshe Lewenstein.
  SODA 2011: 840-853. arXiv. ppt.

• A nonlinear approach to dimension reduction.
  Lee-Ad Gottlieb, Robert Krauthgamer.
  SODA 2011: 888-899. arXiv. ppt.

• Proximity algorithms for nearly-doubling spaces.
  Lee-Ad Gottlieb, Robert Krauthgamer.
  APPROX 2010: 192-204. pdf. ppt.

• Matrix sparsification and the sparse null space problem.
  Lee-Ad Gottlieb, Tyler Neylon.
  APPROX 2010: 205-218. arXiv. ppt.

• Efficient classification for metric data.
  Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthgamer.
  COLT 2010: 433-440. pdf. ppt.

• Proximity problems for point sets with low doubling dimension.
  Lee-Ad Gottlieb.
  Ph.D. Thesis, New York University, 2009. pdf.

• An optimal dynamic spanner for doubling metric spaces.
  Lee-Ad Gottlieb, Liam Roditty.
  ESA 2008: 468-489. pdf. ppt.

• Improved algorithms for fully dynamic geometric spanners and geometric routing.
  Lee-Ad Gottlieb, Liam Roditty.
  SODA 2008: 591-600. pdf.

• Searching dynamic point sets in spaces with bounded doubling dimension.
  Richard Cole, Lee-Ad Gottlieb.
  STOC 2006: 574-583. pdf. ppt.

• Efficient data storage in large nanoarrays.
  Lee-Ad Gottlieb, John E. Savage, Arkady Yerukhimovich.
  Theory Comput. Syst. 38(4): 503-536 (2005). pdf.

• Dictionary matching and indexing with errors and don't cares.
  Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein.
  STOC 2004: 91-100. pdf. ppt.

• Strong stability preserving properties of Runge-Kutta time discretization methods for linear constant coefficient operators.
  Sigal Gottlieb, Lee-Ad Gottlieb.
  J. Sci. Comput. 18(1): 83-109 (2003).