David Ilcinkas

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 23

Top Venues

Theor. Comput. Sci.

Algorithmica

CoRR

SIROCCO

University of Paris-Sud, Orsay, France (PHD)

Education History

University of Paris-Sud, Orsay, France

PHD

Publications

Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR (2023)
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR (2023)
Stéphane Devismes, David Ilcinkas, Colette Johnen
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica 84 (1) (2022)
David Ilcinkas, Ahmed Mouhamadou Wade
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory Comput. Syst. 65 (2) (2021)
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33 (2) (2020)
David Ilcinkas, Ahmed Mouhamadou Wade
Exploration of carrier-based time-varying networks: The power of waiting. Theor. Comput. Sci. 841 (2020)
Nicolas Hanusse, David Ilcinkas, Antonin Lentz
Framing Algorithms for Approximate Multicriteria Shortest Paths. ATMOS (2020)
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
Beachcombing on strips and islands. Theor. Comput. Sci. 806 (2020)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81 (1) (2019)
Stéphane Devismes, David Ilcinkas, Colette Johnen
Silent self-stabilizing scheme for spanning-tree-like constructions. ICDCN (2019)
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753 (2019)
Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. 132 (2019)
Evangelos Bampas, David Ilcinkas
On mobile agent verifiable problems. Inf. Comput. 260 (2018)
David Ilcinkas, Ahmed Mouhamadou Wade
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. Theory Comput. Syst. 62 (5) (2018)
Stéphane Devismes, David Ilcinkas, Colette Johnen
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR (2017)
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
Robustness of the Rotor-Router Mechanism. Algorithmica 78 (3) (2017)
Stéphane Devismes, David Ilcinkas, Colette Johnen
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Evangelos Bampas, David Ilcinkas
On Mobile Agent Verifiable Problems. LATIN (2016)
Christian Glacet, Nicolas Hanusse, David Ilcinkas
The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci. 627 (2016)
Stéphane Devismes, David Ilcinkas, Colette Johnen
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. OPODIS (2016)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
Linear Search by a Pair of Distinct-Speed Robots. SIROCCO (2016)
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
Brief Announcement: Routing the Internet with Very Few Entries. PODC (2015)
Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
Beachcombing on Strips and Islands. ALGOSENSORS (2015)
David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. SIROCCO (2014)
Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS (2014)
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
Distributedly Testing Cycle-Freeness. WG (2014)
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65 (3) (2013)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225 (2013)
David Ilcinkas, Ahmed Mouhamadou Wade
Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. SIROCCO (2013)
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC (2013)
Paola Flocchini, David Ilcinkas, Nicola Santoro
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica 62 (3-4) (2012)
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444 (2012)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412 (50) (2011)
David Ilcinkas, Ahmed Mouhamadou Wade
On the Power of Waiting When Exploring Public Transportation Systems. OPODIS (2011)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24 (2) (2011)
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
How many oblivious robots can explore a line. Inf. Process. Lett. 111 (20) (2011)
Christian Glacet, Nicolas Hanusse, David Ilcinkas
The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS (2011)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG (2010)
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
Communication algorithms with advice. J. Comput. Syst. Sci. 76 (3-4) (2010)
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
Fast radio broadcasting with advice. Theor. Comput. Sci. 411 (14-15) (2010)
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)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC (2010)
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411 (14-15) (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Optimal Exploration of Terrains with Obstacles. SWAT (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Optimal Exploration of Terrains with Obstacles CoRR (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous deterministic rendezvous in bounded terrains CoRR (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO (2010)
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)
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21 (6) (2009)
Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Euler Tour Lock-In Problem in the Rotor-Router Model. DISC (2009)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) (2009)
David Ilcinkas, Nicolas Nisse, David Soguet
The cost of monotonicity in distributed graph searching. Distributed Comput. 22 (2) (2009)
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
Labeling Schemes for Tree Representation. Algorithmica 53 (1) (2009)
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 (2009)
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
Fast Radio Broadcasting with Advice. SIROCCO (2008)
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO (2008)
David Ilcinkas, Andrzej Pelc
Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Informaticae 82 (1-2) (2008)
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
Tree exploration with advice. Inf. Comput. 206 (11) (2008)
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
Impact of memory size on graph exploration capability. Discret. Appl. Math. 156 (12) (2008)
Paola Flocchini, David Ilcinkas, Nicola Santoro
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC (2008)
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4 (4) (2008)
David Ilcinkas
Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401 (1-3) (2008)
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP (2007)
David Ilcinkas, Nicolas Nisse, David Soguet
The Cost of Monotonicity in Distributed Graph Searching. OPODIS (2007)
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS (2007)
David Ilcinkas
Setting Port Numbers for Fast Graph Exploration. SIROCCO (2006)
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
Oracle size: a new measure of difficulty for communication tasks. PODC (2006)
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)
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
Tree Exploration with an Oracle. MFCS (2006)
Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO (2005)
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
Graph exploration by a finite automaton. Theor. Comput. Sci. 345 (2-3) (2005)
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
Label-Guided Graph Exploration by a Finite Automaton. ICALP (2005)
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
Labeling Schemes for Tree Representation. IWDC (2005)
Pierre Fraigniaud, David Ilcinkas
Digraphs Exploration with Little Memory. STACS (2004)
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
Graph Exploration by a Finite Automaton. MFCS (2004)

David Ilcinkas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David Ilcinkas