31 results on '"Ilcinkas, David"'
Search Results
2. Exploration of Dynamic Cactuses with Sub-logarithmic Overhead
3. Deciding and verifying network properties locally with few output bits
4. Disconnected components detection and rooted shortest-path tree maintenance in networks
5. On mobile agent verifiable problems
6. Linear Search by a Pair of Distinct-Speed Robots
7. Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
8. The impact of dynamic events on the number of errors in networks
9. Robustness of the Rotor–Router Mechanism
10. Worst-case optimal exploration of terrains with obstacles
11. More efficient periodic traversal in anonymous undirected graphs
12. Asynchronous deterministic rendezvous in bounded terrains
13. Fast radio broadcasting with advice
14. Remembering without memory: Tree exploration by asynchronous oblivious robots
15. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
16. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
17. Derandomizing random walks in undirected graphs using locally fair exploration strategies
18. Tree exploration with advice
19. The cost of monotonicity in distributed graph searching
20. Distributed computing with advice: information sensitivity of graph coloring
21. Labeling Schemes for Tree Representation
22. Graph exploration by a finite automaton
23. Exploration of carrier-based time-varying networks: The power of waiting.
24. Exploration of the <italic>T</italic>-Interval-Connected Dynamic Graphs: the Case of the Ring.
25. Communication algorithms with advice
26. Label-Guided Graph Exploration by a Finite Automaton.
27. Setting port numbers for fast graph exploration
28. Impact of memory size on graph exploration capability
29. Impact of Asynchrony on the Behavior of Rational Selfish Agents.
30. Beachcombing on strips and islands.
31. On asynchronous rendezvous in general graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.