28 citations · 244 across the 83 of their papers we have counts for
7 papers · 1 filter
Caching Connections in Matchings
Yaniv Sadeh, Haim Kaplan
Motivated by the desire to utilize a limited number of configurable optical switches by recent advances in Software Defined Networks (SDNs), we define an online problem which we ca…
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
Haim Kaplan, Matthew J. Katz, Rachel Saban +1
We study the reverse shortest path problem on disk graphs in the plane. In this problem we consider the proximity graph of a set of disks in the plane of arbitrary radii: In th…
Insertion-Only Dynamic Connectivity in General Disk Graphs
Haim Kaplan, Katharina Klost, Kristin Knorr +2
Let be a set of \emph{sites} in the plane, so that every site has an \emph{associated radius} . Let be the \emph{disk inter…
Optimal energetic paths for electric cars
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +1
A weighted directed graph , where and , describes a road network in which an electric car can roam. An arc models a road segment co…
On Differentially Private Online Predictions
Haim Kaplan, Yishay Mansour, Shay Moran +2
In this work we introduce an interactive variant of joint differential privacy towards handling online processes in which existing privacy definitions seem too restrictive. We stud…
Concurrent Shuffle Differential Privacy Under Continual Observation
Jay Tenenbaum, Haim Kaplan, Yishay Mansour +1
We introduce the concurrent shuffle model of differential privacy. In this model we have multiple concurrent shufflers permuting messages from different, possibly overlapping, batc…