The following pages link to David Ilcinkas (Q265065):
Displayed 50 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring (Q722206) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Tree exploration with advice (Q958304) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Exploration of dynamic cactuses with sub-logarithmic overhead (Q2035475) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- Exploration of carrier-based time-varying networks: the power of waiting (Q2202018) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- On Mobile Agent Verifiable Problems (Q2802932) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring (Q2868628) (← links)
- Distributedly Testing Cycle-Freeness (Q2945176) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps (Q3174933) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots (Q3511387) (← links)
- Fast Radio Broadcasting with Advice (Q3511406) (← links)
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (Q3540233) (← links)
- Asynchronous Deterministic Rendezvous in Bounded Terrains (Q3569117) (← links)
- Optimal Exploration of Terrains with Obstacles (Q3569874) (← links)
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids (Q3588310) (← links)
- Setting Port Numbers for Fast Graph Exploration (Q3613644) (← links)
- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (Q3638110) (← links)
- Euler Tour Lock-In Problem in the Rotor-Router Model (Q3646241) (← links)
- (Q4560215) (← links)
- Label-guided graph exploration by a finite automaton (Q4962747) (← links)
- Locating a target with an agent guided by unreliable local advice (Q5176212) (← links)
- Oracle size (Q5177279) (← links)
- STACS 2004 (Q5309704) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311120) (← links)