Get started
Keyword

advice complexity

Description: Advice complexity is a measure in computational complexity theory of the amount of auxiliary information needed to solve a computational problem.
OpenAlex ID: keywords/advice-complexity
Advice classes of parameterized tractability
1997 · Liming Cai, Jianer Chen, et al. · Annals of Pure and Applied Logic · 192
PDF
Online computation with advice
2010 · Yuval Emek, Pierre Fraigniaud, et al. · Theoretical Computer Science · 146
On the Advice Complexity of Online Problems
2009 · Hans-Joachim Böckenhauer, Dennis Komm, et al. · Lecture notes in computer science · 120
On the Advice Complexity of the k-Server Problem
2011 · Hans-Joachim Böckenhauer, Dennis Komm, et al. · Lecture notes in computer science · 83
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
2010 · Anindya De, Luca Trevisan, et al. · Lecture notes in computer science · 80
List-decoding using the XOR lemma
2004 · L. Trevisan · Annual Symposium on Foundations of Computer Science · 78
Measuring the problem-relevant information in input
2009 · Stefan Dobrev, Rastislav Královič, et al. · RAIRO - Theoretical Informatics and Applications · 72
Multi-collision resistance: a paradigm for keyless hash functions
2018 · Nir Bitansky, Yael Tauman Kalai, et al. · ACM SIGACT Symposium on Theory of Computing (STOC) · 67
Online Algorithms with Advice
2017 · Joan Boyar, Lene M. Favrholdt, et al. · ACM Computing Surveys · 66
Tree exploration with advice
2008 · Pierre Fraigniaud, David Ilcinkas, et al. · Information and Computation · 65
PDF
An Introduction to Online Computation
2016 · Dennis Komm · Texts in theoretical computer science · 62
Distributed computing with advice: information sensitivity of graph coloring
2009 · Pierre Fraigniaud, Cyril Gavoille, et al. · Distributed Computing · 61
Graph searching with advice
2008 · Nicolas Nisse, David Soguet · Theoretical Computer Science · 58
PDF
How Much Information about the Future Is Needed?
2008 · Stefan Dobrev, Rastislav Královič, et al. · Springer eBooks · 57
Communication algorithms with advice
2009 · Pierre Fraigniaud, David Ilcinkas, et al. · Journal of Computer and System Sciences · 56
PDF
Advice Complexity and Barely Random Algorithms
2011 · Dennis Komm, Richard Královič · RAIRO - Theoretical Informatics and Applications · 54
PDF
Local MST Computation with Short Advice
2010 · Pierre Fraigniaud, Amos Korman, et al. · Theory of Computing Systems · 54
Fast radio broadcasting with advice
2010 · David Ilcinkas, Dariusz R. Kowalski, et al. · Theoretical Computer Science · 53
PDF
Online Bin Packing with Advice
2014 · Joan Boyar, Shahin Kamali, et al. · Algorithmica · 52
The online knapsack problem: Advice and randomization
2014 · Hans-Joachim Böckenhauer, Dennis Komm, et al. · Theoretical Computer Science · 52
Online Algorithms with Advice: A Survey
2016 · Joan Boyar, Lene M. Favrholdt, et al. · ACM SIGACT News · 51
Semi-online scheduling revisited
2012 · Susanne Albers, Matthias Hellwig · Theoretical Computer Science · 50
PDF
Online Graph Exploration with Advice
2012 · Stefan Dobrev, Rastislav Královič, et al. · Lecture notes in computer science · 50
Drawing maps with advice
2011 · Dariusz Dereniowski, Andrzej Pelc · Journal of Parallel and Distributed Computing · 50
The string guessing problem as a method to prove lower bounds on the advice complexity
2014 · Hans-Joachim Böckenhauer, Juraj Hromkovič, et al. · Theoretical Computer Science · 48
PDF
Works count: 388
Citation count: 3,845
Year
Topic
Type