activity
20212026
most citedOptimal Weighted Load Balancing in TCAMs

9 citations · 9 across the 7 of their papers we have counts for

collaborators

8 papers

cs.DS2026

Dynamic Edge Coloring of Forests

Haim Kaplan, David Naori, Yaniv Sadeh

In the \emph{dynamic edge coloring} problem, one has to maintain a graph of maximum degree with at most colors, under edge updates. A prominent objective is to minimize t…

cs.DS2026

Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring

Yaniv Sadeh, Haim Kaplan

We study the maintenance of a -edge-coloring () in a fully dynamic graph with maximum degree . We focus on minimizing \emph{recourse} which equals the number…

cs.DS2025

Search Trees on Trees via LP

Yaniv Sadeh, Haim Kaplan, Uri Zwick

We consider the problem of computing optimal search trees on trees (STTs). STTs generalize binary search trees (BSTs) in which we search nodes in a path (linear order) to search tr…

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

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…

cs.NI2022

On Ranges and Partitions in Optimal TCAMs

Yaniv Sadeh

Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers, or by the source's access restrictions. The capacities of the serve…

cs.NI2022

Codes for Load Balancing in TCAMs: Size Analysis

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan

Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers, or by the source's access restrictions. The capacities of the serve…

cs.NI2021★ 9 cited

Optimal Weighted Load Balancing in TCAMs

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan

Traffic splitting is a required functionality in networks, for example for load balancing over multiple paths or among different servers. The capacities of the servers determine th…