Lee-Ad Gottlieb

According to our database1, Lee-Ad Gottlieb authored at least 39 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Faster Algorithms for Orienteering and k-TSP.
CoRR, 2020

Nested Barycentric Coordinate System as an Explicit Feature Map.
CoRR, 2020

Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers.
CoRR, 2020

Labelings vs. Embeddings: On Distributed Representations of Distances.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Approximate nearest neighbor search for p-spaces (2 (DOI)
Theor. Comput. Sci., 2019

Classification in asymmetric spaces via sample compression.
CoRR, 2019

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces.
CoRR, 2019

2018
Near-Optimal Sample Compression for Nearest Neighbors.
IEEE Trans. Inf. Theory, 2018

Learning convex polytopes with margin.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension.
IEEE Trans. Inf. Theory, 2017

Nearly optimal classification for semimetrics.
J. Mach. Learn. Res., 2017

2016
Adaptive metric dimensionality reduction.
Theor. Comput. Sci., 2016

Optimizing budget allocation for center and median points.
Theor. Comput. Sci., 2016

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme.
SIAM J. Comput., 2016

Matrix Sparsification and the Sparse Null Space Problem.
Algorithmica, 2016

Dimension Reduction Techniques for ℓp (1 (DOI)
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp.
SIAM J. Discret. Math., 2015

A Nonlinear Approach to Dimension Reduction.
Discret. Comput. Geom., 2015

Nearly optimal classification for semimetrics.
CoRR, 2015

Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings.
CoRR, 2015

A Light Metric Spanner.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Efficient Classification for Metric Data.
IEEE Trans. Inf. Theory, 2014

Near-optimal sample compression for nearest neighbors.
CoRR, 2014

Optimizing Budget Allocation in Graphs.
CoRR, 2014

Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications.
CoRR, 2014

Light spanners for Snowflake Metrics.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Proximity Algorithms for Nearly Doubling Spaces.
SIAM J. Discret. Math., 2013

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2.
CoRR, 2013

A Linear Time Approximation Scheme for Euclidean TSP.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
VC bounds on the cardinality of nearly orthogonal function classes.
Discret. Math., 2012

2011
Fast, precise and dynamic distance queries.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2008
Improved algorithms for fully dynamic geometric spanners and geometric routing.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An Optimal Dynamic Spanner for Doubling Metric Spaces.
Proceedings of the Algorithms, 2008

2006
Searching dynamic point sets in spaces with bounded doubling dimension.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
Efficient Data Storage in Large Nanoarrays.
Theory Comput. Syst., 2005

2004
Dictionary matching and indexing with errors and don't cares.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
Strong Stability Preserving Properties of Runge-Kutta Time Discretization Methods for Linear Constant Coefficient Operators.
J. Sci. Comput., 2003


  Loading...