Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Královič, Rastislav
46  Ergebnisse:
Personensuche X
?
1

Randomized Online Computation with High Probability Guarant..:

Komm, Dennis ; Královič, Rastislav ; Královič, Richard.
Algorithmica.  84 (2022)  5 - p. 1357-1384 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Two-Way Non-uniform Finite Automata:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
Frei, Fabian ; Hromkovič, Juraj ; Královič, Richard. - p. 155-166 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Tight hierarchy of data-independent multi-head automata:

Ďuriš, Pavol ; Královič, Rastislav ; Pardubská, Dana
Journal of Computer and System Sciences.  114 (2020)  - p. 126-136 , 2020
Link: https://doi.org/10.1016/..
 
?
4

A Linear-Time Algorithm for the Isometric Reconciliation of..:

Brejová, Broňa ; Královič, Rastislav
Algorithms.  13 (2020)  9 - p. 225 , 2020
Link: https://doi.org/10.3390/..
 
?
5

Improved Lower Bounds for Shoreline Search:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana - p. 80-90 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Exploration of Time-Varying Connected Graphs with Silent Ag..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana - p. 146-162 , 2020
Link: https://doi.org/10.1007/..
 
?
7

SOFSEM 2019: Theory and Practice of Computer Science: 45th .. 

Theoretical Computer Science and General Issues, 11376
Catania, Barbara ; Královič, Rastislav ; Nawrocki, Jerzy. - 1st ed. 2019 . , 2019
Link: https://doi.org/10.1007/..
 
?
8

Determinism and Nondeterminism in Finite Automata with Advi..:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,
Ďuriš, Pavol ; Korbaš, Rafael ; Královič, Rastislav. - p. 3-16 , 2018
Link: https://doi.org/10.1007/..
 
?
9

On the advice complexity of the k-server problem:

Böckenhauer, Hans-Joachim ; Komm, Dennis ; Královič, Rastislav.
Journal of Computer and System Sciences.  86 (2017)  - p. 159-170 , 2017
Link: https://doi.org/10.1016/..
 
?
10

Online algorithms with advice: The tape model:

Böckenhauer, Hans-Joachim ; Komm, Dennis ; Královič, Rastislav..
Information and Computation.  254 (2017)  - p. 59-83 , 2017
Link: https://doi.org/10.1016/..
 
?
11

Improved analysis of the online set cover problem with advi..:

Dobrev, Stefan ; Edmonds, Jeff ; Komm, Dennis...
Theoretical Computer Science.  689 (2017)  - p. 96-107 , 2017
Link: https://doi.org/10.1016/..
 
?
12

Advice Complexity of Maximum Independent set in Sparse and ..:

Dobrev, Stefan ; Královič, Rastislav ; Královič, Richard
Theory of Computing Systems.  56 (2014)  1 - p. 197-219 , 2014
Link: https://doi.org/10.1007/..
 
?
13

Exploring an unknown dangerous graph using tokens:

Dobrev, Stefan ; Flocchini, Paola ; Královič, Rastislav.
Theoretical Computer Science.  472 (2013)  - p. 28-45 , 2013
Link: https://doi.org/10.1016/..
 
?
14

Antibandwidth and cyclic antibandwidth of Hamming graphs:

Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana..
Discrete Applied Mathematics.  161 (2013)  10-11 - p. 1402-1408 , 2013
Link: https://doi.org/10.1016/..
 
?
15

Efficient routing in carrier-based mobile networks:

Brejová, Broňa ; Dobrev, Stefan ; Královič, Rastislav.
Theoretical Computer Science.  509 (2013)  - p. 113-121 , 2013
Link: https://doi.org/10.1016/..
 
1-15