Self-adjusting grid networks

DOI10.1016/j.ic.2023.105038MaRDI QIDQ6044463

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

Publication date: 19 May 2023

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A lower bound for randomized list update algorithms
• A competitive analysis of the list update problem with lookahead
• Randomized competitive algorithms for the list update problem
• Off-line algorithms for the list update problem
• Online balanced repartitioning
• Self-adjusting linear networks
• Self-adjusting Grid Networks to Minimize Expected Path Length
• Improved Randomized On-Line Algorithms for the List Update Problem
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

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