( en | de | ru )

 

Disambiguation of "Královic, Rastislav"

Author of the publication

copydeleteadd this publication to your clipboard
On the Advice Complexity of Online Problems.

, , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 331-340. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rastislav Lenhardt

Rastislav Sobotka

Rastislav Krajcik

Rastislav Kosiba

Rastislav Beňo

 

Other publications of authors with the same name

On the Cost of Waking Up., , and . Int. J. Netw. Comput., 7 (2): 336-348 (2017)Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract).. SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 21-29. Springer, (2014)Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract)., , and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 2-15. Springer, (2012)Periodic Data Retrieval Problem in Rings Containing a Malicious Host., and . SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 157-167. Springer, (2010)Randomized Online Algorithms with High Probability Guarantees., , , and . STACS, volume 25 of LIPIcs, page 470-481. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Determinism and Nondeterminism in Finite Automata with Advice., , , and . Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 3-16. Springer, (2018)Online Graph Exploration with Advice., , and . SIROCCO, volume 7355 of Lecture Notes in Computer Science, page 267-278. Springer, (2012)On the Advice Complexity of Online Problems., , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 331-340. Springer, (2009)Two-Way Non-uniform Finite Automata., , , and . DLT, volume 12811 of Lecture Notes in Computer Science, page 155-166. Springer, (2021)Exploration of Time-Varying Connected Graphs with Silent Agents., , and . SIROCCO, volume 12156 of Lecture Notes in Computer Science, page 146-162. Springer, (2020)