Advice Complexity and Barely Random Algorithms
RAIRO-Theor. Inf. Appl., 45 2 (2011) 249-267
Published online: 2011-06-24
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The k-Server Problem with Advice in d Dimensions and on the Sphere
Elisabet Burjons, Dennis Komm and Marcel SchöngensAlgorithmica 81 (5) 1859 (2019)
https://doi.org/10.1007/s00453-018-0514-6
Online Minimum Spanning Tree with Advice
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm and Beatrice PalanoInternational Journal of Foundations of Computer Science 29 (04) 505 (2018)
https://doi.org/10.1142/S0129054118410034
Online Algorithms with Advice
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen and Jesper W. MikkelsenACM Computing Surveys 50 (2) 1 (2018)
https://doi.org/10.1145/3056461
Online Graph Coloring Against a Randomized Adversary
Elisabet Burjons, Juraj Hromkovič, Rastislav Královič, et al.International Journal of Foundations of Computer Science 29 (04) 551 (2018)
https://doi.org/10.1142/S0129054118410058
Online Bin Packing with Advice of Small Size
Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault and Adi RosénTheory of Computing Systems 62 (8) 2006 (2018)
https://doi.org/10.1007/s00224-018-9862-5
SOFSEM 2018: Theory and Practice of Computer Science
Elisabet Burjons, Dennis Komm and Marcel SchöngensLecture Notes in Computer Science, SOFSEM 2018: Theory and Practice of Computer Science 10706 396 (2018)
https://doi.org/10.1007/978-3-319-73117-9_28
Reordering buffer management with advice
Anna Adamaszek, Marc P. Renault, Adi Rosén and Rob van SteeJournal of Scheduling 20 (5) 423 (2017)
https://doi.org/10.1007/s10951-016-0487-8
Online algorithms with advice: The tape model
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič, Richard Královič and Tobias MömkeInformation and Computation 254 59 (2017)
https://doi.org/10.1016/j.ic.2017.03.001
Improved analysis of the online set cover problem with advice
Stefan Dobrev, Jeff Edmonds, Dennis Komm, et al.Theoretical Computer Science 689 96 (2017)
https://doi.org/10.1016/j.tcs.2017.05.029
On the advice complexity of the k-server problem
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič and Richard KrálovičJournal of Computer and System Sciences 86 159 (2017)
https://doi.org/10.1016/j.jcss.2017.01.001
On the list update problem with advice
Joan Boyar, Shahin Kamali, Kim S. Larsen and Alejandro López-OrtizInformation and Computation 253 411 (2017)
https://doi.org/10.1016/j.ic.2016.06.007
Online Algorithms with Advice: A Survey
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen and Jesper W. MikkelsenACM SIGACT News 47 (3) 93 (2016)
https://doi.org/10.1145/2993749.2993766
Combinatorial Algorithms
Jhoirene Clemente, Juraj Hromkovič, Dennis Komm and Christian KudahlLecture Notes in Computer Science, Combinatorial Algorithms 9843 203 (2016)
https://doi.org/10.1007/978-3-319-44543-4_16
SOFSEM 2016: Theory and Practice of Computer Science
Stefan Dobrev, Juraj Hromkovič, Dennis Komm, et al.Lecture Notes in Computer Science, SOFSEM 2016: Theory and Practice of Computer Science 9587 265 (2016)
https://doi.org/10.1007/978-3-662-49192-8_22
SOFSEM 2016: Theory and Practice of Computer Science
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm and Beatrice PalanoLecture Notes in Computer Science, SOFSEM 2016: Theory and Practice of Computer Science 9587 195 (2016)
https://doi.org/10.1007/978-3-662-49192-8_16
Online Bin Packing with Advice
Joan Boyar, Shahin Kamali, Kim S. Larsen and Alejandro López-OrtizAlgorithmica 74 (1) 507 (2016)
https://doi.org/10.1007/s00453-014-9955-8
Algorithms and Data Structures
Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault and Adi RosénLecture Notes in Computer Science, Algorithms and Data Structures 9214 40 (2015)
https://doi.org/10.1007/978-3-319-21840-3_4
Online multi-coloring with advice
Marie G. Christ, Lene M. Favrholdt and Kim S. LarsenTheoretical Computer Science 596 79 (2015)
https://doi.org/10.1016/j.tcs.2015.06.044
Computing and Combinatorics
Heidi Gebauer, Dennis Komm, Rastislav Královič, Richard Královič and Jasmin SmulaLecture Notes in Computer Science, Computing and Combinatorics 9198 417 (2015)
https://doi.org/10.1007/978-3-319-21398-9_33
SOFSEM 2015: Theory and Practice of Computer Science
Jérôme DohrauLecture Notes in Computer Science, SOFSEM 2015: Theory and Practice of Computer Science 8939 177 (2015)
https://doi.org/10.1007/978-3-662-46078-8_15
Approximation and Online Algorithms
Marie G. Christ, Lene M. Favrholdt and Kim S. LarsenLecture Notes in Computer Science, Approximation and Online Algorithms 8952 83 (2015)
https://doi.org/10.1007/978-3-319-18263-6_8
Online algorithms with advice for bin packing and scheduling problems
Marc P. Renault, Adi Rosén and Rob van SteeTheoretical Computer Science 600 155 (2015)
https://doi.org/10.1016/j.tcs.2015.07.050
SOFSEM 2014: Theory and Practice of Computer Science
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forišek, et al.Lecture Notes in Computer Science, SOFSEM 2014: Theory and Practice of Computer Science 8327 89 (2014)
https://doi.org/10.1007/978-3-319-04298-5_9
The online knapsack problem: Advice and randomization
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter RossmanithTheoretical Computer Science 527 61 (2014)
https://doi.org/10.1016/j.tcs.2014.01.027
Language and Automata Theory and Applications
Joan Boyar, Shahin Kamali, Kim S. Larsen and Alejandro López-OrtizLecture Notes in Computer Science, Language and Automata Theory and Applications 8370 210 (2014)
https://doi.org/10.1007/978-3-319-04921-2_17
Mathematical and Engineering Methods in Computer Science
David WehnerLecture Notes in Computer Science, Mathematical and Engineering Methods in Computer Science 8934 147 (2014)
https://doi.org/10.1007/978-3-319-14896-0_13
Approximation and Online Algorithms
Anna Adamaszek, Marc P. Renault, Adi Rosén and Rob van SteeLecture Notes in Computer Science, Approximation and Online Algorithms 8447 132 (2014)
https://doi.org/10.1007/978-3-319-08001-7_12
Computing with New Resources
Hans-Joachim Böckenhauer, Juraj Hromkovič and Dennis KommLecture Notes in Computer Science, Computing with New Resources 8808 264 (2014)
https://doi.org/10.1007/978-3-319-13350-8_20
Computer Science – Theory and Applications
Dennis Komm, Richard Královič and Tobias MömkeLecture Notes in Computer Science, Computer Science – Theory and Applications 7353 241 (2012)
https://doi.org/10.1007/978-3-642-30642-6_23
LATIN 2012: Theoretical Informatics
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter RossmanithLecture Notes in Computer Science, LATIN 2012: Theoretical Informatics 7256 61 (2012)
https://doi.org/10.1007/978-3-642-29344-3_6
Languages Alive
Hans-Joachim Böckenhauer, Juraj Hromkovič, Dennis Komm, Richard Královič and Peter RossmanithLecture Notes in Computer Science, Languages Alive 7300 30 (2012)
https://doi.org/10.1007/978-3-642-31644-9_2