Search

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

Search Constraints

Start Over You searched for: Author "Ilcinkas, David" Remove constraint Author: "Ilcinkas, David" Database Springer Nature eBooks Remove constraint Database: Springer Nature eBooks
64 results on '"Ilcinkas, David"'

Search Results

1. A State-of-the-Art Karp-Miller Algorithm Certified in Coq

2. Oblivious Robots on Graphs: Exploration

3. On Mobile Agent Verifiable Problems

4. Linear Search by a Pair of Distinct-Speed Robots

5. Beachcombing on Strips and Islands

6. Distributedly Testing Cycle-Freeness

7. Exploration of Constantly Connected Dynamic Graphs Based on Cactuses

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

9. Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring

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

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

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

13. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

14. Optimal Exploration of Terrains with Obstacles

15. Asynchronous Deterministic Rendezvous in Bounded Terrains

16. More Efficient Periodic Traversal in Anonymous Undirected Graphs

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

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

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

20. Fast Radio Broadcasting with Advice

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

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

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

24. The Cost of Monotonicity in Distributed Graph Searching

25. Tree Exploration with an Oracle

26. Setting Port Numbers for Fast Graph Exploration

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

28. Labeling Schemes for Tree Representation

29. Space Lower Bounds for Graph Exploration via Reduced Automata

30. Label-Guided Graph Exploration by a Finite Automaton

31. Graph Exploration by a Finite Automaton

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

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

35. Optimal Consistent Network Updates in Polynomial Time

36. Asynchronous Embedded Pattern Formation Without Orientation

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

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

39. Upper Bounds for Boundless Tagging with Bounded Objects

40. Fast Distributed Algorithms for Testing Graph Properties

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

42. Non-Bayesian Learning in the Presence of Byzantine Agents

43. Asynchronous Computability Theorems for t-Resilient Systems

44. Information Spreading in Dynamic Networks Under Oblivious Adversaries

45. Distributed Testing of Excluded Subgraphs

46. Lower Bound on the Step Complexity of Anonymous Binary Consensus

47. Priority Mutual Exclusion: Specification and Algorithm

48. How to Discreetly Spread a Rumor in a Crowd

49. Online Balanced Repartitioning

50. Buffer Size for Routing Limited-Rate Adversarial Traffic

Catalog

Books, media, physical & digital resources