Haim Kaplan

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 162

Top Venues

CoRR

SODA

ESA

Discret. Comput. Geom.

Publications

Yaniv Sadeh, Haim Kaplan
Caching Connections in Matchings. ICALP (2024)
Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
Data Reconstruction: When You See It and When You Don't. CoRR (2024)
Gilad Yehudai, Haim Kaplan, Asma Ghandeharioun, Mor Geva, Amir Globerson
When Can Transformers Count to n? CoRR (2024)
Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. SOSA (2024)
Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71 (1) (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. CoRR (2024)
Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran
Learning-Augmented Algorithms with Explicit Predictors. CoRR (2024)
Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer
On Differentially Private Online Predictions. CoRR (2023)
Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR (2023)
Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer
Black-Box Differential Privacy for Interactive ML. NeurIPS (2023)
Yaniv Sadeh, Haim Kaplan
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal Energetic Paths for Electric Cars. ESA (2023)
Yaniv Sadeh, Haim Kaplan
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR (2023)
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP (2023)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. 20 (4) (2023)
Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR (2023)
Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
Concurrent Shuffle Differential Privacy Under Continual Observation. ICML (2023)
Daniel Agassy, Dani Dorfman, Haim Kaplan
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP (2023)
Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR (2023)
Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal energetic paths for electric cars. CoRR (2023)
Haim Kaplan, David Naori, Danny Raz
Almost Tight Bounds for Online Facility Location in the Random-Order Model. SODA (2023)
Yaniv Sadeh, Haim Kaplan
Caching Connections in Matchings. CoRR (2023)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Minimal Total Deviation in TCAM Load Balancing. INFOCOM (2022)
Olivier Bousquet, Haim Kaplan, Aryeh Kontorovich, Yishay Mansour, Shay Moran, Menachem Sadigurschi, Uri Stemmer
Differentially-Private Bayes Consistency. CoRR (2022)
Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer
Monotone Learning. COLT (2022)
Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
Simulating a stack using queues. SODA (2022)
Daniel Agassy, Dani Dorfman, Haim Kaplan
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. CoRR (2022)
Olivier Bousquet, Amit Daniely, Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer
Monotone Learning. CoRR (2022)
Haim Kaplan, David Naori, Danny Raz
Online Weighted Matching with a Sample. SODA (2022)
Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
Differentially Private Learning of Geometric Concepts. SIAM J. Comput. 51 (4) (2022)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC (2022)
Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
Adversarially Robust Streaming Algorithms via Differential Privacy. J. ACM 69 (6) (2022)
Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
FriendlyCore: Practical Differentially Private Aggregation. ICML (2022)
Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. SoCG (2022)
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
Fast approximation of search trees on trees with centroid trees. CoRR (2022)
Haim Kaplan, Shachar Schnapp, Uri Stemmer
Differentially Private Approximate Quantiles. ICML (2022)
Haim Kaplan, David Naori, Danny Raz
Almost Tight Bounds for Online Facility Location in the Random-Order Model. CoRR (2022)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Optimal Weighted Load Balancing in TCAMs. IEEE/ACM Trans. Netw. 30 (3) (2022)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Coding Size of Traffic Partition in Switch Memories. ISIT (2022)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Codes for Load Balancing in TCAMs: Size Analysis. CoRR (2022)
Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. CRYPTO (3) (2021)
Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour
Online Markov Decision Processes with Aggregate Bandit Feedback. CoRR (2021)
Haim Kaplan, Yishay Mansour, Uri Stemmer
The Sparse Vector Technique, Revisited. COLT (2021)
Haim Kaplan, Uri Stemmer
A Note on Sanitizing Streams with Differential Privacy. CoRR (2021)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR (2021)
Haim Kaplan, Shachar Schnapp, Uri Stemmer
Differentially Private Approximate Quantiles. CoRR (2021)
Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer
Separating Adaptive Streaming from Oblivious Streaming. CoRR (2021)
Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
Differentially Private Multi-Armed Bandits in the Shuffle Model. NeurIPS (2021)
Haim Kaplan, David Naori, Danny Raz
Online Weighted Bipartite Matching with a Sample. CoRR (2021)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
How Much TCAM do we Need for Splitting Traffic? SOSR (2021)
Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour
Online Markov Decision Processes with Aggregate Bandit Feedback. COLT (2021)
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Discret. Comput. Geom. 65 (4) (2021)
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. STACS (2021)
Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
FriendlyCore: Practical Differentially Private Aggregation. CoRR (2021)
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. CoRR (2021)
Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Dynamic Connectivity in Disk Graphs. CoRR (2021)
Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
Differentially-Private Clustering of Easy Instances. CoRR (2021)
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) (2021)
Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer
Differentially Private Multi-Armed Bandits in the Shuffle Model. CoRR (2021)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Optimal Weighted Load Balancing in TCAMs. CoRR (2021)
Haim Kaplan, Shay Solomon
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. ACM Trans. Parallel Comput. 8 (1) (2021)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) Time. SIAM J. Comput. 50 (2) (2021)
Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
Differentially-Private Clustering of Easy Instances. ICML (2021)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82 (5) (2020)
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. SWAT (2020)
Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir
On Radial Isotropic Position: Theory and Algorithms. CoRR (2020)
Yuval Lewi, Haim Kaplan, Yishay Mansour
Thompson Sampling for Adversarial Bit Prediction. ALT (2020)
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64 (3) (2020)
Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
Adversarially Robust Streaming Algorithms via Differential Privacy. NeurIPS (2020)
Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
Unknown mixing times in apprenticeship and reinforcement learning. UAI (2020)
Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
Adversarially Robust Streaming Algorithms via Differential Privacy. CoRR (2020)
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) (2020)
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Optimal approximations for traffic distribution in bounded switch memories. CoNEXT (2020)
Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS (2020)
Dror Aiger, Haim Kaplan, Micha Sharir
Output sensitive algorithms for approximate incidences and their applications. CoRR (2020)
Gal Sadeh, Edith Cohen, Haim Kaplan
Sample Complexity Bounds for Influence Maximization. ITCS (2020)
Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan
Optimal Representations of a Traffic Distribution in Switch Memories. IEEE/ACM Trans. Netw. 28 (2) (2020)
Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. ALT (2020)
Haim Kaplan, Micha Sharir, Uri Stemmer
How to Find a Point in the Convex Hull Privately. SoCG (2020)
Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour
Apprenticeship Learning via Frank-Wolfe. AAAI (2020)
Dror Aiger, Haim Kaplan, Micha Sharir
Duality-based approximation algorithms for depth queries and maximum depth. CoRR (2020)
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
Privately Learning Thresholds: Closing the Exponential Gap. COLT (2020)
Haim Kaplan, Micha Sharir, Uri Stemmer
How to Find a Point in the Convex Hull Privately. CoRR (2020)
Dror Aiger, Haim Kaplan, Micha Sharir
Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. 91 (2020)
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. CoRR (2020)
Alon Cohen, Haim Kaplan, Yishay Mansour, Aviv Rosenberg
Near-optimal Regret Bounds for Stochastic Shortest Path. CoRR (2020)
Haim Kaplan, David Naori, Danny Raz
Competitive Analysis with a Sample and the Secretary Problem. SODA (2020)
Aviv Rosenberg, Alon Cohen, Yishay Mansour, Haim Kaplan
Near-optimal Regret Bounds for Stochastic Shortest Path. ICML (2020)
Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR (2020)
Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16 (3) (2020)
Haim Kaplan, Yishay Mansour, Uri Stemmer
The Sparse Vector Technique, Revisited. CoRR (2020)
Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR (2019)
Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer
Differentially Private Learning of Geometric Concepts. ICML (2019)
Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA (2019)
Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran
Learning and Generalization for Matching Problems. CoRR (2019)
Yuval Lewi, Haim Kaplan, Yishay Mansour
Thompson Sampling for Adversarial Bit Prediction. CoRR (2019)
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
Privately Learning Thresholds: Closing the Exponential Gap. CoRR (2019)
Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. CoRR (2019)

Haim Kaplan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Haim Kaplan