Sariel Har-Peled

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • Conference contribution

    Active learning a convex body in low dimensions

    Har-Peled, S., Jones, M. & Rahul, S., Jun 1 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 64. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximate distance queries and compact routing in sparse graphs

    Agarwal, R., Godfrey, P. B. & Har-Peled, S., 2011, 2011 Proceedings IEEE INFOCOM. p. 1754-1762 9 p. 5934973. (Proceedings - IEEE INFOCOM).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximate nearest neighbor search for low dimensional queries

    Har-Peled, S. & Kumar, N., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 854-867 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • Approximate sparse linear regression

    Har-Peled, S., Indyk, P. & Mahabadi, S., Jul 1 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 77. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximating minimization diagrams and generalized proximity search

    Har-Peled, S. & Kumar, N., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 717-726 10 p. 6686208. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximating the a;-level in three-dimensional plane arrangements

    Har-Peled, S., Kaplan, H. & Sharir, M., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 1193-1212 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximating the Fréchet distance for realistic curves in near linear time

    Driemel, A., Har-Peled, S. & Wenk, C., 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 365-374 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximating the maximum overlap of polygons under translation

    Har-Peled, S. & Roy, S., 2014, Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer, p. 542-553 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8737 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximation algorithms for maximum independent set of pseudo-disks

    Chan, T. M. & Har-Peled, S., 2009, Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09. p. 333-340 8 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Approximation algorithms for Polynomial-Expansion and Low-Density graphs

    Har-Peled, S. & Quanrud, K., 2015, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Bansal, N. & Finocchi, I. (eds.). Springer, p. 717-728 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • A spanner for the day after

    Buchin, K., Har-Peled, S. & Oláh, D., Jun 1 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 129).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • A uniform convergence bound for the area under the ROC curve

    Agarwal, S., Har-Peled, S. & Roth, D., Dec 1 2005, AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics. p. 1-8 8 p. (AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Computing the Fréchet distance between folded polygons

    Cook IV, A. F., Driemel, A., Har-Peled, S., Sherette, J. & Wenk, C., 2011, Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. p. 267-278 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6844 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Computing the penetration depth of two convex polytopes in 3d

    Agarwal, P. K., Guibas, L. J., Har-Peled, S., Rabinovitch, A. & Sharir, M., Jan 1 2000, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Halldórsson, M. M. (ed.). Springer, p. 328-338 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1851).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Constraint classification for multiclass classification and ranking

    Har-Peled, S., Roth, D. & Zimak, D., 2003, Advances in Neural Information Processing Systems 15 - Proceedings of the 2002 Conference, NIPS 2002. Neural information processing systems foundation, (Advances in Neural Information Processing Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Convex hulls under uncertainty

    Agarwal, P. K., Har-Peled, S., Suri, S., YIldIz, H. & Zhang, W., 2014, Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer, p. 37-48 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8737 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Coresets for discrete integration and clustering

    Har-Peled, S., 2006, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - 26th International Conference, Proceedings. Arun-Kumar, . N. (ed.). Springer, p. 33-44 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4337 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Covering many or few points with unit disks

    De Berg, M., Cabello, S. & Har-Peled, S., 2007, Approximation and Online Algorithms - 4th International Workshop, WAOA 2006, Revised Papers. Springer, p. 55-68 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4368 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Edge estimation with independent set oracles

    Beame, P., Har-Peled, S., NatarajanRamamoorthy, S., Rashtchian, C. & Sinha, M., Jan 1 2018, 9th Innovations in Theoretical Computer Science, ITCS 2018. Karlin, A. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 94).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Embeddings of surfaces, curves, and moving points in euclidean space

    Agarwal, P. K., Har-Peled, S. & Yu, H., 2007, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07. p. 381-389 9 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Euclidean spanners in high dimensions

    Har-Peled, S., Indyk, P. & Sidiropoulos, A., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 804-809 6 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • Fast algorithms for geometric consensuses

    Har-Peled, S. & Jones, M., Jun 1 2020, 36th International Symposium on Computational Geometry, SoCG 2020. Cabello, S. & Chen, D. Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-SoCG-2020-50. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Fast LP-based approximations for geometric packing and covering problems

    Chekuri, C., Har-Peled, S. & Quanrud, K., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1019-1038 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Fréchet distance for curves, revisited

    Aronov, B., Har-Peled, S., Knauer, C., Wang, Y. & Wenk, C., 2006, Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. Springer, p. 52-63 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4168 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • From Proximity to Utility: A Voronoi Partition of Pareto Optima

    Chang, H. C., Har-Peled, S. & Raichel, B., Jun 1 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J., Pach, J. & Arge, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 689-703 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Geometric packing under non-uniform constraints

    Ene, A., Har-Peled, S. & Raichel, B., Jul 23 2012, Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. p. 11-20 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Grid peeling and the affine curve-shortening flow

    Eppstein, D., Har-Peled, S. & Nivasch, G., 2018, 2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018. Pagh, R. & Venkatasubramanian, S. (eds.). Society for Industrial and Applied Mathematics Publications, p. 109-116 8 p. (Proceedings of the Workshop on Algorithm Engineering and Experiments; vol. 2018-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Guarding galleries and terrains

    Efrat, A. & Har-Peled, S., 2002, Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002). Springer, p. 181-192 12 p. (IFIP Advances in Information and Communication Technology; vol. 96).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • How to get close to the median shape

    Har-Peled, S., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 402-410 9 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • How to walk your dog in the mountains with no magic leash

    Har-Peled, S., Nayyeri, A., Sidiropoulos, A. & Salavatipour, M., 2012, Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. p. 121-130 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Improved approximation algorithms for Tverberg partitions

    Har-Peled, S. & Zhou, T., Sep 1 2021, 29th Annual European Symposium on Algorithms, ESA 2021. Mutzel, P., Pagh, R. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 204).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Jaywalking your dog - Computing the Fréchet distance with shortcuts

    Driemel, A. & Har-Peled, S., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 318-337 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Journey to the center of the point set

    Har-Peled, S. & Jones, M., Jun 1 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 129).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Minimum convex partitions and maximum empty polytopes

    Dumitrescu, A., Har-Peled, S. & Tóth, C. D., 2012, Algorithm Theory, SWAT 2012 - 13th Scandinavian Symposium and Workshops, Proceedings. p. 213-224 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7357 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Morphing between polylines

    Efrat, A., Har-Peled, S., Guibas, L. J. & Murali, T. M., Dec 1 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 680-689 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Nearest neighbor searching under uncertainty II

    Agarwal, P. K., Aronov, B., Har-Peled, S., Phillips, J. M., Yi, K. & Zhang, W., 2013, PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems. p. 115-126 12 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Near-linear time approximation algorithms for curve simplification

    Agarwal, P. K., Har-Peled, S., Mustafa, N. H. & Wang, Y., 2002, Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Möhring, R. & Raman, R. (eds.). Springer, p. 29-41 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2461).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Net and prune: A linear time algorithm for euclidean distance problems

    Har-Peled, S. & Raichel, B., Jul 11 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 605-614 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • New constructions of SSPDs and their applications

    Abam, M. A. & Har-Peled, S., 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 192-200 9 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On approximate halfspace range counting and relative epsilon-approximations

    Aronov, B., Har-Peled, S. & Sharir, M., 2007, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07. p. 327-336 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Online point location in planar arrangements and its applications

    Har-Peled, S. & Sharir, M., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 57-66 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On-line zone construction in arrangements of lines in the plane

    Aharoni, Y., Halperin, D., Hanniel, I., Har-Peled, S. & Linhart, C., Jan 1 1999, Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings. Vitter, J. S. & Zaroliagis, C. D. (eds.). Springer, 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1668).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On locality-sensitive orderings and their applications

    Chan, T. M., Har-Peled, S. & Jones, M., Jan 1 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On separating points by lines

    Har-Peled, S. & Jones, M., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 918-932 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On the complexity of randomly weighted Voronoi diagrams

    Har-Peled, S. & Raichel, B., 2014, Proceedings of the 30th Annual Symposium on Computational Geometry, SoCG 2014. Association for Computing Machinery, p. 232-241 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On the expected complexity of Voronoi diagrams on terrains

    Driemel, A., Har-Peled, S. & Raichel, B., 2012, Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012. p. 101-110 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On the number of edges of fan-crossing free graphs

    Cheong, O., Har-Peled, S., Kim, H. & Kim, H. S., 2013, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. p. 163-173 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8283 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On the set multi-cover problem in geometric settings

    Chekuri, C. S., Clarkson, K. L. & Har-Peled, S., Dec 4 2009, Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09. p. 341-350 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On undecided LP, clustering and active learning

    Ashur, S. & Har-Peled, S., Jun 1 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 189).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Proximity in the age of distraction: Robust approximate nearest neighbor search

    Har-Peled, S. & Mahabadi, S., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1-15 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access