Search

Your search keyword '"Ilcinkas, David"' showing total 84 results

Search Constraints

Start Over You searched for: Author "Ilcinkas, David" Remove constraint Author: "Ilcinkas, David" Publisher springer berlin heidelberg Remove constraint Publisher: springer berlin heidelberg
84 results on '"Ilcinkas, David"'

Search Results

2. On Mobile Agent Verifiable Problems

3. On the Communication Complexity of Distributed Name-Independent Routing Schemes

4. On the Power of Waiting When Exploring Public Transportation Systems

5. The Impact of Edge Deletions on the Number of Errors in Networks

6. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

7. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

8. Optimal Exploration of Terrains with Obstacles

9. Asynchronous Deterministic Rendezvous in Bounded Terrains

10. More Efficient Periodic Traversal in Anonymous Undirected Graphs

11. Euler Tour Lock-In Problem in the Rotor-Router Model : I Choose Pointers and You Choose Port Numbers

12. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

13. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

14. Fast Radio Broadcasting with Advice

15. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens

16. Distributed Computing with Advice: Information Sensitivity of Graph Coloring

17. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

18. The Cost of Monotonicity in Distributed Graph Searching

19. Tree Exploration with an Oracle

20. Setting Port Numbers for Fast Graph Exploration

21. The Reduced Automata Technique for Graph Exploration Space Lower Bounds

22. Labeling Schemes for Tree Representation

23. Space Lower Bounds for Graph Exploration via Reduced Automata

24. Label-Guided Graph Exploration by a Finite Automaton

25. Graph Exploration by a Finite Automaton

30. More Efficient Periodic Traversal in Anonymous Undirected Graphs

42. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems

43. Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model

44. Optimal Consistent Network Updates in Polynomial Time

45. Asynchronous Embedded Pattern Formation Without Orientation

46. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks

47. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks

48. Upper Bounds for Boundless Tagging with Bounded Objects

49. Fast Distributed Algorithms for Testing Graph Properties

50. Deterministic Leader Election in Time with Messages of Size O(1)

Catalog

Books, media, physical & digital resources