Rastislav Královič
Rastislav Královič
Bestätigte E-Mail-Adresse bei dcs.fmph.uniba.sk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the advice complexity of online problems
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
International Symposium on Algorithms and Computation, 331-340, 2009
1302009
On time versus size for monotone dynamic monopolies in regular topologies
P Flocchini, R Královič, P Ružička, A Roncato, N Santoro
Journal of Discrete Algorithms 1 (2), 129-150, 2003
912003
On time versus size for monotone dynamic monopolies in regular topologies
P Flocchini, R Královič, P Ružička, A Roncato, N Santoro
Journal of Discrete Algorithms 1 (2), 129-150, 2003
912003
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
90*2011
Information complexity of online problems
J Hromkovič, R Královič, R Královič
International Symposium on Mathematical Foundations of Computer Science, 24-36, 2010
872010
Applied computer science
S Torbert
Springer, 2016
752016
Measuring the problem-relevant information in input
S Dobrev, R Královič, D Pardubská
RAIRO-Theoretical Informatics and Applications 43 (3), 585-613, 2009
752009
Black hole search in common interconnection networks
S Dobrev, P Flocchini, R Královič, P Ružička, G Prencipe, N Santoro
Networks: An International Journal 47 (2), 61-71, 2006
702006
How much information about the future is needed?
S Dobrev, R Královič, D Pardubská
International Conference on Current Trends in Theory and Practice of …, 2008
672008
Online graph exploration with advice
S Dobrev, R Královič, E Markou
International Colloquium on Structural Information and Communication …, 2012
522012
Black hole search in asynchronous rings using tokens
S Dobrev, R Královič, N Santoro, W Shi
Italian Conference on Algorithms and Complexity, 139-150, 2006
452006
Black hole search in directed graphs
J Czyzowicz, S Dobrev, R Královič, S Miklík, D Pardubská
International Colloquium on Structural Information and Communication …, 2009
402009
The complexity of shortest path and dilation bounded interval routing
R Kráľovič, P Ružička, D Štefankovič
European Conference on Parallel Processing, 258-265, 1997
401997
Minimum feedback vertex sets in shuffle-based interconnection networks
R Královič, P Ružička
Information Processing Letters 86 (4), 191-196, 2003
322003
Exploring an unknown dangerous graph using tokens
S Dobrev, P Flocchini, R Královič, N Santoro
Theoretical Computer Science 472, 28-45, 2013
272013
Periodic data retrieval problem in rings containing a malicious host
R Královič, S Miklík
International Colloquium on Structural Information and Communication …, 2010
262010
Exploring an unknown graph to locate a black hole using tokens
S Dobrev, P Flocchini, R Královič, N Santoro
Fourth IFIP International Conference on Theoretical Computer Science-TCS …, 2006
262006
Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
S Dobrev, P Flocchini, R Kralovic, G Prencipe, P Ruzicka, N Santoro
OPODIS, 169-180, 2002
242002
Exploring a dangerous unknown graph using tokens
S Dobrev, P Flocchini, R Kralovic, N Santoro
Proceedings of 5th IFIP International Conference on Theoretical Computer …, 2006
212006
Treasure hunt with advice
D Komm, R Královič, R Královič, J Smula
International Colloquium on Structural Information and Communication …, 2015
202015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20