Rastislav Královic

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 19

Top Topics

Finite Automata

Connected Graphs

Independent Set

Top Venues

J. Comput. Syst. 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, Dana Pardubská
Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. 114 (2020)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Improved Lower Bounds for Shoreline Search. SIROCCO (2020)
Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
Randomization in Non-Uniform Finite Automata. MFCS (2020)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO (2020)
Brona Brejová, Rastislav Královic
A Linear-Time Algorithm for the Isometric Reconciliation of Unrooted Trees. Algorithms 13 (9) (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)
Stefan Dobrev, Rastislav Královic, Nicola Santoro
On the Cost of Waking Up. Int. J. Netw. Comput. 7 (2) (2017)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Treasure Hunt with Barely Communicating Agents. OPODIS (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)
Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak
Edge-Editing to a Dense and a Sparse Graph Class. LATIN (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)
Rastislav Královic
Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract). SOFSEM (2014)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized Online Algorithms with High Probability Guarantees. STACS (2014)
Stefan Dobrev, Rastislav Královic, Richard Královic
Computing with Advice: when Knowledge Helps. Bull. EATCS 110 (2013)
Brona Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar
Efficient routing in carrier-based mobile networks. Theor. Comput. Sci. 509 (2013)
Stefan Dobrev, Paola Flocchini, Rastislav Královic, Nicola Santoro
Exploring an unknown dangerous graph using tokens. Theor. Comput. Sci. 472 (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)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized online computation with high probability guarantees CoRR (2013)
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o
Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161 (10-11) (2013)
Stefan Dobrev, Rastislav Královic, Richard Královic
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA (2012)
Stefan Dobrev, Rastislav Královic, Euripides Markou
Online Graph Exploration with Advice. SIROCCO (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)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
On the Advice Complexity of the k-Server Problem. ICALP (1) (2011)
Bronislava Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar
Routing in Carrier-Based Mobile Networks. SIROCCO (2011)
Rastislav Královic, Stanislav Miklík
Periodic Data Retrieval Problem in Rings Containing a Malicious Host. SIROCCO (2010)
Juraj Hromkovic, Rastislav Královic, Richard Královic
Information Complexity of Online Problems. MFCS (2010)
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. 34 (2009)
Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská
Black Hole Search in Directed Graphs. SIROCCO (2009)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Measuring the problem-relevant information in input. RAIRO Theor. Informatics Appl. 43 (3) (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)