- Home
- Best Scientists - Mathematics
- Sariel Har-Peled

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
48
Citations
11,247
213
World Ranking
879
National Ranking
432

Computer Science
D-index
48
Citations
11,328
212
World Ranking
3986
National Ranking
2033

- Geometry
- Combinatorics
- Artificial intelligence

Sariel Har-Peled mostly deals with Combinatorics, Discrete mathematics, Cluster analysis, Simple and Approximation algorithm. His work on Time complexity as part of general Combinatorics study is frequently linked to Running time, therefore connecting diverse disciplines of science. Sariel Har-Peled has researched Discrete mathematics in several fields, including Affine space, Fraction, Core and Projective clustering.

His Cluster analysis study combines topics in areas such as Voronoi diagram and Algorithm. His studies in Simple integrate themes in fields like Linear programming and Map coloring. His Approximation algorithm study incorporates themes from Art gallery problem, Fréchet distance, Line segment and Computational geometry.

- Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality (631 citations)
- On coresets for k-means and k-median clustering (366 citations)
- Approximate clustering via core-sets (342 citations)

Sariel Har-Peled mainly investigates Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Point. His biological study focuses on Binary logarithm. His work on Independent set and Planar graph is typically connected to Proximity search and Planar as part of general Discrete mathematics study, connecting several disciplines of science.

His Approximation algorithm research integrates issues from Computational geometry and Fréchet distance. His Time complexity research incorporates themes from Polygonal chain, Outlier and Constant. His research on Algorithm often connects related areas such as Cluster analysis.

- Combinatorics (68.77%)
- Discrete mathematics (30.28%)
- Approximation algorithm (24.92%)

- Combinatorics (68.77%)
- Approximation algorithm (24.92%)
- Discrete mathematics (30.28%)

Sariel Har-Peled mostly deals with Combinatorics, Approximation algorithm, Discrete mathematics, Point and Plane. His studies deal with areas such as Simple and Point set as well as Combinatorics. His Point set study integrates concerns from other disciplines, such as Centerpoint and Unit square.

His research integrates issues of Intersection, Computational geometry, Constant, Upper and lower bounds and Partition in his study of Approximation algorithm. His biological study spans a wide range of topics, including Graph and Polynomial expansion. His research in Time complexity intersects with topics in Rectangle and Planar graph.

- Coresets for $k$-Means and $k$-Median Clustering and their Applications. (95 citations)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (42 citations)
- Towards Tight Bounds for the Streaming Set Cover Problem (22 citations)

- Combinatorics
- Geometry
- Artificial intelligence

His main research concerns Combinatorics, Approximation algorithm, Discrete mathematics, Point and Plane. A large part of his Combinatorics studies is devoted to Binary logarithm. The concepts of his Approximation algorithm study are interwoven with issues in Time complexity, Computational geometry, Fréchet distance and Partition.

His Discrete mathematics research includes themes of Dijkstra's algorithm, Johnson's algorithm and k-nearest neighbors algorithm. The study incorporates disciplines such as Probability distribution, Unit square, Dual and Connection in addition to Point. His Plane research is multidisciplinary, relying on both Set cover problem, Logarithm, Sublinear function, Streaming algorithm and Upper and lower bounds.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

Sariel Har-Peled;Piotr Indyk;Rajeev Motwani.

Theory of Computing **(2012)**

666 Citations

On coresets for k-means and k-median clustering

Sariel Har-Peled;Soham Mazumdar.

symposium on the theory of computing **(2004)**

653 Citations

Approximate clustering via core-sets

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

symposium on the theory of computing **(2002)**

500 Citations

Geometric Approximation via Coresets

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

Combinatorial and Computational Geometry, 2007, ISBN 0-521-84862-8, págs. 1-30 **(2007)**

435 Citations

Geometric Approximation Algorithms

Sariel Har-peled.

**(2011)**

411 Citations

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

Gill Barequet;Sariel Har-Peled.

symposium on discrete algorithms **(1999)**

388 Citations

Smaller Coresets for k-Median and k-Means Clustering

Sariel Har-Peled;Akash Kushal.

Discrete and Computational Geometry **(2007)**

383 Citations

Approximating extent measures of points

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

Journal of the ACM **(2004)**

370 Citations

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

Sariel Har-Peled;Manor Mendel;Manor Mendel.

SIAM Journal on Computing **(2006)**

329 Citations

Constraint Classification for Multiclass Classification and Ranking

Sariel Har-Peled;Dan Roth;Dav Zimak.

neural information processing systems **(2002)**

326 Citations

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

Contact us

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:

Duke University

Tel Aviv University

New York University

University of Illinois at Urbana-Champaign

MIT

University of Pennsylvania

University of Iowa

University of California, San Diego

Tel Aviv University

University of Arizona

University of Waterloo

East Tennessee State University

Max Planck Society

University at Albany, State University of New York

University of Connecticut

Korea Advanced Institute of Science and Technology

University of Nebraska–Lincoln

Bangor University

Budapest University of Technology and Economics

Grinnell College

University of Milano-Bicocca

Columbia University

Université Paris Cité

Durham University

City University of Hong Kong

The Open University of Japan

Something went wrong. Please try again later.