66 results on '"Ilcinkas, David"'
Search Results
2. Oblivious Robots on Graphs: Exploration
3. Linear Search by a Pair of Distinct-Speed Robots
4. On Mobile Agent Verifiable Problems
5. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions
6. Beachcombing on Strips and Islands
7. Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
8. Distributedly Testing Cycle-Freeness
9. On the Communication Complexity of Distributed Name-Independent Routing Schemes
10. Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
11. Exploration of carrier-based time-varying networks: The power of waiting
12. On the Power of Waiting When Exploring Public Transportation Systems
13. The Impact of Edge Deletions on the Number of Errors in Networks
14. Asynchronous Deterministic Rendezvous in Bounded Terrains
15. Optimal Exploration of Terrains with Obstacles
16. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
17. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
18. More Efficient Periodic Traversal in Anonymous Undirected Graphs
19. Euler Tour Lock-In Problem in the Rotor-Router Model
20. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
21. Exploration of Dynamic Cactuses with Sub-logarithmic Overhead
22. Beachcombing on strips and islands
23. Disconnected components detection and rooted shortest-path tree maintenance in networks
24. Tree Exploration with an Oracle
25. The Reduced Automata Technique for Graph Exploration Space Lower Bounds
26. Setting Port Numbers for Fast Graph Exploration
27. Label-Guided Graph Exploration by a Finite Automaton
28. Labeling Schemes for Tree Representation
29. Space Lower Bounds for Graph Exploration via Reduced Automata
30. Digraphs Exploration with Little Memory
31. Graph Exploration by a Finite Automaton
32. Deciding and verifying network properties locally with few output bits
33. Silent self-stabilizing scheme for spanning-tree-like constructions
34. On asynchronous rendezvous in general graphs
35. On mobile agent verifiable problems
36. Linear Search by a Pair of Distinct-Speed Robots
37. Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
38. Robustness of the Rotor–Router Mechanism
39. The impact of dynamic events on the number of errors in networks
40. Brief Announcement
41. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
42. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
43. The Cost of Monotonicity in Distributed Graph Searching
44. Fast Radio Broadcasting with Advice
45. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
46. Distributed Computing with Advice: Information Sensitivity of Graph Coloring
47. Worst-case optimal exploration of terrains with obstacles
48. More efficient periodic traversal in anonymous undirected graphs
49. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
50. Asynchronous deterministic rendezvous in bounded terrains
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.