- Fast Radio Broadcasting with Advice David Ilcinkas,a,1
- Digraphs Exploration with Little Memory Pierre Fraigniaud and David Ilcinkas
- Le co^ut de la monotonie dans les strategies d'encerclement reparti
- Euler Tour Lock-in Problem in the Rotor-Router Model
- Exploration par un automate fini de r R. Cohen 1 , P. Fraigniaud 2 , D. Ilcinkas 2 , A. Korman 1 , et D. Peleg 1
- Exploration d'arbres par des robots asynchrones et sans m
- The reduced automata technique for graph exploration space lower bounds ?
- Asynchronous deterministic rendezvous in bounded terrains
- d'ordre : 8334 presentee pour obtenir le grade de
- Space lower bounds for graph exploration via reduced automata #
- Labeling Schemes for Tree Representation # Reuven Cohen + Pierre Fraigniaud # David Ilcinkas #
- Comment battre la marche aleatoire en comptant ? N. Hanusse1 and D. Ilcinkas1 and A. Kosowski2 and N. Nisse3
- Labeling Schemes for Tree Representation Reuven Cohen 1 , Pierre Fraigniaud 2 ? , David Ilcinkas 2 ? , Amos Korman 1 , and
- Label-Guided Graph Exploration by a Finite Automaton
- Graph Exploration by a Finite Automaton ? Pierre Fraigniaud a;1 David Ilcinkas a; ;1 Guy Peer b
- Fast Radio Broadcasting with Advice David Ilcinkas1,
- Exploration d'arbres avec oracle Pierre Fraigniaud 1+ , David Ilcinkas 2+ et Andrzej Pelc 3
- Exploration de r eseaux par un robot
- Graph Exploration by a Finite Automaton P. Fraigniaud 1 , D. Ilcinkas 1 , G. Peer 2 , A. Pelc 3 , and D. Peleg 2
- Derandomizing Random Walks in Undirected Graphs
- Optimal Exploration of Terrains with Obstacles Jurek Czyzowicz1,
- Fundamenta Informaticae XX (2007) 113 1 Impact of asynchrony on the behavior of rational selfish agents
- Setting Port Numbers for Fast Graph Exploration
- Tree Exploration with an Oracle Pierre Fraigniaud 1 , David Ilcinkas 2 , and Andrzej Pelc 3
- Comment rsumer le plan Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
- Oracle Size: a New Measure of Difficulty for Communication Tasks
- More Ecient Periodic Traversal in Anonymous Undirected Graphs
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring
- Noname manuscript No. (will be inserted by the editor)
- Communication Algorithms with Advice6 Pierre Fraigniauda,1
- Tree Exploration with Advice Pierre Fraigniaud a,1
- Setting Port Numbers for Fast Graph Exploration David Ilcinkas
- Label-Guided Graph Exploration by a Finite Automaton
- Impact of memory size on graph exploration capability Pierre Fraigniaud
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Remembering Without Memory: Tree Exploration
- The cost of monotonicity in distributed graph searching
- Computing Without Communicating: Ring Exploration
- Recherche optimale de trou noir avec cailloux Paola Flocchini1,, David Ilcinkas2, et Nicola Santoro3,
- Locating a Target with an Agent Guided by Unreliable Local Advice
- Distributed Computing manuscript No. (will be inserted by the editor)
- Asynchronous deterministic rendezvous in bounded terrains$
- How many oblivious robots can explore a line Paola Flocchini
