Richard Královic

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 12

Top Topics

Finite Automata

Top Venues

J. Comput. Syst. Sci.

Theor. Comput. Sci.

Publications

Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker
Tree Coloring: Random Order and Predictions. CoRR (2024)
Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized Online Computation with High Probability Guarantees. Algorithmica 84 (5) (2022)
Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic
Two-Way Non-uniform Finite Automata. DLT (2021)
Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
Randomization in Non-Uniform Finite Automata. MFCS (2020)
Pavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic
Determinism and Nondeterminism in Finite Automata with Advice. Adventures Between Lower Bounds and Higher Altitudes (2018)
Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29 (4) (2018)
Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689 (2017)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Online algorithms with advice: The tape model. Inf. Comput. 254 (2017)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86 (2017)
Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM (2016)
Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
Advice Complexity of the Online Induced Subgraph Problem. MFCS (2016)
Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula
Treasure Hunt with Advice. SIROCCO (2015)
Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula
Disjoint Path Allocation with Sublinear Advice. COCOON (2015)
Stefan Dobrev, Rastislav Královic, Richard Královic
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. 56 (1) (2015)
Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
Advice Complexity of the Online Induced Subgraph Problem. CoRR (2015)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527 (2014)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized Online Algorithms with High Probability Guarantees. STACS (2014)
Richard Královic
Infinite vs. finite size-bounded randomized computations. J. Comput. Syst. Sci. 80 (4) (2014)
Stefan Dobrev, Rastislav Královic, Richard Královic
Computing with Advice: when Knowledge Helps. Bull. EATCS 110 (2013)
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. Int. J. Found. Comput. Sci. 24 (7) (2013)
Richard Královic
Menej je niekedy viac: Mapreduce a Flume v paralelných výpočtoch. ITAT (2013)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized online computation with high probability guarantees CoRR (2013)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78 (2) (2012)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
On the Power of Randomness versus Advice in Online Computation. Languages Alive (2012)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
On the Advice Complexity of the Knapsack Problem. LATIN (2012)
Dennis Komm, Richard Královic, Tobias Mömke
On the Advice Complexity of the Set Cover Problem. CSR (2012)
Stefan Dobrev, Rastislav Královic, Richard Královic
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA (2012)
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory (2012)
Dennis Komm, Richard Královic
Advice Complexity and Barely Random Algorithms. SOFSEM (2011)
Dennis Komm, Richard Královic
Advice Complexity and Barely Random Algorithms. RAIRO Theor. Informatics Appl. 45 (2) (2011)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
On the Advice Complexity of the k-Server Problem. ICALP (1) (2011)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61 (2) (2011)
Richard Královic
On the Power of Randomization for One-Way Finite Automata. NCMA (2011)
Juraj Hromkovic, Rastislav Královic, Richard Královic
Information Complexity of Online Problems. MFCS (2010)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. CPM (2009)
Rastislav Kralovic, Richard Královic
Rapid almost-complete broadcasting in faulty networks. Theor. Comput. Sci. 410 (14) (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410 (36) (2009)
Richard Královic
Infinite vs. Finite Space-Bounded Randomized Computations. Computational Complexity Conference (2009)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
On the Advice Complexity of Online Problems. ISAAC (2009)
Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro
On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399 (1-2) (2008)
Rastislav Kralovic, Richard Královic
Deterministic Models of Communication Faults. MFCS (2008)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory (2008)
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
Reoptimization of Steiner Trees. SWAT (2008)
Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation. ESA (2007)
Rastislav Kralovic, Richard Královic
Rapid Almost-Complete Broadcasting in Faulty Networks CoRR (2007)
Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation CoRR (2007)
Rastislav Kralovic, Richard Královic
Rapid Almost-Complete Broadcasting in Faulty Networks. SIROCCO (2007)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
Efficient Algorithms for the Spoonerism Problem. FUN (2007)
Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro
On Fractional Dynamic Faults with Threshold. SIROCCO (2006)
Rastislav Kralovic, Richard Královic
On Semi-perfect 1-Factorizations. SIROCCO (2005)
Richard Královic
Time and space complexity of reversible pebbling. RAIRO Theor. Informatics Appl. 38 (2) (2004)
Rastislav Kralovic, Richard Královic, Peter Ruzicka
Broadcasting with Many Faulty Links. SIROCCO (2003)
Richard Královic
Time and Space Complexity of Reversible Pebbling. SOFSEM (2001)