Follow
Rastislav KrŠlovič
Rastislav KrŠlovič
Verified email at dcs.fmph.uniba.sk - Homepage
Title
Cited by
Cited by
Year
On the advice complexity of online problems
HJ BŲckenhauer, D Komm, R KrŠlovič, R KrŠlovič, T MŲmke
Algorithms and Computation: 20th International Symposium, ISAAC 2009†…, 2009
1592009
Information complexity of online problems
J Hromkovič, R KrŠlovič, R KrŠlovič
International Symposium on Mathematical Foundations of Computer Science, 24-36, 2010
1112010
Applied computer science
S Torbert
Springer, 2016
1052016
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
105*2011
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
992003
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
992003
Measuring the problem-relevant information in input
S Dobrev, R KrŠlovič, D PardubskŠ
RAIRO-Theoretical Informatics and Applications 43 (3), 585-613, 2009
972009
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
762008
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
752006
Online graph exploration with advice
S Dobrev, R KrŠlovič, E Markou
International Colloquium on Structural Information and Communication†…, 2012
682012
Black hole search in asynchronous rings using tokens
S Dobrev, R KrŠlovič, N Santoro, W Shi
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy†…, 2006
452006
Black hole search in directed graphs
J Czyzowicz, S Dobrev, R KrŠlovič, S MiklŪk, D PardubskŠ
Structural Information and Communication Complexity: 16th International†…, 2010
432010
The complexity of shortest path and dilation bounded interval routing
R KrŠľovič, P Ružička, D Štefankovič
Euro-Par'97 Parallel Processing: Third International Euro-Par Conference†…, 1997
401997
Exploring an unknown dangerous graph using tokens
S Dobrev, P Flocchini, R KrŠlovič, N Santoro
Theoretical Computer Science 472, 28-45, 2013
362013
Treasure hunt with advice
D Komm, R KrŠlovič, R KrŠlovič, J Smula
Structural Information and Communication Complexity: 22nd International†…, 2015
332015
Minimum feedback vertex sets in shuffle-based interconnection networks
R KrŠlovič, P Ružička
Information Processing Letters 86 (4), 191-196, 2003
332003
Online algorithms with advice: The tape model
HJ BŲckenhauer, D Komm, R KrŠlovič, R KrŠlovič, T MŲmke
Information and Computation 254, 59-83, 2017
302017
Periodic data retrieval problem in rings containing a malicious host
R KrŠlovič, S MiklŪk
Structural Information and Communication Complexity: 17th International†…, 2010
282010
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
272002
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
The system can't perform the operation now. Try again later.
Articles 1–20