| On coresets for k-means and k-median clustering S Har-Peled, S Mazumdar Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 581 | 2004 |
| Approximate clustering via core-sets M Bādoiu, S Har-Peled, P Indyk Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 461 | 2002 |
| Geometric approximation via coresets PK Agarwal, S Har-Peled, KR Varadarajan Combinatorial and computational geometry 52, 1-30, 2005 | 398 | 2005 |
| Constraint classification: A new approach to multi-class classification S Har-Peled, D Roth, Z D. Journal of Machine Learning Research 1, 113-141, 2000 | 390* | 2000 |
| Efficiently approximating the minimum-volume bounding box of a point set in three dimensions G Barequet, S Har-Peled Journal of Algorithms 38 (1), 91-109, 2001 | 363 | 2001 |
| Geometric approximation algorithms S Har-Peled American Mathematical Soc., 2011 | 356 | 2011 |
| Approximating extent measures of points PK Agarwal, S Har-Peled, KR Varadarajan Journal of the ACM (JACM) 51 (4), 606-635, 2004 | 342 | 2004 |
| Approximate nearest neighbor: Towards removing the curse of dimensionality S Har-Peled, P Indyk, R Motwani Theory of computing 8 (1), 321-350, 2012 | 328 | 2012 |
| Fast construction of nets in low-dimensional metrics and their applications S Har-Peled, M Mendel SIAM Journal on Computing 35 (5), 1148-1184, 2006 | 311 | 2006 |
| Generalization Bounds for the Area Under the ROC Curve. S Agarwal, T Graepel, R Herbrich, S Har-Peled, D Roth, MI Jordan Journal of Machine Learning Research 6 (4), 2005 | 258 | 2005 |
| Smaller coresets for k-median and k-means clustering S Har-Peled, A Kushal Discrete & Computational Geometry 37 (1), 3-19, 2007 | 246 | 2007 |
| Optimally cutting a surface into a disk J Erickson, S Har-Peled Discrete & Computational Geometry 31 (1), 37-59, 2004 | 226 | 2004 |
| Approximation algorithms for two optimal location problems in sensor networks A Efrat, S Har-Peled, JSB Mitchell 2nd International Conference on Broadband Networks, 2005., 714-723, 2005 | 217 | 2005 |
| A replacement for Voronoi diagrams of near linear size S Har-Peled Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 94-103, 2001 | 210 | 2001 |
| Approximation algorithms for maximum independent set of pseudo-disks TM Chan, S Har-Peled Discrete & Computational Geometry 48 (2), 373-392, 2012 | 191 | 2012 |
| On approximating the depth and related problems B Aronov, S Har-Peled SIAM Journal on Computing 38 (3), 899-921, 2008 | 164 | 2008 |
| How fast is the k-means method? S Har-Peled, B Sadri Algorithmica 41 (3), 185-202, 2005 | 164 | 2005 |
| Near-linear time approximation algorithms for curve simplification PK Agarwal, S Har-Peled, NH Mustafa, Y Wang Algorithmica 42 (3), 203-219, 2005 | 158 | 2005 |
| Clustering motion S Har-Peled Discrete & Computational Geometry 31 (4), 545-565, 2004 | 138 | 2004 |
| Fréchet distance for curves, revisited B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk European symposium on algorithms, 52-63, 2006 | 131 | 2006 |
