David Ilcinkas

2009
22	EE	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009)
2008
21	EE	Paola Flocchini, David Ilcinkas, Nicola Santoro: Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241
20	EE	David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305
19	EE	Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47
18	EE	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4): (2008)
17	EE	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156(12): 2310-2319 (2008)
16	EE	David Ilcinkas, Andrzej Pelc: Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Inform. 82(1-2): 113-125 (2008)
15	EE	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008)
14	EE	David Ilcinkas: Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1-3): 236-242 (2008)
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

Coauthor Index

1	Reuven Cohen	[5] [6] [18] [22]
2	Paola Flocchini	[12] [19] [21]
3	Pierre Fraigniaud	[1] [2] [3] [4] [5] [6] [8] [9] [10] [13] [15] [17] [18] [22]
4	Cyril Gavoille	[13]
5	Amos Korman	[5] [6] [18] [22]
6	Dariusz R. Kowalski	[20]
7	Nicolas Nisse	[11]
8	Guy Peer	[2] [3]
9	Andrzej Pelc	[2] [3] [8] [9] [12] [13] [15] [16] [17] [19] [20]
10	David Peleg	[2] [3] [5] [6] [18] [22]
11	Sergio Rajsbaum	[4] [10]
12	Nicola Santoro	[12] [19] [21]
13	David Soguet	[11]
14	Sébastien Tixeuil	[4] [10]