dblp.uni-trier.dewww.uni-trier.de

David Ilcinkas Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
26EEEvangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Euler Tour Lock-In Problem in the Rotor-Router Model. DISC 2009: 423-435
25EEColin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422
24EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009)
23EEJurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, R. Martin, Kunihiko Sadakane, W.-K. Sung: More efficient periodic traversal in anonymous undirected graphs CoRR abs/0905.1737: (2009)
22EEPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21(6): 395-403 (2009)
2008
21EEPaola Flocchini, David Ilcinkas, Nicola Santoro: Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241
20EEDavid Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305
19EEPaola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47
18EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4): (2008)
17EEPierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156(12): 2310-2319 (2008)
16EEDavid Ilcinkas, Andrzej Pelc: Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Inform. 82(1-2): 113-125 (2008)
15EEPierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008)
14EEDavid Ilcinkas: Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1-3): 236-242 (2008)
2007
13EEPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242
12EEPaola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118
11EEDavid Ilcinkas, Nicolas Nisse, David Soguet: The Cost of Monotonicity in Distributed Graph Searching. OPODIS 2007: 415-428
2006
10EEPierre 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
9EEPierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree Exploration with an Oracle. MFCS 2006: 24-37
8EEPierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187
7EEDavid Ilcinkas: Setting Port Numbers for Fast Graph Exploration. SIROCCO 2006: 59-69
2005
6EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346
5EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. IWDC 2005: 13-24
4EEPierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil: Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005: 140-154
3EEPierre 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
2EEPierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg: Graph Exploration by a Finite Automaton. MFCS 2004: 451-462
1EEPierre Fraigniaud, David Ilcinkas: Digraphs Exploration with Little Memory. STACS 2004: 246-257

Coauthor Index

1Evangelos Bampas [26]
2Reuven Cohen [5] [6] [18] [24]
3Colin Cooper [25]
4Jurek Czyzowicz [23]
5Stefan Dobrev [23]
6Paola Flocchini [12] [19] [21]
7Pierre Fraigniaud [1] [2] [3] [4] [5] [6] [8] [9] [10] [13] [15] [17] [18] [22] [24]
8Leszek Gasieniec [23] [26]
9Cyril Gavoille [13] [22]
10Nicolas Hanusse [26]
11Jesper Jansson [23]
12Ralf Klasing [23] [25] [26]
13Amos Korman [5] [6] [18] [24]
14Adrian Kosowski [25] [26]
15Dariusz R. Kowalski [20]
16Yannis Lignos [23]
17R. Martin [23]
18Nicolas Nisse [11]
19Guy Peer [2] [3]
20Andrzej Pelc [2] [3] [8] [9] [12] [13] [15] [16] [17] [19] [20] [22]
21David Peleg [2] [3] [5] [6] [18] [24]
22Sergio Rajsbaum [4] [10]
23Kunihiko Sadakane [23]
24Nicola Santoro [12] [19] [21]
25David Soguet [11]
26W.-K. Sung [23]
27Sébastien Tixeuil [4] [10]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)