


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Haim Kaplan
Tel Aviv University, School of Computer Science
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 422 matches
- 2025
- 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. ITCS 2025: 39:1-39:23 - 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): 214-277 (2024) - Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA 2024: 7:1-7:20 - Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. ICALP 2024: 120:1-120:20 - Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. NeurIPS 2024 - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. SOSA 2024: 374-382 - Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305 - Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. CoRR abs/2403.07413 (2024) - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. CoRR abs/2403.16936 (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 abs/2405.15753 (2024) - Gilad Yehudai, Haim Kaplan, Asma Ghandeharioun, Mor Geva, Amir Globerson:
When Can Transformers Count to n? CoRR abs/2407.15160 (2024) - Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur:
On Differentially Private Linear Algebra. CoRR abs/2411.03087 (2024) - 2023
- Yaniv Sadeh
, Ori Rottenstreich
, Haim Kaplan:
Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. 20(4): 4283-4296 (2023) - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17 - Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA 2023: 67:1-67:14 - Daniel Agassy, Dani Dorfman, Haim Kaplan:
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player. ICALP 2023: 9:1-9:20 - Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma:
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP 2023: 19:1-19:20 - Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. ICML 2023: 33961-33982 - Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
Black-Box Differential Privacy for Interactive ML. NeurIPS 2023 - Haim Kaplan, David Naori, Danny Raz:
Almost Tight Bounds for Online Facility Location in the Random-Order Model. SODA 2023: 1523-1544 - Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS 2023: 53:1-53:21 - Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR abs/2301.03084 (2023) - Jay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri Stemmer:
Concurrent Shuffle Differential Privacy Under Continual Observation. CoRR abs/2301.12535 (2023) - Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer:
On Differentially Private Online Predictions. CoRR abs/2302.14099 (2023) - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal energetic paths for electric cars. CoRR abs/2305.19015 (2023) - Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR abs/2307.14663 (2023) - Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. CoRR abs/2310.14058 (2023) - 2022
- Avinatan Hassidim
, Haim Kaplan
, Yishay Mansour
, Yossi Matias
, Uri Stemmer
:
Adversarially Robust Streaming Algorithms via Differential Privacy. J. ACM 69(6): 42:1-42:14 (2022) - Haim Kaplan
, Yishay Mansour, Yossi Matias, Uri Stemmer:
Differentially Private Learning of Geometric Concepts. SIAM J. Comput. 51(4): 952-974 (2022)
skipping 392 more matches
loading more results
failed to load more results, please try again later

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-14 22:39 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint