28 citations · 244 across the 83 of their papers we have counts for
Showing 2023 · cs.DSShow all
3 papers · 2 filters
cs.DS2023
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…
cs.DS2023★ 1 cited
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…
cs.DS2023
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
Yaniv Sadeh, Haim Kaplan
Binary search trees (BSTs) are one of the most basic and widely used data structures. The best static tree for serving a sequence of queries (searches) can be computed by dynamic p…