Advice Complexity of the Online Search Problem

DOI10.1007/978-3-319-44543-4_16zbMath1478.68452arXiv1612.09299OpenAlexW2521648624MaRDI QIDQ2819505

Jhoirene Clemente, Juraj Hromkovič, Christian Kudahl, Dennis Komm

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.09299

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Financial applications of other theories (91G80) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Online two-way trading: randomization and advice ⋮ Optimal online two-way trading with bounded number of transactions ⋮ Weighted Online Problems with Advice

Cites Work

• Unnamed Item
• Unnamed Item
• Online computation with advice
• Optimal algorithms for the online time series search problem
• The string guessing problem as a method to prove lower bounds on the advice complexity
• Optimal algorithms for \(k\)-search with application in option pricing
• The online knapsack problem: advice and randomization
• On Advice Complexity of the k-server Problem under Sparse Metrics
• On Online Algorithms with Advice for the k-Server Problem
• A Comparison of Performance Measures via Online Search
• On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
• On the Advice Complexity of the k-Server Problem
• Information Complexity of Online Problems
• On the Advice Complexity of Online Problems
• Advice Complexity and Barely Random Algorithms
• How Much Information about the Future Is Needed?
• Optimal search and one-way trading online algorithms

This page was built for publication: Advice Complexity of the Online Search Problem