Strong Stability Preserving Properties of Runge-Kutta Time Discretization Methods for Linear Constant Coefficient Operators. - Sigal Gottlieb; Lee-Ad Gottlieb (J. Sci. Comput., 2003)

Dictionary matching and indexing with errors and don't cares. - Richard Cole 001; Lee-Ad Gottlieb; Moshe Lewenstein (STOC, 2004)

Efficient Data Storage in Large Nanoarrays. - Lee-Ad Gottlieb; John E. Savage; Arkady Yerukhimovich (Theory Comput. Syst., 2005)

Searching dynamic point sets in spaces with bounded doubling dimension. - Richard Cole 001; Lee-Ad Gottlieb (STOC, 2006)

An Optimal Dynamic Spanner for Doubling Metric Spaces. - Lee-Ad Gottlieb; Liam Roditty (ESA, 2008)

Improved algorithms for fully dynamic geometric spanners and geometric routing. - Lee-Ad Gottlieb; Liam Roditty (SODA, 2008)

Proximity problems for point sets residing in spaces with low doubling dimension. - Lee-Ad Gottlieb (2009)

Fast, precise and dynamic distance queries. - Yair Bartal; Lee-Ad Gottlieb; Tsvi Kopelowitz; Moshe Lewenstein; Liam Roditty (SODA, 2011)

VC bounds on the cardinality of nearly orthogonal function classes. - Lee-Ad Gottlieb; Aryeh Kontorovich; Elchanan Mossel (Discret. Math., 2012)

A Linear Time Approximation Scheme for Euclidean TSP. - Yair Bartal; Lee-Ad Gottlieb (FOCS, 2013)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (CoRR, 2013)

Proximity Algorithms for Nearly Doubling Spaces. - Lee-Ad Gottlieb; Robert Krauthgamer (SIAM J. Discret. Math., 2013)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SoCG, 2014)

Light spanners for Snowflake Metrics. - Lee-Ad Gottlieb; Shay Solomon (SoCG, 2014)

Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications. - Yair Bartal; Lee-Ad Gottlieb (CoRR, 2014)

Optimizing Budget Allocation in Graphs. - Boaz Ben-Moshe; Michael Elkin; Lee-Ad Gottlieb; Eran Omri (CoRR, 2014)

Near-optimal sample compression for nearest neighbors. - Lee-Ad Gottlieb; Aryeh Kontorovich (CoRR, 2014)

Efficient Classification for Metric Data. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (IEEE Trans. Inf. Theory, 2014)

A Light Metric Spanner. - Lee-Ad Gottlieb (FOCS, 2015)

Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings. - Yair Bartal; Lee-Ad Gottlieb (CoRR, 2015)

Nearly optimal classification for semimetrics. - Lee-Ad Gottlieb; Aryeh Kontorovich (CoRR, 2015)

A Nonlinear Approach to Dimension Reduction. - Lee-Ad Gottlieb; Robert Krauthgamer (Discret. Comput. Geom., 2015)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SIAM J. Discret. Math., 2015)

Dimension Reduction Techniques for ℓp (1<p<2), with Applications. - Yair Bartal; Lee-Ad Gottlieb (SoCG, 2016)

Matrix Sparsification and the Sparse Null Space Problem. - Lee-Ad Gottlieb; Tyler Neylon (Algorithmica, 2016)

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. - Yair Bartal; Lee-Ad Gottlieb; Robert Krauthgamer (SIAM J. Comput., 2016)

Optimizing budget allocation for center and median points. - Boaz Ben-Moshe; Michael Elkin; Lee-Ad Gottlieb; Eran Omri (Theor. Comput. Sci., 2016)

Adaptive metric dimensionality reduction. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (Theor. Comput. Sci., 2016)

Nearly optimal classification for semimetrics. - Lee-Ad Gottlieb; Aryeh Kontorovich; Pinhas Nisnevitch (J. Mach. Learn. Res., 2017)

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (IEEE Trans. Inf. Theory, 2017)

Approximate Nearest Neighbor Search for ell _p -Spaces (2 via Embeddings. - Yair Bartal; Lee-Ad Gottlieb (LATIN, 2018)

Learning convex polytopes with margin. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch (NeurIPS, 2018)

Near-Optimal Sample Compression for Nearest Neighbors. - Lee-Ad Gottlieb; Aryeh Kontorovich; Pinhas Nisnevitch (IEEE Trans. Inf. Theory, 2018)

Classification in asymmetric spaces via sample compression. - Lee-Ad Gottlieb; Shira Ozeri (CoRR, 2019)

Approximate nearest neighbor search for ℓp-spaces (2<p<∞). - Yair Bartal; Lee-Ad Gottlieb (Theor. Comput. Sci., 2019)

Labelings vs. Embeddings: On Distributed Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (SODA, 2020)

Faster Algorithms for Orienteering and k-TSP. - Lee-Ad Gottlieb; Robert Krauthgamer; Havana Rika (CoRR, 2020)

Nested Barycentric Coordinate System as an Explicit Feature Map. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch; Ofir Pele (AISTATS, 2021)

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. - Yair Bartal; Lee-Ad Gottlieb (STOC, 2021)

Apportioned margin approach for cost sensitive large margin classifiers. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich (Ann. Math. Artif. Intell., 2021)

Using Support Vector Machine (SVM) and Ionospheric Total Electron Content (TEC) Data for Solar Flare Predictions. - Saed Asaly; Lee-Ad Gottlieb; Yuval Reuveni (IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2021)

Predicting Subscriber Usage: Analyzing Multidimensional Time-Series Using Convolutional Neural Networks. - Benjamin Azaria; Lee-Ad Gottlieb (CSCML, 2022)

Non-uniform packings. - Lee-Ad Gottlieb; Aryeh Kontorovich (Inf. Process. Lett., 2022)

Using Support Vector Machine (SVM) with GPS Ionospheric TEC Estimations to Potentially Predict Earthquake Events. - Saed Asaly; Lee-Ad Gottlieb; Nimrod Inbar; Yuval Reuveni (Remote. Sens., 2022)

Faster algorithms for orienteering and k-TSP. - Lee-Ad Gottlieb; Robert Krauthgamer; Havana Rika (Theor. Comput. Sci., 2022)

Learning Convex Polyhedra With Margin. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch (IEEE Trans. Inf. Theory, 2022)

Using Deepfake Technologies for Word Emphasis Detection. - Eran Kaufman; Lee-Ad Gottlieb; Dina Mayzlish; Or Tiram; Hila Wiesel; Nofar Yosef (PACLIC, 2023)

Using Deepfake Technologies for Word Emphasis Detection. - Eran Kaufman; Lee-Ad Gottlieb (CoRR, 2023)

Predicting Eastern Mediterranean Flash Floods Using Support Vector Machines with Precipitable Water Vapor, Pressure, and Lightning Data. - Saed Asaly; Lee-Ad Gottlieb; Yoav Yair; Colin Price; Yuval Reuveni (Remote. Sens., 2023)

KNN+X. - Daniel Gilkarov; Lee-Ad Gottlieb; Hillel Ohayon (CSCML, 2024)

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (FOCS, 2024)

Weighted distance nearest neighbor condensing. - Lee-Ad Gottlieb; Timor Sharabi; Roi Weiss (ICML, 2024)

Functions with average smoothness: structure, algorithms, and learning. - Yair Ashlagi; Lee-Ad Gottlieb; Aryeh Kontorovich (J. Mach. Learn. Res., 2024)

Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (Discret. Comput. Geom., 2024)

Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch; Ofir Pele (Mach. Learn., 2024)

Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (AAAI, 2025)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters k-clustering and their fair variants. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (CoRR, 2025)