Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSariel Har-Peled
שריאל הר-פלד
Person information
- unicode name: שריאל הר-פלד
- affiliation: University of Illinois at Urbana-Champaign, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c131]Zhimeng Gao, Sariel Har-Peled:
Near Optimal Locality Sensitive Orderings in Euclidean Space. SoCG 2024: 60:1-60:14- [c130]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. ICALP 2024: 81:1-81:19 - [c129]Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. SODA 2024: 4892-4908 - [c128]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA 2024: 244-268 - [c127]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. SWAT 2024: 2:1-2:15 - [c126]Sariel Har-Peled, Eliot Wong Robson:
No-Dimensional Tverberg Partitions Revisited. SWAT 2024: 26:1-26:14 - [i108]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. CoRR abs/2404.11853 (2024) - [i107]Sariel Har-Peled, Saladi Rahul:
Approximating Densest Subgraph in Geometric Intersection Graphs. CoRR abs/2405.18337 (2024) - [i106]Stav Ashur, Maria C. Lusardi, Marta Markowicz, James Motes, Marco Morales, Sariel Har-Peled, Nancy M. Amato:
SPITE: Simple Polyhedral Intersection Techniques for modified Environments. CoRR abs/2407.00259 (2024) - [i105]Sariel Har-Peled, Maria C. Lusardi:
Dependable Spanners via Unreliable Edges. CoRR abs/2407.01466 (2024) - [i104]Sariel Har-Peled, Benjamin Raichel, Eliot Wong Robson:
The Fréchet Distance Unleashed: Approximating a Dog with a Frog. CoRR abs/2407.03101 (2024) - 2023
- [j95]Sariel Har-Peled
, Mitchell Jones:
Few Cuts Meet Many Point Sets. Algorithmica 85(4): 965-975 (2023) - [j94]Sariel Har-Peled, Mitchell Jones:
A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discret. Comput. Geom. 69(4): 1241-1254 (2023) - [j93]Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. ACM Trans. Algorithms 19(1): 7:1-7:27 (2023) - [c125]Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CCCG 2023: 169-173 - [c124]Pankaj K. Agarwal, Sariel Har-Peled:
Computing Instance-Optimal Kernels in Two Dimensions. SoCG 2023: 4:1-4:15 - [c123]Sariel Har-Peled, Da Wei Zheng:
Halving by a Thousand Cuts or Punctures. SODA 2023: 1385-1397 - [c122]Timothy M. Chan, Sariel Har-Peled:
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. SODA 2023: 1398-1413 - [i103]Sariel Har-Peled, Eliot Wong Robson:
On the Width of the Regular n-Simplex. CoRR abs/2301.02616 (2023) - [i102]Sariel Har-Peled, Eliot Wong Robson:
No-dimensional Tverberg Partitions Revisited. CoRR abs/2306.01678 (2023) - [i101]Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CoRR abs/2306.02151 (2023) - [i100]Sariel Har-Peled:
Approximately: Independence Implies Vertex Cover. CoRR abs/2308.00840 (2023) - [i99]Zhimeng Gao, Sariel Har-Peled:
Almost Optimal Locality Sensitive Orderings in Euclidean Space. CoRR abs/2310.12792 (2023) - [i98]Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. CoRR abs/2311.02050 (2023) - [i97]Stav Ashur, Sariel Har-Peled:
On the Rectangles Induced by Points. CoRR abs/2311.10637 (2023) - 2022
- [j92]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling near neighbors in search for fairness. Commun. ACM 65(8): 83-90 (2022) - [j91]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - [j90]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes reliable spanners of almost linear size. J. Comput. Geom. 13(1): 178-196 (2022) - [j89]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. 51(3): 627-663 (2022) - [j88]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47(1): 4:1-4:40 (2022) - [c121]Sariel Har-Peled, Everett Yang:
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. SoCG 2022: 47:1-47:13 - [i96]Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. CoRR abs/2201.01715 (2022) - [i95]Sariel Har-Peled, Eliot Wong Robson:
Sparsifying Disk Intersection Graphs for Reliable Connectivity. CoRR abs/2201.01844 (2022) - [i94]Sariel Har-Peled, Everett Yang:
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs. CoRR abs/2201.01849 (2022) - [i93]Pankaj K. Agarwal, Sariel Har-Peled:
Computing Optimal Kernels in Two Dimensions. CoRR abs/2207.07211 (2022) - [i92]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR abs/2208.03829 (2022) - [i91]Sariel Har-Peled, Da Wei Zheng:
Halving by a Thousand Cuts or Punctures. CoRR abs/2208.11275 (2022) - 2021
- [j87]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active-Learning a Convex Body in Low Dimensions. Algorithmica 83(6): 1885-1917 (2021) - [j86]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. Discret. Comput. Geom. 66(2): 769-791 (2021) - [j85]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [j84]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Fair near neighbor search via sampling. SIGMOD Rec. 50(1): 42-49 (2021) - [j83]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. ACM Trans. Algorithms 17(1): 9:1-9:21 (2021) - [c120]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. SoCG 2021: 12:1-12:15 - [c119]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. SoCG 2021: 42:1-42:12 - [c118]Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. SoCG 2021: 43:1-43:13 - [c117]Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. ESA 2021: 51:1-51:15 - [i90]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR abs/2101.10905 (2021) - [i89]Stav Ashur, Sariel Har-Peled:
On Undecided LP, Clustering and Active Learning. CoRR abs/2103.09308 (2021) - [i88]Sariel Har-Peled, Timothy Zhou:
How Packed Is It, Really? CoRR abs/2105.10776 (2021) - [i87]Sariel Har-Peled, Joseph Rogge:
On Clusters that are Separated but Large. CoRR abs/2106.05363 (2021) - [i86]Sariel Har-Peled, Jiaqi Cheng:
On Competitive Permutations for Set Cover by Intervals. CoRR abs/2110.14528 (2021) - [i85]Sariel Har-Peled:
On the Number of Incidences when Avoiding the Klan. CoRR abs/2112.14829 (2021) - 2020
- [j82]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. Discret. Comput. Geom. 63(3): 705-730 (2020) - [j81]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j80]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. Discret. Comput. Geom. 64(4): 1167-1191 (2020) - [j79]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29(3): 306-316 (2020) - [j78]David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos:
Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. 11(1): 629-652 (2020) - [j77]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. 49(3): 583-600 (2020) - [j76]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms 16(4): 52:1-52:27 (2020) - [c116]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CCCG 2020: 326-331 - [c115]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. SoCG 2020: 50:1-50:16 - [c114]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes Reliable Spanners of Almost Linear Size. ESA 2020: 27:1-27:15 - [c113]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. ICALP 2020: 64:1-64:17 - [c112]Chandra Chekuri, Sariel Har-Peled, Kent Quanrud:
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA 2020: 1019-1038 - [c111]Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. SWAT 2020: 8:1-8:14 - [i84]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i83]Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. CoRR abs/2004.05494 (2020) - [i82]Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. CoRR abs/2007.08717 (2020) - [i81]Sariel Har-Peled, Dániel Oláh:
Reliable Spanners for Metric Spaces. CoRR abs/2007.08738 (2020) - [i80]Sariel Har-Peled, Rajgopal Varadharajan:
Shortest Secure Path in a Voronoi Diagram. CoRR abs/2007.09773 (2020) - [i79]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. CoRR abs/2007.09874 (2020)
2010 – 2019
- 2019
- [j75]Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019) - [j74]Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. ACM Trans. Algorithms 15(3): 32:1-32:16 (2019) - [c110]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. SoCG 2019: 19:1-19:15 - [c109]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. SoCG 2019: 23:1-23:15 - [c108]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. SoCG 2019: 41:1-41:14 - [c107]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. ITCS 2019: 21:1-21:17 - [c106]Sariel Har-Peled, Sepideh Mahabadi:
Near Neighbor: Who is the Fairest of Them All? NeurIPS 2019: 13176-13187 - [i78]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. CoRR abs/1903.03693 (2019) - [i77]Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. CoRR abs/1903.06785 (2019) - [i76]Sariel Har-Peled, Sepideh Mahabadi:
Near Neighbor: Who is the Fairest of Them All? CoRR abs/1906.02640 (2019) - [i75]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CoRR abs/1910.07586 (2019) - [i74]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes Reliable Spanners of Almost Linear Size. CoRR abs/1912.01547 (2019) - [i73]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. CoRR abs/1912.01639 (2019) - [i72]Sariel Har-Peled, Mitchell Jones:
Proof of Dudley's Convex Approximation. CoRR abs/1912.01977 (2019) - [i71]Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu:
Covering Polygons by Min-Area Convex Polygons. CoRR abs/1912.03429 (2019) - 2018
- [j73]Sariel Har-Peled, Nirman Kumar:
Robust Proximity Search for Balls Using Sublinear Space. Algorithmica 80(1): 279-299 (2018) - [c105]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. ALENEX 2018: 109-116 - [c104]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. ICALP 2018: 77:1-77:14 - [c103]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ITCS 2018: 38:1-38:21 - [c102]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c101]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. SODA 2018: 918-932 - [i70]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i69]Linda Cai, Sariel Har-Peled, Simiao Ye:
Separators for Planar Graphs that are Almost Trees. CoRR abs/1808.02815 (2018) - [i68]Sariel Har-Peled, Mitchell Jones:
Few Cuts Meet Many Point Sets. CoRR abs/1808.03260 (2018) - [i67]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and their Applications. CoRR abs/1809.11147 (2018) - [i66]Sariel Har-Peled, Saladi Rahul:
Two (Known) Results About Graphs with No Short Odd Cycles. CoRR abs/1810.01832 (2018) - [i65]Sariel Har-Peled, Soham Mazumdar:
Coresets for $k$-Means and $k$-Median Clustering and their Applications. CoRR abs/1810.12826 (2018) - [i64]Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. CoRR abs/1811.06898 (2018) - 2017
- [j72]Sariel Har-Peled, Subhro Roy:
Approximating the Maximum Overlap of Polygons under Translation. Algorithmica 78(1): 147-165 (2017) - [j71]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls Under Uncertainty. Algorithmica 79(2): 340-367 (2017) - [j70]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. 46(6): 1712-1744 (2017) - [j69]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46(6): 1745-1784 (2017) - [c100]Sariel Har-Peled, Sepideh Mahabadi:
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA 2017: 1-15 - [i63]Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR abs/1703.04758 (2017) - [i62]Sariel Har-Peled, Sepideh Mahabadi:
LSH on the Hypercube Revisited. CoRR abs/1704.02546 (2017) - [i61]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. CoRR abs/1706.02004 (2017) - [i60]Sariel Har-Peled, Amir Nayyeri:
A Simple Algorithm for Computing a Cycle Separator. CoRR abs/1709.08122 (2017) - [i59]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. CoRR abs/1710.03960 (2017) - [i58]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. CoRR abs/1711.07567 (2017) - [i57]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - [i56]Sariel Har-Peled, Mitchell Jones:
How to Net a Convex Shape. CoRR abs/1712.02949 (2017) - 2016
- [j68]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55(1): 39-73 (2016) - [j67]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. Discret. Comput. Geom. 56(2): 357-376 (2016) - [j66]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. Discret. Comput. Geom. 56(3): 631-656 (2016) - [j65]Sariel Har-Peled:
Shortest path in a polygon using sublinear space. J. Comput. Geom. 7(2): 19-45 (2016) - [j64]Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the Expected Complexity of Voronoi Diagrams on Terrains. ACM Trans. Algorithms 12(3): 37:1-37:20 (2016) - [j63]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms 13(1): 3:1-3:25 (2016) - [c99]Vijay V. S. P. Bhattiprolu, Sariel Har-Peled:
Separating a Voronoi Diagram via Local Search. SoCG 2016: 18:1-18:16 - [c98]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. PODS 2016: 371-383 - [c97]Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. SODA 2016: 548-557 - [c96]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the k-Level in Three-Dimensional Plane Arrangements. SODA 2016: 1193-1212 - [i55]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR abs/1601.04755 (2016) - [i54]Sariel Har-Peled, Kent Quanrud:
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. CoRR abs/1603.03098 (2016) - [i53]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. CoRR abs/1606.00112 (2016) - [i52]Sariel Har-Peled:
Computing the k Nearest-Neighbors for all Vertices via Dijkstra. CoRR abs/1607.07818 (2016) - [i51]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. CoRR abs/1609.08739 (2016) - 2015
- [j62]Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. Algorithmica 73(4): 673-695 (2015) - [j61]Sariel Har-Peled, Benjamin Raichel:
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams. Discret. Comput. Geom. 53(3): 547-568 (2015) - [j60]Sariel Har-Peled, Benjamin Raichel:
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems. J. ACM 62(6</