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 | 828 | 2004 |

Geometric approximation via coresets PK Agarwal, S Har-Peled, KR Varadarajan Combinatorial and computational geometry 52 (1), 1-30, 2005 | 564 | 2005 |

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 | 554 | 2002 |

Geometric approximation algorithms S Har-Peled American Mathematical Soc., 2011 | 524 | 2011 |

Approximate nearest neighbor: Towards removing the curse of dimensionality S Har-Peled, P Indyk, R Motwani Theory of Computing Exchange, 2012 | 471 | 2012 |

Approximating extent measures of points PK Agarwal, S Har-Peled, KR Varadarajan Journal of the ACM (JACM) 51 (4), 606-635, 2004 | 453 | 2004 |

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 | 435* | 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 | 425 | 2001 |

Fast construction of nets in low dimensional metrics, and their applications S Har-Peled, M Mendel Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 394 | 2005 |

Smaller coresets for k-median and k-means clustering S Har-Peled, A Kushal Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 353 | 2005 |

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 | 317 | 2005 |

Optimally cutting a surface into a disk J Erickson, S Har-Peled Proceedings of the eighteenth annual symposium on Computational geometry …, 2002 | 259 | 2002 |

Approximation algorithms for maximum independent set of pseudo-disks TM Chan, S Har-Peled Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 249 | 2009 |

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 | 237 | 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 | 230 | 2001 |

Fréchet distance for curves, revisited B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006 | 200 | 2006 |

Near-linear time approximation algorithms for curve simplification PK Agarwal, S Har-Peled, NH Mustafa, Y Wang Algorithmica 42, 203-219, 2005 | 191 | 2005 |

How Fast Is the *k*-Means Method?S Har-Peled, B Sadri Algorithmica 41, 185-202, 2005 | 191 | 2005 |

Approximating the Fréchet distance for realistic curves in near linear time A Driemel, S Har-Peled, C Wenk Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010 | 190 | 2010 |

On approximating the depth and related problems B Aronov, S Har-Peled SIAM Journal on Computing 38 (3), 899-921, 2008 | 182 | 2008 |