1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DC2024★ 1 cited
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
Arash Pourdamghani, Chen Avin, Robert Sama +2
Distributed systems often serve dynamic workloads and resource demands evolve over time. Such a temporal behavior stands in contrast to the static and demand-oblivious nature of mo…
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…