What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (68.77%)
- Discrete mathematics (30.28%)
- Approximation algorithm (24.92%)
What were the highlights of his more recent work (between 2015-2021)?
- Combinatorics (68.77%)
- Approximation algorithm (24.92%)
- Discrete mathematics (30.28%)
In recent papers he was focusing on the following fields of study:
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.
Between 2015 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
