#### Filter Results:

#### Publication Year

2004

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
- Algorithmica
- 2007

We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimensional plane, but (with one exception) has not been investigated before… (More)

Θ k-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number k and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown… (More)

- Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
- ACM Trans. Algorithms
- 2005

A finite automaton, simply referred to as a <i>robot</i>, has to explore a graph, that is, visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph, nor of its size. It is known that for any <i>k</i>-state robot, there exists a graph of maximum degree 3 that the robot cannot explore. This article considers the… (More)

- Pierre Fraigniaud, David Ilcinkas
- STACS
- 2004

Under the robot model, we show that a robot needs Ω(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorithm that allows exploration of any n-node digraph with maximum out-degree d to be accomplished by a robot with a memory of size O(nd log n) bits. Under the agent model, we show that… (More)

- Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
- PODC
- 2006

We study the problem of the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. While previous results about communication in networks used particular partial information available to nodes, such as the knowledge of the neighborhood or the knowledge of the network topology within… (More)

- David Ilcinkas
- SIROCCO
- 2006

We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of arbitrary size and arbitrary maximum degree. In anonymous graphs, nodes are not labeled but edges are labeled in a local manner (called local orientation) so that the automaton is… (More)

- Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
- Distributed Computing
- 2009

We consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot's walk is chosen using only local information, and so that some local equity (fairness) criterion is satisfied for the adjacent undirected edges. Such strategies can be seen as an… (More)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

- Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
- MFCS
- 2004

- Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
- Distributed Computing
- 2007

We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much… (More)