The following pages link to Rastislav Královič (Q392204):
Displaying 50 items.
- Efficient routing in carrier-based mobile networks (Q392206) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- On fractional dynamic faults with thresholds (Q930907) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
- Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing (Q1022603) (← links)
- (Q1575665) (redirect page) (← links)
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- On time versus size for monotone dynamic monopolies in regular topologies (Q1827282) (← links)
- Sparse topologies with small spectrum size (Q1885049) (← links)
- Exploring an unknown dangerous graph using tokens (Q1939252) (← links)
- Randomized online computation with high probability guarantees (Q2134747) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
- (Q2762507) (← links)
- The Complexity of Paging Against a Probabilistic Adversary (Q2794365) (← links)
- Edge-Editing to a Dense and a Sparse Graph Class (Q2802969) (← links)
- Independent Set with Advice: The Impact of Graph Knowledge (Q2848909) (← links)
- Antibandwidth and Cyclic Antibandwidth of Hamming Graphs (Q2851478) (← links)
- Online Graph Exploration with Advice (Q2913217) (← links)
- Advice Complexity: Quantitative Approach to A-Priori Information (Q2938091) (← links)
- Randomized Online Algorithms with High Probability Guarantees (Q2965509) (← links)
- On the Advice Complexity of the k-Server Problem (Q3012806) (← links)
- Determinism vs. Nondeterminism for Two-Way Automata (Q3167481) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- (Q3300812) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- Online Bandwidth Allocation (Q3527246) (← links)
- Periodic Data Retrieval Problem in Rings Containing a Malicious Host (Q3569123) (← links)
- Information Complexity of Online Problems (Q3586068) (← links)
- Deterministic Models of Communication Faults (Q3599115) (← links)
- On Fractional Dynamic Faults with Threshold (Q3613652) (← links)
- On the Advice Complexity of Online Problems (Q3652221) (← links)
- (Q4473996) (← links)
- (Q4536937) (← links)
- (Q4584901) (← links)
- Advice Complexity of the Online Induced Subgraph Problem (Q4608622) (← links)
- (Q5089196) (← links)
- Improved Lower Bounds for Shoreline Search (Q5100947) (← links)
- Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956) (← links)
- (Q5317672) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- Rapid Almost-Complete Broadcasting in Faulty Networks (Q5425974) (← links)
