Self-adjusting grid networks

DOI10.1016/J.IC.2023.105038MaRDI QIDQ6044463zbMATH OpenFDO

Authors Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid

Publication date 19 May 2023

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2023.105038

zbMATH Keywords

communication networkscompetitive analysisdistributed algorithmsself-\(\ast\)self-adjusting data structuresself-adjusting networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A combined BIT and TIMESTAMP algorithm for the list update problem
• A competitive analysis of the list update problem with lookahead
• A lower bound for randomized list update algorithms
• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• Improved Randomized On-Line Algorithms for the List Update Problem
• Off-line algorithms for the list update problem
• Online balanced repartitioning
• Randomized competitive algorithms for the list update problem
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Self-adjusting grid networks to minimize expected path length
• Self-adjusting linear networks

This page was built for publication: Self-adjusting grid networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6044463)