Sariel Har-Peled

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

Search results

  • 1999

    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

  • 2000

    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

  • 2001

    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

  • 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

  • Reporting intersecting pairs of polytopes in two and three dimensions

    Agarwal, P. K., de Berg, M., Har-Peled, S., Overmars, M. H., Sharir, M. & Vahrenhold, J., 2001, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Dehne, F., Sack, J-R. & Tamassia, R. (eds.). Springer, p. 122-134 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2125).

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

  • 2002

    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
  • 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

  • Star-tree: An efficient self-adjusting index for moving objects

    Procopiuc, C. M., Agarwal, P. K. & Har-Peled, S., 2002, Algorithm Engineering and Experiments: 4th InternationalWorkshop, ALENEX 2002, Revised Papers. Mount, D. M. & Stein, C. (eds.). Springer, p. 178-193 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2409).

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

  • 2003

    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

  • 2005

    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

  • Separability with outliers

    Har-Peled, S. & Koltun, V., Dec 1 2005, Algorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3827 LNCS).

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

  • 2006

    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

  • 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

  • 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

  • The orienteering problem in the plane revisited

    Chen, K. & Har-Peled, S., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 247-253 7 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

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

  • 2007

    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

  • 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

  • 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

  • 2008

    Range medians

    Har-Peled, S. & Muthukrishnan, S., 2008, Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Springer, p. 503-514 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5193 LNCS).

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

  • 2009

    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

  • 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

  • 2010

    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

  • 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

  • 2011

    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
  • 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

  • The fréchet distance revisited and extended

    Har-Peled, S. & Raichel, B., 2011, Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11. p. 448-457 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

  • 2012

    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

  • 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

  • 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

  • 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

  • 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

  • 2013

    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

  • 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
  • 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

  • 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

  • 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

  • 2014

    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

  • 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

  • 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

  • Quasi-polynomial time approximation scheme for sparse subsets of polygons

    Har-Peled, S., 2014, Proceedings of the 30th Annual Symposium on Computational Geometry, SoCG 2014. Association for Computing Machinery, p. 120-129 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

  • Robust proximity search for balls using sublinear space

    Har-Peled, S. & Kumar, N., Dec 1 2014, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. Raman, V. & Suresh, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 315-326 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 29).

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

  • 2015

    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

  • 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

  • Shortest Path in a Polygon using Sublinear Space

    Har-Peled, S., 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. 111-125 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

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

  • Space Exploration via Proximity Search

    Har-Peled, S., Kumar, N., Mount, D. M. & 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. 374-389 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

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

  • 2016

    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

  • Separating a voronoi diagram via local search

    Bhattiprolu, V. V. S. P. & Har-Peled, S., Jun 1 2016, 32nd International Symposium on Computational Geometry, SoCG 2016. Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 18.1-18.16 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 51).

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

  • Sparse approximation via generating point sets

    Blum, A., Har-Peled, S. & Raichel, B., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 548-557 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 1).

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

  • Towards tight bounds for the streaming set cover problem

    Har-Peled, S., Indyk, P., Mahabadi, S. & Vakilian, A., Jun 15 2016, PODS 2016 - Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 371-383 13 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; vol. 26-June-01-July-2016).

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