Articles with public access mandates - Rastislav KrálovičLearn more
Not available anywhere: 5
Treasure hunt with advice
D Komm, R Královič, R Královič, J Smula
Structural Information and Communication Complexity: 22nd International …, 2015
Mandates: Swiss National Science Foundation
The complexity of paging against a probabilistic adversary
S Dobrev, J Hromkovič, D Komm, R Královič, R Královič, T Mömke
International Conference on Current Trends in Theory and Practice of …, 2016
Mandates: Swiss National Science Foundation, German Research Foundation
Edge-Editing to a Dense and a Sparse Graph Class
M Kotrbčík, R Královič, S Ordyniak
LATIN 2016: Theoretical Informatics, 562-575, 2016
Mandates: Austrian Science Fund
Two-Way Non-Uniform Finite Automata
F Frei, J Hromkovič, R Královič, R Královič
International Journal of Foundations of Computer Science 34 (02n03), 145-162, 2023
Mandates: Swiss National Science Foundation
On the Complexity of Distributed Wake-Up
S Dobrev, R Královič, N Santoro
2016 Fourth International Symposium on Computing and Networking (CANDAR …, 2016
Mandates: Natural Sciences and Engineering Research Council of Canada
Available somewhere: 9
On the advice complexity of the k-server problem
HJ Böckenhauer, D Komm, R Královič, R Královič
International Colloquium on Automata, Languages, and Programming, 207-218, 2011
Mandates: Swiss National Science Foundation
Disjoint path allocation with sublinear advice
H Gebauer, D Komm, R Královič, R Královič, J Smula
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
Mandates: Swiss National Science Foundation
Advice complexity of the online induced subgraph problem
D Komm, R Královič, R Královič, C Kudahl
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
Mandates: Swiss National Science Foundation, Villum Foundation
Improved analysis of the online set cover problem with advice
S Dobrev, J Edmonds, D Komm, R Královič, R Královič, S Krug, T Mömke
Theoretical Computer Science 689, 96-107, 2017
Mandates: Swiss National Science Foundation, German Research Foundation
Randomized online algorithms with high probability guarantees
D Komm, R Kràlovic, R Kràlovic, T Mömke
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
Mandates: Swiss National Science Foundation, German Research Foundation
Randomized Online Computation with High Probability Guarantees
D Komm, R Královič, R Královič, T Mömke
Algorithmica 84 (5), 1357-1384, 2022
Mandates: Swiss National Science Foundation, German Research Foundation
Online graph coloring against a randomized adversary
E Burjons, J Hromkovič, R Královič, R Královič, X Muñoz, W Unger
International Journal of Foundations of Computer Science 29 (04), 551-569, 2018
Mandates: Swiss National Science Foundation, Government of Spain
On the cost of waking up
S Dobrev, N Santoro
International journal of networking and computing 7 (2), 336-348, 2017
Mandates: Natural Sciences and Engineering Research Council of Canada
Randomized online computation with high probability guarantees
T Mömke, R Královič, R Královič, D Komm
Mandates: Swiss National Science Foundation, German Research Foundation
Publication and funding information is determined automatically by a computer program