Broadcasting with Many Faulty Links. - Rastislav Kralovic; Richard Královic; Peter Ruzicka (SIROCCO, 2003)

Time and space complexity of reversible pebbling. - Richard Královic (RAIRO Theor. Informatics Appl., 2004)

On Semi-perfect 1-Factorizations. - Rastislav Kralovic; Richard Královic (SIROCCO, 2005)

On Fractional Dynamic Faults with Threshold. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (SIROCCO, 2006)

Online Bandwidth Allocation. - Michal Forisek; Branislav Katreniak; Jana Katreniaková; Rastislav Kralovic; Richard Královic; Vladimír Koutný; Dana Pardubská; Tomas Plachetka; Branislav Rovan (ESA, 2007)

Efficient Algorithms for the Spoonerism Problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Kathleen Steinhöfel (FUN, 2007)

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. - Christos A. Kapoutsis; Richard Královic; Tobias Mömke (SAGA, 2007)

Deterministic Models of Communication Faults. - Rastislav Kralovic; Richard Královic (MFCS, 2008)

Reoptimization of Steiner Trees. - Davide Bilò; Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Widmayer; Anna Zych (SWAT, 2008)

On fractional dynamic faults with thresholds. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (Theor. Comput. Sci., 2008)

Infinite vs. Finite Space-Bounded Randomized Computations. - Richard Královic (CCC, 2009)

On the Advice Complexity of Online Problems. - Hans-Joachim Böckenhauer; Dennis Komm; Rastislav Královic; Richard Královic; Tobias Mömke (ISAAC, 2009)

Reoptimization of Steiner trees: Changing the terminal set. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Rossmanith (Theor. Comput. Sci., 2009)

Rapid almost-complete broadcasting in faulty networks. - Rastislav Kralovic; Richard Královic (Theor. Comput. Sci., 2009)

Information Complexity of Online Problems. - Juraj Hromkovic; Rastislav Královic; Richard Královic (MFCS, 2010)

Complexity Classes of Finite Automata. - Richard Královic (2010)

On the Power of Randomization for One-Way Finite Automata. - Richard Královic (NCMA, 2011)

Reoptimization of the Shortest Common Superstring Problem. - Davide Bilò; Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Tobias Mömke; Sebastian Seibert; Anna Zych (Algorithmica, 2011)

Advice Complexity and Barely Random Algorithms. - Dennis Komm; Richard Královic (RAIRO Theor. Informatics Appl., 2011)

On the Power of Randomness versus Advice in Online Computation. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Richard Královic; Peter Rossmanith (Languages Alive, 2012)

On the Advice Complexity of the Set Cover Problem. - Dennis Komm; Richard Královic; Tobias Mömke (CSR, 2012)

On the Advice Complexity of the Knapsack Problem. - Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Peter Rossmanith (LATIN, 2012)

Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). - Stefan Dobrev; Rastislav Královic; Richard Královic (WAOA, 2012)

Size complexity of rotating and sweeping automata. - Christos A. Kapoutsis; Richard Královic; Tobias Mömke (J. Comput. Syst. Sci., 2012)

Menej je niekedy viac: Mapreduce a Flume v paralelných výpočtoch. - Richard Královic (ITAT, 2013)

Computing with Advice: when Knowledge Helps. - Stefan Dobrev; Rastislav Královic; Richard Královic (Bull. EATCS, 2013)

Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. - Juraj Hromkovic; Rastislav Královic; Richard Královic; Richard Stefanec (Int. J. Found. Comput. Sci., 2013)

Randomized Online Algorithms with High Probability Guarantees. - Dennis Komm; Rastislav Královic; Richard Královic; Tobias Mömke (STACS, 2014)

Infinite vs. finite size-bounded randomized computations. - Richard Královic (J. Comput. Syst. Sci., 2014)

The online knapsack problem: Advice and randomization. - Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Peter Rossmanith (Theor. Comput. Sci., 2014)

Disjoint Path Allocation with Sublinear Advice. - Heidi Gebauer; Dennis Komm; Rastislav Královic; Richard Královic; Jasmin Smula (COCOON, 2015)

Treasure Hunt with Advice. - Dennis Komm; Rastislav Královic; Richard Královic; Jasmin Smula (SIROCCO, 2015)

Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. - Stefan Dobrev; Rastislav Královic; Richard Královic (Theory Comput. Syst., 2015)

Advice Complexity of the Online Induced Subgraph Problem. - Dennis Komm; Rastislav Královic; Richard Královic; Christian Kudahl (MFCS, 2016)

The Complexity of Paging Against a Probabilistic Adversary. - Stefan Dobrev; Juraj Hromkovic; Dennis Komm; Richard Královic; Rastislav Královic; Tobias Mömke (SOFSEM, 2016)

Online algorithms with advice: The tape model. - Hans-Joachim Böckenhauer; Dennis Komm; Rastislav Královic; Richard Královic; Tobias Mömke (Inf. Comput., 2017)

On the advice complexity of the k-server problem. - Hans-Joachim Böckenhauer; Dennis Komm; Rastislav Královic; Richard Královic (J. Comput. Syst. Sci., 2017)

Improved analysis of the online set cover problem with advice. - Stefan Dobrev; Jeff Edmonds; Dennis Komm; Rastislav Královic; Richard Královic; Sacha Krug; Tobias Mömke (Theor. Comput. Sci., 2017)

Determinism and Nondeterminism in Finite Automata with Advice. - Pavol Duris; Rafael Korbas; Rastislav Královic; Richard Královic (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Online Graph Coloring Against a Randomized Adversary. - Elisabet Burjons; Juraj Hromkovic; Rastislav Královic; Richard Královic; Xavier Muñoz; Walter Unger (Int. J. Found. Comput. Sci., 2018)

Randomization in Non-Uniform Finite Automata. - Pavol Duris; Rastislav Královic; Richard Královic; Dana Pardubská; Martin Pasen; Peter Rossmanith (MFCS, 2020)

Randomized Online Computation with High Probability Guarantees. - Dennis Komm; Rastislav Královic; Richard Královic; Tobias Mömke (Algorithmica, 2022)

Two-Way Non-Uniform Finite Automata. - Fabian Frei; Juraj Hromkovic; Rastislav Královic; Richard Královic (Int. J. Found. Comput. Sci., 2023)

Tree Coloring: Random Order and Predictions. - Fabian Frei; Matthias Gehnen; Dennis Komm; Rastislav Královic; Richard Královic; Peter Rossmanith; Moritz Stocker (CoRR, 2024)