Self-adjusting linear networks
type: Item
instance of: scholarly article
title: Self-adjusting linear networks
zbMATH Open document ID: 1543.68021
DOI: 10.1007/978-3-030-34992-9_29
author: Chen Avin
author: Ingo van Duijn
author: Stefan Schmid
publication date: 2024-04-19T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7835020
zbMATH Keywords: self-adjusting data structures
zbMATH Keywords: competitive analysis
zbMATH Keywords: distributed algorithms
zbMATH Keywords: communication networks
MaRDI profile type: MaRDI publication profile
cites work: A competitive analysis of the list update problem with lookahead
cites work: Improved Randomized On-Line Algorithms for the List Update Problem
cites work: A combined BIT and TIMESTAMP algorithm for the list update problem
cites work: Q2753921
cites work: Online balanced repartitioning
cites work: Regret analysis of stochastic and nonstochastic multi-armed bandit problems
cites work: Off-line algorithms for the list update problem
cites work: Randomized competitive algorithms for the list update problem
cites work: A lower bound for randomized list update algorithms
Recommended article: Self-adjusting linear networks
Recommended article: Dynamically optimal self-adjusting single-source tree networks
Recommended article: Self-adjusting grid networks to minimize expected path length
Recommended article: Analysis and experimentation on list update algorithms
description: scientific article; zbMATH DE number 7835020