| 2012 | ||
|---|---|---|
| 44 | Paola Flocchini, David Ilcinkas, Nicola Santoro: Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica 62(3-4): 1006-1033 (2012) | |
| 2011 | ||
| 43 | Christian Glacet, Nicolas Hanusse, David Ilcinkas: The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391 | |
| 42 | David Ilcinkas, Ahmed Mouhamadou Wade: On the Power of Waiting When Exploring Public Transportation Systems. OPODIS 2011: 451-464 | |
| 41 | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing 24(2): 91-99 (2011) | |
| 40 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: How many oblivious robots can explore a line. Inf. Process. Lett. 111(20): 1027-1031 (2011) | |
| 39 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50): 6926-6937 (2011) | |
| 2010 | ||
| 38 | Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311 | |
| 37 | Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse: Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC 2010: 355-364 | |
| 36 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85 | |
| 35 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12 | |
| 34 | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278 | |
| 33 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Optimal Exploration of Terrains with Obstacles CoRR abs/1001.0639: (2010) | |
| 32 | Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc: Asynchronous deterministic rendezvous in bounded terrains CoRR abs/1001.0889: (2010) | |
| 31 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010) | |
| 30 | David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15): 1544-1557 (2010) | |
| 29 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14-15): 1583-1598 (2010) | |
| 2009 | ||
| 28 | Evangelos 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 | |
| 27 | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 | |
| 26 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 | |
| 25 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) | |
| 24 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs CoRR abs/0905.1737: (2009) | |
| 23 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21(6): 395-403 (2009) | |
| 22 | David Ilcinkas, Nicolas Nisse, David Soguet: The cost of monotonicity in distributed graph searching. Distributed Computing 22(2): 117-127 (2009) | |
| 2008 | ||
| 21 | Paola Flocchini, David Ilcinkas, Nicola Santoro: Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241 | |
| 20 | David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305 | |
| 19 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47 | |
| 18 | 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 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156(12): 2310-2319 (2008) | |
| 16 | David Ilcinkas, Andrzej Pelc: Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Inform. 82(1-2): 113-125 (2008) | |
| 15 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008) | |
| 14 | David Ilcinkas: Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1-3): 236-242 (2008) | |
| 2007 | ||
| 13 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 | |
| 12 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro: Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118 | |
| 11 | David Ilcinkas, Nicolas Nisse, David Soguet: The Cost of Monotonicity in Distributed Graph Searching. OPODIS 2007: 415-428 | |
| 2006 | ||
| 10 | 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 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree Exploration with an Oracle. MFCS 2006: 24-37 | |
| 8 | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187 | |
| 7 | David Ilcinkas: Setting Port Numbers for Fast Graph Exploration. SIROCCO 2006: 59-69 | |
| 2005 | ||
| 6 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346 | |
| 5 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. IWDC 2005: 13-24 | |
| 4 | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil: Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005: 140-154 | |
| 3 | 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 | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg: Graph Exploration by a Finite Automaton. MFCS 2004: 451-462 | |
| 1 | Pierre Fraigniaud, David Ilcinkas: Digraphs Exploration with Little Memory. STACS 2004: 246-257 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page