Toward Self-Adjusting Networks for the Matching Model. - Evgeniy Feder; Ichha Rathod; Punit Shyamsukha; Robert Sama; Vitaly Aksenov; Iosif Salem; Stefan Schmid 001 (SPAA, 2021)

Deterministic Self-Adjusting Tree Networks Using Rotor Walks. - Chen Avin; Marcin Bienkowski; Iosif Salem; Robert Sama; Stefan Schmid 001; Pawel Schmidt (ICDCS, 2022)

Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. - Evgeniy Feder; Ichha Rathod; Punit Shyamsukha; Robert Sama; Vitaly Aksenov; Iosif Salem; Stefan Schmid 001 (INFOCOM, 2022)

SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. - Arash Pourdamghani; Chen Avin; Robert Sama; Stefan Schmid 001 (INFOCOM, 2023)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing. - Arash Pourdamghani; Chen Avin; Robert Sama; Maryam Shiran; Stefan Schmid 001 (OPODIS, 2024)

Hash-And-Adjust. - Arash Pourdamghani; Chen Avin; Robert Sama; Maryam Shiran; Stefan Schmid 001 (DROPS Artifacts, 2025)