Sariel Har-Peled - Citegraph

Author Info

Name	Affiliation	Papers
SARIEL HAR-PELED	Department of Computer Science, DCL 2111, University of Illinois, 1304 West Springfield Avenue, Urbana, IL 61801, USA	166
Collaborators	Citations	PageRank
153	2630	191.68
Referers	Referees	References
3294	1760	2136

Search Limit

1001000

Publications (100 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
SOMETIMES RELIABLE SPANNERS OF ALMOST LINEAR SIZE	0	0.34	2022
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?	0	0.34	2022
Sampling Near Neighbors in Search for Fairness	0	0.34	2022
Stabbing Convex Bodies with Lines and Flats	0	0.34	2021
Approximate greedy clustering and distance selection for graph metrics.	0	0.34	2020
On separating points by lines	1	0.44	2020
Edge Estimation with Independent Set Oracles	1	0.35	2020
ON LOCALITY-SENSITIVE ORDERINGS AND THEIR APPLICATIONS	3	0.45	2019
Near Neighbor: Who is the Fairest of Them All?	0	0.34	2019
Grid peeling and the affine curve-shortening flow.	0	0.34	2018
Few Cuts Meet Many Point Sets.	1	0.36	2018
A Spanner For The Day After	0	0.34	2018
Approximate Sparse Linear Regression.	0	0.34	2018
Edge Estimation with Independent Set Oracles.	2	0.41	2018
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.	11	0.54	2017
How to Net a Convex Shape.	0	0.34	2017
A Simple Algorithm for Computing a Cycle Separator.	0	0.34	2017
Nearest-Neighbor Searching Under Uncertainty II	1	0.35	2017
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location	0	0.34	2017
Depth contours in arrangements of halfplanes.	0	0.34	2016
Nearest neighbor searching under uncertainty II	4	0.39	2016
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs.	0	0.34	2016
Shortest Path In A Polygon Using Sublinear Space	4	0.51	2016
Approximate Greedy Clustering And Distance Selection For Graph Metrics	0	0.34	2015
A Simple Algorithm for Maximum Margin Classification, Revisited	0	0.34	2015
Minimum Convex Partitions And Maximum Empty Polytopes	0	0.34	2014
Epsilon-Nets for Halfspaces Revisited.	5	0.44	2014
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons	17	0.75	2014
Low Rank Matrix Approximation in Linear Time.	14	1.97	2014
Space Exploration via Proximity Search.	0	0.34	2014
Robust Proximity Search for Balls Using Sublinear Space.	1	0.38	2014
Peeling the Grid	0	0.34	2013
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems.	11	0.53	2013
Union of Random Minkowski Sums and Network Vulnerability Analysis	8	0.54	2013
Approximating Minimization Diagrams and Generalized Proximity Search	2	0.38	2013
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small	7	0.45	2013
Minimum convex partitions and maximum empty polytopes	2	0.36	2012
On the set multicover problem in geometric settings	35	1.71	2012
New constructions of SSPDs and their applications	4	0.43	2012
The frechet distance revisited and extended	0	0.34	2012
A Simple Proof of the Existence of a Planar Separator	4	0.42	2011
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space	1	0.36	2011
Jaywalking your dog: computing the Fréchet distance with shortcuts	27	0.95	2011
Computing the Fréchet distance between folded polygons	8	0.52	2011
Approximate distance queries and compact routing in sparse graphs	16	0.59	2011
Relative (p,ε)-Approximations in Geometry	35	1.16	2011
Carnival of Samplings: Nets, Approximations, Relative and Sensitive	1	0.37	2009
Randomized Incremental Construction of Compressed Quadtrees	0	0.34	2009
Approximating Spanning Trees with Low Crossing Number	3	0.41	2009
Being Fat and Friendly is Not Enough	13	0.73	2009

1
2
50 / page