| 2007 |
|---|
| 13 | EE | Pierre Fraigniaud,
Cyril Gavoille,
David Ilcinkas,
Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring.
ICALP 2007: 231-242 |
| 12 | EE | Paola Flocchini,
David Ilcinkas,
Andrzej Pelc,
Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
OPODIS 2007: 105-118 |
| 11 | EE | David Ilcinkas,
Nicolas Nisse,
David Soguet:
The Cost of Monotonicity in Distributed Graph Searching.
OPODIS 2007: 415-428 |
| 2006 |
|---|
| 10 | EE | Pierre Fraigniaud,
David Ilcinkas,
Sergio Rajsbaum,
Sébastien Tixeuil:
The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Essays in Memory of Shimon Even 2006: 1-26 |
| 9 | EE | Pierre Fraigniaud,
David Ilcinkas,
Andrzej Pelc:
Tree Exploration with an Oracle.
MFCS 2006: 24-37 |
| 8 | EE | Pierre Fraigniaud,
David Ilcinkas,
Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks.
PODC 2006: 179-187 |
| 7 | EE | David Ilcinkas:
Setting Port Numbers for Fast Graph Exploration.
SIROCCO 2006: 59-69 |
| 2005 |
|---|
| 6 | EE | Reuven Cohen,
Pierre Fraigniaud,
David Ilcinkas,
Amos Korman,
David Peleg:
Label-Guided Graph Exploration by a Finite Automaton.
ICALP 2005: 335-346 |
| 5 | EE | Reuven Cohen,
Pierre Fraigniaud,
David Ilcinkas,
Amos Korman,
David Peleg:
Labeling Schemes for Tree Representation.
IWDC 2005: 13-24 |
| 4 | EE | Pierre Fraigniaud,
David Ilcinkas,
Sergio Rajsbaum,
Sébastien Tixeuil:
Space Lower Bounds for Graph Exploration via Reduced Automata.
SIROCCO 2005: 140-154 |
| 3 | EE | Pierre Fraigniaud,
David Ilcinkas,
Guy Peer,
Andrzej Pelc,
David Peleg:
Graph exploration by a finite automaton.
Theor. Comput. Sci. 345(2-3): 331-344 (2005) |
| 2004 |
|---|
| 2 | EE | Pierre Fraigniaud,
David Ilcinkas,
Guy Peer,
Andrzej Pelc,
David Peleg:
Graph Exploration by a Finite Automaton.
MFCS 2004: 451-462 |
| 1 | EE | Pierre Fraigniaud,
David Ilcinkas:
Digraphs Exploration with Little Memory.
STACS 2004: 246-257 |
