40 results on '"David Ilcinkas"'
Search Results
2. A State-of-the-Art Karp-Miller Algorithm Certified in Coq.
3. Framing Algorithms for Approximate Multicriteria Shortest Paths.
4. Silent self-stabilizing scheme for spanning-tree-like constructions.
5. Linear Search by a Pair of Distinct-Speed Robots.
6. On Mobile Agent Verifiable Problems.
7. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
8. Beachcombing on Strips and Islands.
9. Exploration of Constantly Connected Dynamic Graphs Based on Cactuses.
10. Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks.
11. Distributedly Testing Cycle-Freeness.
12. Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring.
13. On the Communication Complexity of Distributed Name-Independent Routing Schemes.
14. Brief Announcement: Routing the Internet with Very Few Entries.
15. The Impact of Edge Deletions on the Number of Errors in Networks.
16. On the Power of Waiting When Exploring Public Transportation Systems.
17. Optimal Exploration of Terrains with Obstacles.
18. Asynchronous Deterministic Rendezvous in Bounded Terrains.
19. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.
20. Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?
21. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.
22. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
23. More Efficient Periodic Traversal in Anonymous Undirected Graphs.
24. Euler Tour Lock-In Problem in the Rotor-Router Model.
25. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.
26. Fast Radio Broadcasting with Advice.
27. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.
28. Distributed Computing with Advice: Information Sensitivity of Graph Coloring.
29. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
30. The Cost of Monotonicity in Distributed Graph Searching.
31. Setting Port Numbers for Fast Graph Exploration.
32. Oracle size: a new measure of difficulty for communication tasks.
33. The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
34. Tree Exploration with an Oracle.
35. Label-Guided Graph Exploration by a Finite Automaton.
36. Space Lower Bounds for Graph Exploration via Reduced Automata.
37. Labeling Schemes for Tree Representation.
38. Digraphs Exploration with Little Memory.
39. Graph Exploration by a Finite Automaton.
40. Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.