World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
56
Citations
13191
World Ranking
4060
National Ranking
1931

Overview

Sariel Har-Peled is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their main field of study is Computer Science, with a focus spanning several subfields. These subfields include Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Signal Processing.

The core areas of research for Har-Peled concentrate on Computational Geometry and Mesh Generation, Complexity and Algorithms in Graphs, Data Management and Algorithms, Optimization and Search Problems, Digital Image Processing Techniques, Advanced Graph Theory Research, and Point processes and geometric inequalities.

Har-Peled has published extensively, with notable recent papers such as:

  • "Fair near neighbor search via sampling" (2021) published in ACM SIGMOD Record
  • "Stabbing pairwise intersecting disks by five points" (2021) published in Discrete Mathematics
  • "Edge Estimation with Independent Set Oracles" (2020) published in ACM Transactions on Algorithms
  • "Sampling a Near Neighbor in High Dimensions" (2022) published in Padua Research Archive (University of Padua)
  • "Sampling near neighbors in search for fairness" (2022) published in Communications of the ACM

The frequent coauthors working alongside Har-Peled include Mitchell Jones, Eliot W. Robson, Stav Ashur, Martin Aumüller, and Sepideh Mahabadi. These collaborations reflect a sustained engagement with researchers sharing interest in similar scientific challenges.

Har-Peled's publications have appeared in various venues, with a significant number of works featured in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Discrete & Computational Geometry
  • ACM Transactions on Algorithms
  • Algorithmica

Best Publications

  • On coresets for k-means and k-median clustering

    Sariel Har-Peled;Soham Mazumdar

  • Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

    Sariel Har-Peled;Piotr Indyk;Rajeev Motwani

  • Approximate clustering via core-sets

    Mihai Bādoiu;Sariel Har-Peled;Piotr Indyk

  • Geometric Approximation via Coresets

    P. K. Agarwal;S. Har-Peled;K. Varadarajan

  • Geometric Approximation Algorithms

    Sariel Har-peled

  • Smaller Coresets for k-Median and k-Means Clustering

    Sariel Har-Peled;Akash Kushal

  • Efficiently approximating the minimum-volume bounding box of a point set in three dimensions

    Gill Barequet;Sariel Har-Peled

  • Approximating extent measures of points

    Pankaj K. Agarwal;Sariel Har-Peled;Kasturi R. Varadarajan

  • Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

    Sariel Har-Peled;Manor Mendel;Manor Mendel

  • Constraint Classification for Multiclass Classification and Ranking

    Sariel Har-Peled;Dan Roth;Dav Zimak

  • Optimally Cutting a Surface into a Disk

    Jeff Erickson;Sariel Har-Peled

  • Generalization Bounds for the Area Under the ROC Curve

    Shivani Agarwal;Thore Graepel;Ralf Herbrich;Sariel Har-Peled

  • How fast is the k-means method?

    Sariel Har-Peled;Bardia Sadri

  • A replacement for Voronoi diagrams of near linear size

    S. Har-Peled

  • Near-Linear Time Approximation Algorithms for Curve Simplification

    Pankaj K. Agarwal;Sariel Har-Peled;Nabil H. Mustafa;Yusu Wang

  • Approximation algorithms for two optimal location problems in sensor networks

    A. Efrat;S. Har-Peled;J.S.B. Mitchell

  • Constraint classification: A new approach to multiclass classification

    Sariel Har-Peled;Dan Roth;Dav Zimak

  • Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts

    Anne Driemel;Sariel Har-Peled

  • The fréchet distance revisited and extended

    Sariel Har-Peled;Benjamin Raichel

  • On Approximating the Depth and Related Problems

    Boris Aronov;Sariel Har-Peled

Frequent Co-Authors

Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Micha Sharir
Micha Sharir Tel Aviv University
Boris Aronov
Boris Aronov New York University
Timothy M. Chan
Timothy M. Chan University of Illinois at Urbana-Champaign
Dan Roth
Dan Roth University of Pennsylvania
Haim Kaplan
Haim Kaplan Tel Aviv University
Kasturi Varadarajan
Kasturi Varadarajan University of Iowa
Alon Efrat
Alon Efrat University of Arizona
Yusu Wang
Yusu Wang University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens many doors—both in traditional classrooms and through dynamic online programs. For those seeking flexibility, there are numerous pathways to consider.

Many students pursue business and tech together. An increasingly popular option is a cheap mba online, which pairs well with a tech background for leadership or management roles.

If you want to upskill and enter the workforce quickly, consider quick degrees online that pay well. These programs focus on in-demand skills and can lead to lucrative career options in a short timeframe.

Fast-paced learners might benefit from online one year masters programs, which allow you to earn an advanced degree and accelerate your career without a long-term commitment.

For those especially interested in future-focused technology, exploring an ai degree online can equip you with specialized knowledge in machine learning, robotics, and data science.

Each of these online pathways can enrich your Computer Science journey, offering both flexibility and strong career prospects.

Best Scientists Citing Sariel Har-Peled

Trending Scientists