Online algorithms with advice: the tape model
type: Item
instance of: scholarly article
title: Online algorithms with advice: the tape model
zbMATH Open document ID: 1370.68334
author: Hans-Joachim Böckenhauer
author: Dennis Komm
author: Rastislav Královič
author: Richard Královič
author: Tobias Mömke
published in: Information and Computation
publication date: 2017-05-18T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6720010
zbMATH Keywords: advice complexity
zbMATH Keywords: online computation
zbMATH Keywords: competitive analysis
zbMATH Keywords: paging
zbMATH Keywords: disjoint path allocation
zbMATH Keywords: job shop scheduling
MaRDI profile type: Publication
full work available at URL: j.ic.2017.03.001
OpenAlex ID: W2595319805
cites work: Online makespan minimization with parallel schedules
cites work: On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
cites work: Q4223058
cites work: Competitive paging with locality of reference
cites work: Q2954988
cites work: On the Advice Complexity of Online Problems
cites work: On the Advice Complexity of the k-Server Problem
cites work: On the advice complexity of the \(k\)-server problem
cites work: An efficient algorithm for the job-shop problem with two jobs
cites work: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
cites work: How Much Information about the Future Is Needed?
cites work: Online computation with advice
cites work: Competitive paging algorithms
cites work: Disjoint Path Allocation with Sublinear Advice
cites work: On Advice Complexity of the k-server Problem under Sparse Metrics
cites work: Information Complexity of Online Problems
cites work: Q5755525
cites work: Competitive snoopy caching
cites work: Semi on-line algorithms for the partition problem
cites work: Advice Complexity and Barely Random Algorithms
cites work: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
cites work: On online algorithms with advice for the \(k\)-server problem
DOI: 10.1016/J.IC.2017.03.001
description: scientific article; zbMATH DE number 6720010