Sariel Har-Peled | Academic Influence

Sariel Har-Peled's AcademicInfluence.com Rankings

Sariel Har-Peled

Computer Science

#2657

World Rank

#2779

Historical Rank

Database

#2798

World Rank

#2923

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Sariel Har-Peled's Degrees

PhD Computer Science Tel Aviv University
Masters Computer Science Tel Aviv University
Bachelors Computer Science Tel Aviv University

Similar Degrees You Can Earn

Why Is Sariel Har-Peled Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Sariel Har-Peled is an Israeli–American computer scientist known for his research in computational geometry. He is a Donald Biggar Willett Professor in Engineering at the University of Illinois at Urbana–Champaign.

(See a Problem?)

Sariel Har-Peled's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Approximate nearest neighbors: towards removing the curse of dimensionality (1998) (4755)
On coresets for k-means and k-median clustering (2004) (534)
Approximate clustering via core-sets (2002) (444)
Geometric Approximation via Coresets (2007) (381)
Geometric Approximation Algorithms (2011) (369)
Approximating extent measures of points (2004) (354)
Random Walks (2021) (314)
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions (1999) (311)
Smaller Coresets for k-Median and k-Means Clustering (2005) (274)
Generalization Bounds for the Area Under the ROC Curve (2005) (257)
Fast construction of nets in low dimensional metrics, and their applications (2005) (252)
Optimally Cutting a Surface into a Disk (2002) (202)
Constraint Classification: A New Approach to Multiclass Classification (2002) (200)
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks (2009) (200)
Constraint Classification for Multiclass Classification and Ranking (2002) (187)
A replacement for Voronoi diagrams of near linear size (2001) (183)
On approximating the depth and related problems (2005) (172)
Approximation algorithms for two optimal location problems in sensor networks (2005) (168)
Near-Linear Time Approximation Algorithms for Curve Simplification (2002) (159)
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time (2010) (147)
How Fast Is the k-Means Method? (2005) (145)
Coresets for $k$-Means and $k$-Median Clustering and their Applications (2018) (128)
Fréchet Distance for Curves, Revisited (2006) (124)
Clustering Motion (2001) (119)
Guarding galleries and terrains (2002) (117)
Relative (p,ε)-Approximations in Geometry (2011) (112)
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts (2011) (108)
Sweeping simple polygons with a chain of guards (2000) (99)
Projective clustering in high dimensions using core-sets (2002) (89)
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications (2004) (89)
The fréchet distance revisited and extended (2012) (83)
Finding a Guard that Sees Most and a Shop that Sells Most (2004) (83)
Penetration Depth of Two Convex Polytopes in 3D (2000) (83)
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects (2002) (81)
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping (2002) (80)
On conflict-free coloring of points and simple regions in the plane (2003) (80)
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (2015) (79)
The One-Round Voronoi Game (2002) (76)
Constructing approximate shortest path maps in three dimensions (1998) (74)
Algorithmic issues in modeling motion (2002) (72)
Maintaining approximate extent measures of moving points (2001) (71)
Shape fitting with outliers (2003) (68)
Maximum Margin Coresets for Active and Noise Tolerant Learning (2007) (63)
Approximating k-hop minimum-spanning trees (2005) (61)
Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard (2001) (60)
On the set multicover problem in geometric settings (2009) (60)
Conflict-Free Coloring of Points and Simple Regions in the Plane (2005) (59)
Approximating shortest paths on a convex polytope in three dimensions (1997) (52)
A practical approach for computing the diameter of a point set (2001) (49)
Fast Algorithms for Computing the Smallest k-Enclosing Circle (2004) (48)
Results on k-sets and j-facets via continuous motion (1998) (47)
Taking a walk in a planar arrangement (1999) (46)
A time-optimal delaunay refinement algorithm in two dimensions (2005) (46)
Approximating shortest paths on a convex polytope in three dimensions (1996) (45)
Computing Approximate Shortest Paths on Convex Polytopes (2000) (45)
Robust Shape Fitting via Peeling and Grating Coresets (2006) (44)
The orienteering problem in the plane revisited (2006) (43)
High-Dimensional Shape Fitting in Linear Time (2003) (43)
Embeddings of surfaces, curves, and moving points in euclidean space (2007) (42)
On the set multi-cover problem in geometric settings (2009) (42)
Nearest neighbor searching under uncertainty II (2016) (42)
Convex Hulls Under Uncertainty (2014) (42)
Edge Estimation with Independent Set Oracles (2017) (41)
No, Coreset, No Cry (2004) (41)
Approximation and exact algorithms for minimum-width annuli and shells (1999) (40)
Covering Many or Few Points with Unit Disks (2006) (40)
On generalization bounds, projection profile, and margin distribution (2002) (39)
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions (1997) (39)
On the Least Median Square Problem (2004) (38)
On the Number of Edges of Fan-Crossing Free Graphs (2013) (38)
Approximate distance queries and compact routing in sparse graphs (2011) (37)
Weighted geometric set cover problems revisited (2012) (36)
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons (2013) (36)
On the Expected Complexity of Random Convex Hulls (2011) (35)
Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions (1999) (33)
Constructing Planar Cuttings in Theory and Practice (2000) (33)
Net and prune: a linear time algorithm for euclidean distance problems (2013) (32)
Fast Algorithms for Computing the Smallest k-Enclosing Disc (2003) (32)
Coresets for Discrete Integration and Clustering (2006) (31)
Approximate shape fitting via linearization (2001) (30)
Sparse Approximation via Generating Point Sets (2015) (29)
Approximate Nearest Neighbors (2006) (29)
Being Fat and Friendly is Not Enough (2009) (28)
Routing with a clue (1999) (27)
The Euclidean Orienteering Problem Revisited (2008) (27)
Hausdorff distance under translation for points and balls (2003) (26)
On the Fermat-Weber center of a convex object (2005) (25)
Morphing between polylines (2001) (25)
Dynamic Well-Separated Pair Decomposition Made Easy (2005) (24)
Shortest path in a polygon using sublinear space (2014) (24)
The complexity of a single face of a minkowski sum (1995) (24)
Geometric packing under non-uniform constraints (2011) (23)
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points (2005) (23)
On approximate halfspace range counting and relative epsilon-approximations (2007) (23)
Online Point Location in Planar Arrangements and Its Applications (2001) (22)
Approximation Schemes for Independent Set and Sparse Subsets of Polygons (2017) (22)
How to Walk Your Dog in the Mountains with No Magic Leash (2012) (22)
New constructions of SSPDs and their applications (2010) (21)
Efficient algorithms for shared camera control (2003) (21)
Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
A Simple Proof of the Existence of a Planar Separator (2011) (20)
Constructing cuttings in theory and practice (1998) (20)
An output sensitive algorithm for discrete convex hulls (1998) (19)
Euclidean spanners in high dimensions (2013) (18)
How to get close to the median shape (2006) (17)
Approximation algorithms for location problems in sensor networks. (2005) (17)
The frechet distance revisited and extended (2011) (16)
Range Medians (2008) (16)
Approximation Algorithms for Minimum-Width Annuli and Shells (2000) (16)
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small (2013) (15)
On Locality-Sensitive Orderings and their Applications (2018) (15)
Fly cheaply: on the minimum fuel-consumption problem (1998) (15)
Near Neighbor: Who is the Fairest of Them All? (2019) (15)
Peeling the Grid (2013) (15)
Low Rank Matrix Approximation in Linear Time (2014) (15)
Nearest-Neighbor Searching Under Uncertainty II (2016) (14)
A Uniform Convergence Bound for the Area Under the ROC Curve (2005) (14)
Geographic Quorum System Approximations (2005) (14)
Routing with a clue (2001) (13)
On Separating Points by Lines (2017) (13)
When crossings count — approximating the minimum spanning tree (2000) (13)
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location (2017) (12)
Approximating Minimization Diagrams and Generalized Proximity Search (2013) (12)
Stabbing pairwise intersecting disks by five points (2018) (12)
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (2015) (12)
Approximating Spanning Trees with Low Crossing Number (2009) (11)
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams (2015) (11)
Approximate nearest neighbor search for low dimensional queries (2010) (11)
Net and Prune (2015) (11)
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search (2015) (10)
Relative (p,epsilon)-Approximations in Geometry (2009) (10)
Epsilon-Nets for Halfspaces Revisited (2014) (10)
A Spanner for the Day After (2018) (10)
On the Expected Complexity of Voronoi Diagrams on Terrains (2011) (9)
Quadtrees—hierarchical grids (2011) (9)
Approximate Greedy Clustering and Distance Selection for Graph Metrics (2015) (9)
Approximating the Maximum Overlap of Polygons under Translation (2014) (9)
On the Complexity of Randomly Weighted Voronoi Diagrams (2014) (9)
From Proximity to Utility: A Voronoi Partition of Pareto Optima (2014) (9)
Hausdor Distance under Translation for Points, Disks, and Balls (2002) (9)
Computing the k Nearest-Neighbors for all Vertices via Dijkstra (2016) (9)
Separating a Voronoi Diagram via Local Search (2013) (9)
Approximate Sparse Linear Regression (2016) (8)
On-Line Zone Construction in Arrangements of Lines in the Plane (1999) (8)
Relative ε-Approximations in Geometry ∗ (2006) (8)
On complexity, sampling, and -nets and -samples (2011) (8)
Approximation Algorithms for Low-Density Graphs (2015) (8)
Reporting intersecting pairs of convex polytopes in two and three dimensions (2002) (8)
Separability with Outliers (2005) (8)
Minimum Convex Partitions and Maximum Empty Polytopes (2011) (7)
Cutting a Surface into a Disk (2002) (7)
Few Cuts Meet Many Point Sets (2018) (7)
Improved Approximation Algorithms for Tverberg Partitions (2020) (7)
Smallest k-Enclosing Rectangle Revisited (2019) (7)
Multicolor Combination Lemma (1999) (7)
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space (2011) (7)
A Simple Algorithm for Maximum Margin Classification, Revisited (2015) (6)
Carnival of Samplings: Nets, Approximations, Relative and Sensitive (2009) (6)
Geometric Packing under Nonuniform Constraints (2017) (6)
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All? (2021) (6)
Partial Curve Matching under the Fréchet Distance∗ (2006) (5)
Fast LP-based Approximations for Geometric Packing and Covering Problems (2020) (5)
Fair near neighbor search via sampling (2021) (5)
Geographic Quorum Systems Approximations (2014) (5)
Approximating the $k$-Level in Three-Dimensional Plane Arrangements (2016) (5)
Journey to the Center of the Point Set (2017) (5)
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space (2011) (5)
Space Exploration via Proximity Search (2014) (4)
Sometimes Reliable Spanners of Almost Linear Size (2019) (4)
Reliable Spanners for Metric Spaces (2020) (4)
Active-Learning a Convex Body in Low Dimensions (2019) (4)
Hausdorff distance under translation for points and balls (2010) (4)
Separating a Voronoi Diagram (2013) (4)
An On-line Occlusio-Culling Algorithm for FastWalkthrough in Urban Areas (2001) (4)
Grid Peeling and the Affine Curve-Shortening Flow (2017) (3)
Occlusion Culling for Fast Walkthrough in Urban Areas (2000) (3)
Approximate nearest neighbor search in low dimension (2011) (3)
Algorithms on clustering, orienteering, and conflict-free coloring (2007) (2)
On Johnson-Lindenstrauss Lemma (2005) (2)
Yet even more on sampling (2011) (2)
Two (Known) Results About Graphs with No Short Odd Cycles (2018) (2)
Proof of Dudley's Convex Approximation (2019) (2)
Results on -Sets and -Facets via Continuous Motion (1997) (2)
Approximation Algorithms for Minimum-Width Annuli and Shells (2000) (2)
Robust Proximity Search for Balls Using Sublinear Space (2014) (2)
On Core-sets and Slabs (2003) (2)
Computing the Fréchet Distance between Folded Polygons Atlas (2)
Linear programming in low dimensions (2011) (2)
Two randomized incramental algorithms for planar arrangements , with a twist (2004) (2)
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions (2001) (2)
On the expected complexity of voronoi diagrams on terrains (2012) (2)
How Fast Is the k-Means Method? 1 (2005) (2)
Random partition via shifting (2011) (2)
Generalization Bounds for Linear Learning Algorithms (2001) (2)
An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane (2003) (1)
Approximating the Euclidean traveling salesman problem (TSP) (2011) (1)
ε-Nets for Halfspaces Revisited ∗ (2014) (1)
Approximate nearest neighbor (ANN) search in high dimensions (2011) (1)
Stabbing Convex Bodies with Lines and Flats (2020) (1)
How Packed Is It, Really? (2021) (1)
On Lloyd ’ s k-means Method ∗ (2007) (1)
Fr\'echet Distance Revisited and Extended (2012) (1)
Chapter 4 Dynamic programming (2007) (1)
On Approximate Halfspace Range Counting and Relative "-Approximations (2007) (1)
On Finding a Guard that Sees Mostand a Shop that Sells (2003) (1)
Optimal Algorithms for Geometric Centers and Depth (2019) (1)
Approximating the Maximum Overlap of Polygons under Translation (2016) (1)
A Simple Algorithm for Computing a Cycle Separator (2017) (1)
Approximation Algorithms in Geometry 1 The Brunn-Minkowski inequality Definition 1 (2005) (1)
Tail Inequalities (2005) (1)
How to Net a Convex Shape (2017) (1)
Generalization Bounds for Linear Learning Algorithm (2001) (1)
Convex Hulls Under Uncertainty (2016) (1)
Fast Algorithms for Geometric Consensuses (2019) (1)
On Undecided LP, Clustering and Active Learning (2021) (1)
Chapter 23 Approximate Max Cut (2013) (0)
Well-separated pair decomposition (2011) (0)
Chapter 13 Polyhedrons , Polytopes and Linear Programming (2010) (0)
Chapter 2 NP Completeness II (2021) (0)
Shortest Secure Path in a Voronoi Diagram (2020) (0)
Randomized Algorithms 9.1. Some Probability (0)
Chapter 10 Randomized Algorithms II (2018) (0)
On the Number of Incidences when Avoiding the Klan (2021) (0)
Chapter 21 Approximating a Convex Body by An Ellipsoid (2008) (0)
Chapter 7 Depth estimation via sampling (2008) (0)
Results on -facets via continuous motion (1998) (0)
Chapter 14 Embedding planar graphs on a grid (2020) (0)
Chapter 6 Approximation algorithms (2018) (0)
Chapter 18 Expanders (0)
The Maximum-Level Vertex in an Arrangement of Lines (2020) (0)
Chapter 27 Miscellaneous Prerequisite (0)
CGAL Reference and User Manuals (2001) (0)
Chapter 17 Approximate Nearest Neighbor via Point-Location (2010) (0)
Chapter 22 Sorting Networks (0)
Chapter 19 Finite Metric Spaces and Partitions (2008) (0)
Chapter 9 Randomized Algorithms (2018) (0)
The Occupancy and Coupon Collector problems-part II (2005) (0)
C G ] 1 2 O ct 2 01 4 ε-Nets for Halfspaces Revisited ∗ (2014) (0)
Some probability and tail inequalities (2011) (0)
Randomized Incremental Construction of Compressed Quadtrees (2009) (0)
Good triangulations and meshing (2011) (0)
2 J ul 2 00 2 Optimally Cutting a Surface into a Disk ∗ (2006) (0)
Chapter 27 Tail Inequalities (2009) (0)
Chapter 23 Union Find (0)
Chapter 17 Network Flow V-Min-cost flow (2007) (0)
Chapter 32 Lower Bounds (0)
14-Approximating the Extent of Lines , Hyperplanes and Moving Points (0)
The Power of Grids-Computing the Minimum Disk Containing k Points Sariel (2005) (0)
Depth contours in arrangements of halfplanes (2016) (0)
Chapter 5 Dynamic programming II-The Recursion Strikes Back (2021) (0)
Chapter 23 Approximate Max Cut 23.1 Problem Statement (2007) (0)
Computing Optimal Kernels in Two Dimensions (2022) (0)
Chapter 21 Fast Fourier Transform 21.1. Introduction (0)
Chapter 17 ANN in High Dimensions (0)
Chapter 19 Linear Programming II (0)
Polyhedrons, polytopes, and linear programming (2011) (0)
Chapter 10 Random Partition via Shifting (2010) (0)
The Probabilistic Method IV 497-Randomized Algorithms (2002) (0)
Session details: Session 5A (2005) (0)
Some Geometric Applications of Anti-Chains (2019) (0)
Approximation using shell sets (2011) (0)
Covering Polygons by Min-Area Convex Polygons (2019) (0)
Chapter 14 Approximate Nearest Neighbor via Point-Location among Balls (2008) (0)
Approximate Max Cut (2005) (0)
From Proximity to Utility : 1 A Voronoi Partition of Pareto Optima ∗ 2 (2016) (0)
Entropy, Randomness, and Information (2005) (0)
A Comment on Pseudo-Triangulation in Three Dimensions (2002) (0)
Finite metric spaces and partitions (2011) (0)
On-line Zone Constru tion in Arrangementsof Lines in the Plane ? (1999) (0)
Chapter 19 The Johnson-Lindenstrauss Lemma (2010) (0)
Approximation via reweighting (2011) (0)
Ja n 20 10 Relative ( p , ε )-Approximations in Geometry ∗ (2010) (0)
VC Dimension, "-nets and "-approximation (2013) (0)
Chapter 8 Approximating the Depth via Sampling and Emptiness (2008) (0)
Chapter 30 Matchings 30.1. Definitions and Basic Properties 30.1.1. Definitions (0)
Chapter 20 Approximating the Directional Width of a Shape (2008) (0)
Chapter 28 Tail Inequalities (2010) (0)
Sampling and the moments technique (2011) (0)
Chapter 33 Backwards analysis (0)
Chapter 53 Low Dimensional Linear Programming (2022) (0)
Computational Geometry Applications of Well Separted Pairs Decomposition (2000) (0)
Chapter 1 Polyhedrons , Polytopes and Linear Programming (2008) (0)
The Complexity of One or Many Faces in the Overlay of Many Arrangements (1995) (0)
16 - Approximation Using Shell Sets (2005) (0)
Concentration of Random Variables – Chernoff’s Inequality (2020) (0)
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
Chapter 26 Duality (2010) (0)
Chapter 15 Approximate Voronoi Diagrams (2005) (0)
ANN in High Dimensions (2005) (0)
Chernoff Inequality - Part II (2005) (0)
Approximating the Euclidean TSP using bridges (2011) (0)
Approximating the depth via sampling and emptiness (2011) (0)
Chapter 25 Huffman Coding (0)
Chapter 7 Approximation algorithms II (2018) (0)
Well Separated Pairs Decomposition (2005) (0)
Chapter 31 Union Find (0)
Chapter 26 Tail Inequalities (2008) (0)
Chapter 2 Quadtrees-Hierarchical Grids (2008) (0)
Chapter 26 Huffman Coding (0)
Chapter 4 Clustering-Definitions and Basic Algorithms (2008) (0)
Chapter 8 Approximation algorithms III (2019) (0)
Clustering—definitions and basic algorithms (2011) (0)
LSH on the Hypercube Revisited (2017) (0)
Sampling near neighbors in search for fairness (2022) (0)
STAR-Tree : An EÆ ient Self-Adjusting Indexfor Moving Obje ts ? (2011) (0)
Depth estimation via sampling (2011) (0)
On the Width of the Regular n-Simplex (2023) (0)
Linear Programming II (2003) (0)
Submodular Clustering in Low Dimensions (2020) (0)
Chapter 6 Approximation via Reweighting (2008) (0)
Approximate nearest neighbor via point-location (2011) (0)
Chapter 22 Coresets (2010) (0)
Separators for Planar Graphs that are Almost Trees (2018) (0)
Chapter 24 Approximation Using Shell Sets (2008) (0)
The Probabilistic Method III (2005) (0)
On Clusters that are Separated but Large (2021) (0)
C G ] 9 A pr 2 01 7 LSH on the Hypercube Revisited (2021) (0)
Approximating the minimum volume bounding box of a point set (2011) (0)
Chapter 24 Duality (2008) (0)
Chapter 1 NP Completeness I (2007) (0)
Chapter 19 Sorting Networks (0)
Reliable Geometric Spanners (2019) (0)
Chapter 14 Polyhedrons , Polytopes and Linear Programming (2010) (0)
Jaywalking your Dog - The Fr\'echet Distance with Shortcuts (2011) (0)
Sampling and other Stuff (2005) (0)
Dimension Reducation - The Johnson-Lindenstrauss (JL)lemma (2011) (0)
Chapter 22 Approximating the Extent of Lines , Hyperplanes and Moving Points (2009) (0)
Chapter 3 Well Separated Pairs Decomposition (2008) (0)
Chapter 19 Linear Programming in Low Dimensions (2008) (0)
Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space (2009) (0)
Chapter 1 The Power of Grids-Computing the Minimum Disk Containing k Points (0)
Chapter 16 Random Walks III (0)
Chapter 25 Duality (2009) (0)
Chapter 11 Min Cut 11.1 Min Cut 11.1.1 Problem Definition (2007) (0)
Chapter 31 Matchings II (0)
Complexity , the Changing Minimum and Closest Pair (2005) (0)
Chapter 29 Shannon ’ s theorem (2013) (0)
2: Network Flow V -min-cost Flow (2006) (0)
Chapter 22 Approximation Algorithms using Linear Programming Version : 0 (2018) (0)
Approximating a convex body by an ellipsoid (2011) (0)
Chapter 15 Polyhedrons , Polytopes and Linear Programming (2010) (0)
Chapter 10 Approximating the Euclidean Traveling Salesman Problem ( TSP ) (2009) (0)
Approximation algorithm for the L1-fitting circle problem (2005) (0)
The power of grids—closest pair and smallest enclosing disk (2011) (0)

This paper list is powered by the following services:

Other Resources About Sariel Har-Peled

en.wikipedia.org

What Schools Are Affiliated With Sariel Har-Peled?

Sariel Har-Peled is affiliated with the following schools: