default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Královic
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker:
Tree Coloring: Random Order and Predictions. CoRR abs/2405.18151 (2024)- 2023
- [j18]Fabian Frei
, Juraj Hromkovic, Rastislav Královic, Richard Královic:
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34(2&3): 145-162 (2023) - 2022
- [j17]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Computation with High Probability Guarantees. Algorithmica 84(5): 1357-1384 (2022) - 2021
- [c32]Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic:
Two-Way Non-uniform Finite Automata. DLT 2021: 155-166 - 2020
- [c31]Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith:
Randomization in Non-Uniform Finite Automata. MFCS 2020: 30:1-30:13
2010 – 2019
- 2018
- [j16]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): 551-569 (2018) - [c30]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: 3-16 - 2017
- [j15]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: 59-83 (2017) - [j14]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: 159-170 (2017) - [j13]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: 96-107 (2017) - 2016
- [c29]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. MFCS 2016: 59:1-59:13 - [c28]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: 265-276 - 2015
- [j12]Stefan Dobrev, Rastislav Královic, Richard Královic:
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. 56(1): 197-219 (2015) - [c27]Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Disjoint Path Allocation with Sublinear Advice. COCOON 2015: 417-429 - [c26]Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Treasure Hunt with Advice. SIROCCO 2015: 328-341 - [i4]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. CoRR abs/1512.05996 (2015) - 2014
- [j11]Richard Královic:
Infinite vs. finite size-bounded randomized computations. J. Comput. Syst. Sci. 80(4): 744-765 (2014) - [j10]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527: 61-72 (2014) - [c25]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Algorithms with High Probability Guarantees. STACS 2014: 470-481 - 2013
- [j9]Stefan Dobrev, Rastislav Královic, Richard Královic:
Computing with Advice: when Knowledge Helps. Bull. EATCS 110: 35-51 (2013) - [j8]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): 955-978 (2013) - [c24]Richard Královic:
Menej je niekedy viac: Mapreduce a Flume v paralelných výpočtoch. ITAT 2013: 88 - [i3]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized online computation with high probability guarantees. CoRR abs/1302.2805 (2013) - 2012
- [j7]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78(2): 537-558 (2012) - [c23]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: 30-43 - [c22]Dennis Komm, Richard Královic, Tobias Mömke:
On the Advice Complexity of the Set Cover Problem. CSR 2012: 241-252 - [c21]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: 24-39 - [c20]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - [c19]Stefan Dobrev, Rastislav Královic, Richard Královic:
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA 2012: 2-15 - 2011
- [j6]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): 227-251 (2011) - [j5]Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. RAIRO Theor. Informatics Appl. 45(2): 249-267 (2011) - [c18]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the Advice Complexity of the k-Server Problem. ICALP (1) 2011: 207-218 - [c17]Richard Královic:
On the Power of Randomization for One-Way Finite Automata. NCMA 2011: 165-177 - [c16]Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. SOFSEM 2011: 332-343 - 2010
- [b1]Richard Královic:
Complexity Classes of Finite Automata. ETH Zurich, Zürich, Switzerland, 2010 - [c15]Juraj Hromkovic, Rastislav Královic, Richard Královic:
Information Complexity of Online Problems. MFCS 2010: 24-36 - [e2]Juraj Hromkovic, Richard Královic, Jan Vahrenhold:
Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010. Proceedings. Lecture Notes in Computer Science 5941, Springer 2010, ISBN 978-3-642-11375-8 [contents]
2000 – 2009
- 2009
- [j4]Rastislav Kralovic, Richard Královic:
Rapid almost-complete broadcasting in faulty networks. Theor. Comput. Sci. 410(14): 1377-1387 (2009) - [j3]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): 3428-3435 (2009) - [c14]Richard Královic:
Infinite vs. Finite Space-Bounded Randomized Computations. CCC 2009: 316-325 - [c13]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: 78-91 - [c12]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
On the Advice Complexity of Online Problems. ISAAC 2009: 331-340 - 2008
- [j2]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399(1-2): 101-117 (2008) - [c11]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory 2008: 455-466 - [c10]Rastislav Kralovic, Richard Královic:
Deterministic Models of Communication Faults. MFCS 2008: 52-67 - [c9]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - 2007
- [c8]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: 546-557 - [c7]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel:
Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92 - [c6]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141 - [c5]Rastislav Kralovic, Richard Královic:
Rapid Almost-Complete Broadcasting in Faulty Networks. SIROCCO 2007: 246-260 - [e1]Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer:
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0 [contents] - [i2]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan:
Online Bandwidth Allocation. CoRR abs/cs/0701153 (2007) - [i1]Rastislav Kralovic, Richard Královic:
Rapid Almost-Complete Broadcasting in Faulty Networks. CoRR abs/cs/0703122 (2007) - 2006
- [c4]Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211 - 2005
- [c3]Rastislav Kralovic, Richard Královic:
On Semi-perfect 1-Factorizations. SIROCCO 2005: 216-230 - 2004
- [j1]Richard Královic:
Time and space complexity of reversible pebbling. RAIRO Theor. Informatics Appl. 38(2): 137-161 (2004) - 2003
- [c2]Rastislav Kralovic, Richard Královic, Peter Ruzicka:
Broadcasting with Many Faulty Links. SIROCCO 2003: 211-222 - 2001
- [c1]Richard Královic:
Time and Space Complexity of Reversible Pebbling. SOFSEM 2001: 292-303
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-24 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
