L
Lee-Ad Gottlieb
Researcher at Ariel University
Publications - 75
Citations - 1410
Lee-Ad Gottlieb is an academic researcher from Ariel University. The author has contributed to research in topics: Metric space & Metric (mathematics). The author has an hindex of 20, co-authored 71 publications receiving 1274 citations. Previous affiliations of Lee-Ad Gottlieb include Hebrew University of Jerusalem & New York University.
Papers
More filters
Proceedings ArticleDOI
Dictionary matching and indexing with errors and don't cares
TL;DR: This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a query string p, all matches of p with the text can be reported quickly.
Proceedings ArticleDOI
Searching dynamic point sets in spaces with bounded doubling dimension
Richard Cole,Lee-Ad Gottlieb +1 more
TL;DR: A new data structure is presented that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension and finds a (1+ε)-approximate nearest neighbor in time O(log n) + (1/ε)O(1).
Book ChapterDOI
An Optimal Dynamic Spanner for Doubling Metric Spaces
Lee-Ad Gottlieb,Liam Roditty +1 more
TL;DR: This paper considers points residing in a metric space equipped with doubling dimension i¾?, and shows how to construct a dynamic (1 + i¼?)-spanner with degree i½ and O(i¾?) in $O(\frac{\log n}{\varepsilon^{O(\lambda)}})$ update time.
Proceedings ArticleDOI
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
TL;DR: The algorithm designs a randomized polynomial-time algorithm that computes a (1+µ)-approximation to the optimal tour, for any fixed µ>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension.
Journal ArticleDOI
Strong Stability Preserving Properties of Runge–Kutta Time Discretization Methods for Linear Constant Coefficient Operators
Sigal Gottlieb,Lee-Ad Gottlieb +1 more
TL;DR: This paper analyzes the SSP properties of Runge Kutta methods for the ordinary differential equation ut=Lu where L is a linear operator and presents optimal SSP Runge–Kutta methods as well as a bound on the optimal timestep restriction.