Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Královič, Richard
51  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

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/..
 
?
4

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/..
 
?
5

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/..
 
?
6

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/..
 
?
7

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/..
 
?
8

Infinite vs. finite size-bounded randomized computations:

Královič, Richard
Journal of Computer and System Sciences.  80 (2014)  4 - p. 744-765 , 2014
Link: https://doi.org/10.1016/..
 
?
9

The online knapsack problem: Advice and randomization:

Böckenhauer, Hans-Joachim ; Komm, Dennis ; Královič, Richard.
Theoretical Computer Science.  527 (2014)  - p. 61-72 , 2014
Link: https://doi.org/10.1016/..
 
?
10

Size complexity of rotating and sweeping automata:

Kapoutsis, Christos ; Královič, Richard ; Mömke, Tobias
Journal of Computer and System Sciences.  78 (2012)  2 - p. 537-558 , 2012
Link: https://doi.org/10.1016/..
 
?
11

Teaching fundamental concepts of informatics 

4th International Conference on Informatics in Secondary Sc...  Lecture notes in computer science ; 5941
Hromkovič, Juraj ; Královič, Richard ; Vahrenhold, Jan , 2010
Link: http://dx.doi.org/10.100..
 
?
12

Reoptimization of the Shortest Common Superstring Problem:

Bilò, Davide ; Böckenhauer, Hans-Joachim ; Komm, Dennis...
Algorithmica.  61 (2010)  2 - p. 227-251 , 2010
Link: https://doi.org/10.1007/..
 
?
13

Reoptimization of Steiner trees: Changing the terminal set:

Böckenhauer, Hans-Joachim ; Hromkovič, Juraj ; Královič, Richard..
Theoretical Computer Science.  410 (2009)  36 - p. 3428-3435 , 2009
Link: https://doi.org/10.1016/..
 
?
14

Rapid almost-complete broadcasting in faulty networks:

Královič, Rastislav ; Královič, Richard
Theoretical Computer Science.  410 (2009)  14 - p. 1377-1387 , 2009
Link: https://doi.org/10.1016/..
 
?
15

Infinite vs. Finite Space-Bounded Randomized Computations:

, In: 2009 24th Annual IEEE Conference on Computational Complexity,
Kralovic, Richard - p. None , 2009
Link: https://doi.org/10.1109/..
 
1-15