| Dictionary matching and indexing with errors and don't cares R Cole, LA Gottlieb, M Lewenstein Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 312 | 2004 |
| Searching dynamic point sets in spaces with bounded doubling dimension R Cole, LA Gottlieb Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 105 | 2006 |
| The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme Y Bartal, LA Gottlieb, R Krauthgamer SIAM Journal on Computing 45 (4), 1563-1581, 2016 | 86 | 2016 |
| Efficient classification for metric data LA Gottlieb, A Kontorovich, R Krauthgamer IEEE Transactions on Information Theory 60 (9), 5750-5759, 2014 | 80 | 2014 |
| An optimal dynamic spanner for doubling metric spaces LA Gottlieb, L Roditty European Symposium on Algorithms, 478-489, 2008 | 64 | 2008 |
| Strong stability preserving properties of Runge–Kutta time discretization methods for linear constant coefficient operators S Gottlieb, LAJ Gottlieb Journal of Scientific Computing 18 (1), 83-109, 2003 | 59 | 2003 |
| Near-optimal sample compression for nearest neighbors LA Gottlieb, A Kontorovich, P Nisnevitch Advances in Neural Information Processing Systems 27, 2014 | 53 | 2014 |
| Improved algorithms for fully dynamic geometric spanners and geometric routing. LA Gottlieb, L Roditty SODA 8, 591-600, 2008 | 49 | 2008 |
| Efficient regression in metric spaces via approximate lipschitz extension LA Gottlieb, A Kontorovich, R Krauthgamer IEEE Transactions on Information Theory 63 (8), 4838-4849, 2017 | 48* | 2017 |
| A light metric spanner LA Gottlieb 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 759-772, 2015 | 44 | 2015 |
| A nonlinear approach to dimension reduction LA Gottlieb, R Krauthgamer Discrete & Computational Geometry 54 (2), 291-315, 2015 | 43 | 2015 |
| Matrix sparsification and the sparse null space problem LA Gottlieb, T Neylon Algorithmica 76 (2), 426-444, 2016 | 37* | 2016 |
| Adaptive metric dimensionality reduction LA Gottlieb, A Kontorovich, R Krauthgamer Theoretical Computer Science 620, 105-118, 2016 | 29 | 2016 |
| A linear time approximation scheme for euclidean TSP Y Bartal, LA Gottlieb 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 698-706, 2013 | 29 | 2013 |
| Proximity algorithms for nearly doubling spaces LA Gottlieb, R Krauthgamer SIAM Journal on Discrete Mathematics 27 (4), 1759-1769, 2013 | 25 | 2013 |
| Nearly optimal classification for semimetrics LA Gottlieb, A Kontorovich, P Nisnevitch Artificial Intelligence and Statistics, 379-388, 2016 | 23 | 2016 |
| Approximate nearest neighbor search for ℓp-spaces (2< p<∞) via embeddings Y Bartal, LA Gottlieb Theoretical Computer Science 757, 27-35, 2019 | 20* | 2019 |
| Fast, precise and dynamic distance queries Y Bartal, LA Gottlieb, T Kopelowitz, M Lewenstein, L Roditty Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 19 | 2011 |
| On the Impossibility of Dimension Reduction for Doubling Subsets of Y Bartal, LA Gottlieb, O Neiman SIAM Journal on Discrete Mathematics 29 (3), 1207-1222, 2015 | 13* | 2015 |
| Learning convex polytopes with margin LA Gottlieb, E Kaufman, A Kontorovich, G Nivasch Advances in Neural Information Processing Systems 31, 2018 | 11 | 2018 |
Aryeh KontorovichProfessor of Computer Science at Ben-Gurion UniversityVerified email at cs.bgu.ac.il
