1 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023★ 1 cited
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree
Arash Pourdamghani, Chen Avin, Robert Sama +1
We consider the fundamental problem of designing a self-adjusting tree, which efficiently and locally adapts itself towards the demand it serves (namely accesses to the items store…
cs.DS2022
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem +3
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications…