Richard Královic

According to our database, Richard Královic authored at least 43 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Two-Way Non-Uniform Finite Automata.

Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic

Int. J. Found. Comput. Sci., 2023

2022

Randomized Online Computation with High Probability Guarantees.

Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke

Algorithmica, 2022

2020

Randomization in Non-Uniform Finite Automata.

Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

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

Determinism and Nondeterminism in Finite Automata with Advice.

Pavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

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

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

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

2016

The Complexity of Paging Against a Probabilistic Adversary.

Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Advice Complexity of the Online Induced Subgraph Problem.

Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs.

Stefan Dobrev, Rastislav Královic, Richard Královic

Theory Comput. Syst., 2015

Treasure Hunt with Advice.

Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula

Proceedings of the Structural Information and Communication Complexity, 2015

Disjoint Path Allocation with Sublinear Advice.

Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

The online knapsack problem: Advice and randomization.

Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith

Theor. Comput. Sci., 2014

Infinite vs. finite size-bounded randomized computations.

Richard Královic

J. Comput. Syst. Sci., 2014

Randomized Online Algorithms with High Probability Guarantees.

Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

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

Computing with Advice: when Knowledge Helps.

Stefan Dobrev, Rastislav Královic, Richard Královic

Bull. EATCS, 2013

Menej je niekedy viac: Mapreduce a Flume v paralelných výpočtoch.

Richard Královic

Proceedings of the Conference on Information Technologies, 2013

2012

Size complexity of rotating and sweeping automata.

Christos A. Kapoutsis, Richard Královic, Tobias Mömke

J. Comput. Syst. Sci., 2012

Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract).

Stefan Dobrev, Rastislav Královic, Richard Královic

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

On the Advice Complexity of the Knapsack Problem.

Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On the Advice Complexity of the Set Cover Problem.

Dennis Komm, Richard Královic, Tobias Mömke

Proceedings of the Computer Science - Theory and Applications, 2012

On the Power of Randomness versus Advice in Online Computation.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith

Proceedings of the Languages Alive, 2012

2011

Advice Complexity and Barely Random Algorithms.

Dennis Komm, Richard Královic

RAIRO Theor. Informatics Appl., 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

On the Power of Randomization for One-Way Finite Automata.

Richard Královic

Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

2010

Complexity Classes of Finite Automata.

Richard Královic

PhD thesis, 2010

Information Complexity of Online Problems.

Juraj Hromkovic, Rastislav Královic, Richard Královic

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Rapid almost-complete broadcasting in faulty networks.

Rastislav Kralovic, Richard Královic

Theor. Comput. Sci., 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

On the Advice Complexity of Online Problems.

Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Infinite vs. Finite Space-Bounded Randomized Computations.

Richard Královic

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008

On fractional dynamic faults with thresholds.

Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro

Theor. Comput. Sci., 2008

Reoptimization of Steiner Trees.

Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych

Proceedings of the Algorithm Theory, 2008

Deterministic Models of Communication Faults.

Rastislav Kralovic, Richard Královic

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.

Christos A. Kapoutsis, Richard Královic, Tobias Mömke

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Efficient Algorithms for the Spoonerism Problem.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Online Bandwidth Allocation.

Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan

Proceedings of the Algorithms, 2007

2006

On Fractional Dynamic Faults with Threshold.

Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro

Proceedings of the Structural Information and Communication Complexity, 2006

2005

On Semi-perfect 1-Factorizations.

Rastislav Kralovic, Richard Královic

Proceedings of the Structural Information and Communication Complexity, 2005

2004

Time and space complexity of reversible pebbling.

Richard Královic

RAIRO Theor. Informatics Appl., 2004

2003

Broadcasting with Many Faulty Links.

Rastislav Kralovic, Richard Královic, Peter Ruzicka

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003