Haim Kaplan

2025

Data Reconstruction: When You See It and When You Don’t

Cohen, E., Kaplan, H., Mansour, Y., Moran, S., Nissim, K., Stemmer, U. & Tsfadia, E., 11 Feb 2025, 16th Innovations in Theoretical Computer Science Conference, ITCS 2025. Meka, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 39. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 325).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2024

Caching Connections in Matchings

Sadeh, Y. & Kaplan, H., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 120. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Dynamic Connectivity in Disk Graphs

Baumann, A., Kaplan, H., Klost, K., Knorr, K., Mulzer, W., Roditty, L. & Seiferth, P., Jan 2024, In: Discrete and Computational Geometry. 71, 1, p. 214-277 64 p.

Research output: Contribution to journal › Article › peer-review

Open Access

Insertion-Only Dynamic Connectivity in General Disk Graphs

Kaplan, H., Klost, K., Knorr, K., Mulzer, W. & Roditty, L., 2024, 2024 Symposium on Simplicity in Algorithms, SOSA 2024. Parter, M. & Pettie, S. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 299-305 7 p. (2024 Symposium on Simplicity in Algorithms, SOSA 2024).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Minimum-cost paths for electric cars

Dorfman, D., Kaplan, H., Tarjan, R. E., Thorup, M. & Zwick, U., 2024, 2024 Symposium on Simplicity in Algorithms, SOSA 2024. Parter, M. & Pettie, S. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 374-382 9 p. (2024 Symposium on Simplicity in Algorithms, SOSA 2024).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments

Agarwal, P. K., Kaplan, H., Katz, M. J. & Sharir, M., Sep 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 308).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2023

Almost Tight Bounds for Online Facility Location in the Random-Order Model

Kaplan, H., Naori, D. & Raz, D., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. Association for Computing Machinery, p. 1523-1544 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Black-Box Differential Privacy for Interactive ML

Kaplan, H., Mansour, Y., Moran, S., Nissim, K. & Stemmer, U., 2023, Advances in Neural Information Processing Systems 36 - 37th Conference on Neural Information Processing Systems, NeurIPS 2023. Oh, A., Neumann, T., Globerson, A., Saenko, K., Hardt, M. & Levine, S. (eds.). Neural information processing systems foundation, (Advances in Neural Information Processing Systems; vol. 36).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Concurrent Shuffle Differential Privacy Under Continual Observation

Tenenbaum, J., Kaplan, H., Mansour, Y. & Stemmer, U., 2023, In: Proceedings of Machine Learning Research. 202, p. 33961-33982 22 p.

Research output: Contribution to journal › Conference article › peer-review

Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm

Sadeh, Y. & Kaplan, H., 1 Mar 2023, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. Berenbrink, P., Bouyer, P., Dawar, A. & Kante, M. M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 53. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 254).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player

Agassy, D., Dorfman, D. & Kaplan, H., Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Fast Approximation of Search Trees on Trees with Centroid Trees

Berendsohn, B. A., Golinsky, I., Kaplan, H. & Kozma, L., Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Load Balancing with Minimal Deviation in Switch Memories

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 1 Dec 2023, In: IEEE Transactions on Network and Service Management. 20, 4, p. 4283-4296 14 p., 3285749.

Research output: Contribution to journal › Article › peer-review

Optimal Energetic Paths for Electric Cars

Dorfman, D., Kaplan, H., Tarjan, R. E. & Zwick, U., Sep 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 42. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs

Kaplan, H., Katz, M. J., Saban, R. & Sharir, M., Sep 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 67. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

2022

Adversarially Robust Streaming Algorithms via Differential Privacy

Hassidim, A., Kaplan, H., Mansour, Y., Matias, Y. & Stemmer, U., 24 Nov 2022, In: Journal of the ACM. 69, 6, 42.

Research output: Contribution to journal › Article › peer-review

Open Access

5 Scopus citations

Coding Size of Traffic Partition in Switch Memories

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 2022, 2022 IEEE International Symposium on Information Theory, ISIT 2022. Institute of Electrical and Electronics Engineers Inc., p. 1590-1595 6 p. (IEEE International Symposium on Information Theory - Proceedings; vol. 2022-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Differentially Private Approximate Quantiles

Kaplan, H., Schnapp, S. & Stemmer, U., 2022, In: Proceedings of Machine Learning Research. 162, p. 10751-10761 11 p.

Research output: Contribution to journal › Conference article › peer-review

9 Scopus citations

DIFFERENTIALLY PRIVATE LEARNING OF GEOMETRIC CONCEPTS

Kaplan, H., Mansour, Y., Matias, Y. & Stemmer, U., 2022, In: SIAM Journal on Optimization. 32, 3, p. 952-974 23 p.

Research output: Contribution to journal › Article › peer-review

Open Access

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds

Beimel, A., Kaplan, H., Mansour, Y., Nissim, K., Saranurak, T. & Stemmer, U., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 1671-1684 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access

21 Scopus citations

Dynamic Connectivity in Disk Graphs

Kaplan, H., Kauer, A., Klost, K., Knorr, K., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

FriendlyCore: Practical Differentially Private Aggregation

Tsfadia, E., Cohen, E., Kaplan, H., Mansour, Y. & Stemmer, U., 2022, In: Proceedings of Machine Learning Research. 162, p. 21828-21863 36 p.

Research output: Contribution to journal › Conference article › peer-review

15 Scopus citations

Minimal Total Deviation in TCAM Load Balancing

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 2022, INFOCOM 2022 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., p. 450-459 10 p. (Proceedings - IEEE INFOCOM; vol. 2022-May).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Monotone Learning

Bousquet, O., Daniely, A., Kaplan, H., Mansour, Y., Moran, S. & Stemmer, U., 2022, In: Proceedings of Machine Learning Research. 178, p. 842-866 25 p.

Research output: Contribution to journal › Conference article › peer-review

7 Scopus citations

Online Weighted Matching with a Sample

Kaplan, H., Naori, D. & Raz, D., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1247-1272 26 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Optimal Weighted Load Balancing in TCAMs

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 1 Jun 2022, In: IEEE/ACM Transactions on Networking. 30, 3, p. 985-998 14 p.

Research output: Contribution to journal › Article › peer-review

Open Access

5 Scopus citations

Simulating a stack using queues

Kaplan, H., Tarjan, R. E., Zamir, O. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1901-1924 24 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

2021

Differentially-Private Clustering of Easy Instances

Cohen, E., Kaplan, H., Mansour, Y., Stemmer, U. & Tsfadia, E., 2021, Proceedings of the 38th International Conference on Machine Learning, ICML 2021. ML Research Press, p. 2049-2059 11 p. (Proceedings of Machine Learning Research; vol. 139).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Differentially Private Multi-Armed Bandits in the Shuffle Model

Tenenbaum, J., Kaplan, H., Mansour, Y. & Stemmer, U., 2021, Advances in Neural Information Processing Systems 34 - 35th Conference on Neural Information Processing Systems, NeurIPS 2021. Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P. S. & Wortman Vaughan, J. (eds.). Neural information processing systems foundation, p. 24956-24967 12 p. (Advances in Neural Information Processing Systems; vol. 30).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Dynamic Representations of Sparse Distributed Networks

Kaplan, H. & Solomon, S., Apr 2021, In: ACM Transactions on Parallel Computing. 8, 1, 3434395.

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

How Much TCAM do we Need for Splitting Traffic?

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 11 Oct 2021, SOSR 2021 - Proceedings of the 2021 ACM SIGCOMM Symposium on SDN Research. Association for Computing Machinery, Inc, p. 169-175 7 p. (SOSR 2021 - Proceedings of the 2021 ACM SIGCOMM Symposium on SDN Research).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Locality sensitive hashing for efficient similar polygon retrieval

Kaplan, H. & Tenenbaum, J., 1 Mar 2021, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Blaser, M. & Monmege, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 187).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Online Markov Decision Processes with Aggregate Bandit Feedback

Cohen, A., Kaplan, H., Koren, T. & Mansour, Y., 2021, In: Proceedings of Machine Learning Research. 134, p. 1301-1329 29 p.

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model

Kaplan, H., Mansour, Y., Nissim, K. & Stemmer, U., 2021, Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings. Malkin, T. & Peikert, C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 94-121 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12827 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

23 Scopus citations

Stabbing pairwise intersecting disks by five points

Har-Peled, S., Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M. & Willert, M., Jul 2021, In: Discrete Mathematics. 344, 7, 112403.

Research output: Contribution to journal › Article › peer-review

Open Access

9 Scopus citations

The Sparse Vector Technique, Revisited

Kaplan, H., Mansour, Y. & Stemmer, U., 2021, In: Proceedings of Machine Learning Research. 134, p. 2747-2776 30 p.

Research output: Contribution to journal › Conference article › peer-review

7 Scopus citations

Union of Hypercubes and 3D Minkowski Sums with Random Sizes

Agarwal, P. K., Kaplan, H. & Sharir, M., Jun 2021, In: Discrete and Computational Geometry. 65, 4, p. 1136-1165 30 p.

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n⁵/³) time

Gawrychowski, P., Kaplan, H., Mozes, S., Sharir, M. & Weimann, O., 2021, In: SIAM Journal on Computing. 50, 2, p. 509-554 46 p.

Research output: Contribution to journal › Article › peer-review

Open Access

19 Scopus citations

Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n⁵/³) time^∗

Gawrychowski, P. L., Kaplan, H., Mozes, S., Sharir, M. & Weimann, O., 2021, In: SIAM Journal on Computing. 50, 3, p. 509-554 46 p.

Research output: Contribution to journal › Article › peer-review

Open Access

2020

Adversarially robust streaming algorithms via differential privacy

Hassidim, A., Kaplan, H., Mansour, Y., Matias, Y. & Stemmer, U., 2020, In: Advances in Neural Information Processing Systems. 2020-December

Research output: Contribution to journal › Conference article › peer-review

41 Scopus citations

Apprenticeship learning via Frank-Wolfe

Zahavy, T., Cohen, A., Kaplan, H. & Mansour, Y., 2020, AAAI 2020 - 34th AAAI Conference on Artificial Intelligence. AAAI press, p. 6720-6728 9 p. (AAAI 2020 - 34th AAAI Conference on Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Clustering in Hypergraphs to Minimize Average Edge Service Time

Rottenstreich, O., Kaplan, H. & Hassidim, A., Jun 2020, In: ACM Transactions on Algorithms. 16, 3, 40.

Research output: Contribution to journal › Article › peer-review

Open Access

Competitive analysis with a sample and the secretary problem

Kaplan, H., Naori, D. & Raz, D., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2082-2095 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 Scopus citations

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location

Ezra, E., Har-Peled, S., Kaplan, H. & Sharir, M., 1 Jul 2020, In: Discrete and Computational Geometry. 64, 1, p. 109-173 65 p.

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications

Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., 1 Oct 2020, In: Discrete and Computational Geometry. 64, 3, p. 838-904 67 p.

Research output: Contribution to journal › Article › peer-review

Open Access

30 Scopus citations

How to find a point in the convex hull privately

Kaplan, H., Sharir, M. & Stemmer, U., 1 Jun 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-52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Locality sensitive hashing for set-queries, motivated by group recommendations

Kaplan, H. & Tenenbaum, J., 1 Jun 2020, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020. Albers, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 162).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Near-optimal regret bounds for stochastic shortest path

Cohen, A., Kaplan, H., Mansour, Y. & Rosenberg, A., 2020, 37th International Conference on Machine Learning, ICML 2020. Daume, H. & Singh, A. (eds.). International Machine Learning Society (IMLS), p. 8180-8189 10 p. (37th International Conference on Machine Learning, ICML 2020; vol. PartF168147-11).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Optimal approximations for traffic distribution in bounded switch memories

Sadeh, Y., Rottenstreich, O. & Kaplan, H., 23 Nov 2020, CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies. Association for Computing Machinery, Inc, p. 309-322 14 p. (CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Optimal Representations of a Traffic Distribution in Switch Memories

Sadeh, Y., Rottenstreich, O., Barkan, A., Kanizo, Y. & Kaplan, H., Apr 2020, In: IEEE/ACM Transactions on Networking. 28, 2, p. 930-943 14 p., 9032315.

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Haim Kaplan

Research output

Search results