David Ilcinkas

82 papers A* 6A 7B 19C 3Misc 1Journal 38Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. STACS Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2024	—	`conf`	A State-of-the-Art Karp-Miller Algorithm Certified in Coq. TACAS (1) Thibault Hilaire, David Ilcinkas, Jérôme Leroux
2024	A*	`conf`	Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas
2023	J	`jnl`	Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2023	J	`jnl`	Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2022	J	`jnl`	Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica Stéphane Devismes, David Ilcinkas, Colette Johnen
2021	J	`jnl`	Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory Comput. Syst. David Ilcinkas, Ahmed Mouhamadou Wade
2020	J	`jnl`	Beachcombing on strips and islands. Theor. Comput. Sci. Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
2020	J	`jnl`	Deciding and verifying network properties locally with few output bits. Distributed Comput. Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
2020	J	`jnl`	Exploration of carrier-based time-varying networks: The power of waiting. Theor. Comput. Sci. David Ilcinkas, Ahmed Mouhamadou Wade
2020	C	`conf`	Framing Algorithms for Approximate Multicriteria Shortest Paths. ATMOS Nicolas Hanusse, David Ilcinkas, Antonin Lentz
2019	J	`jnl`	Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
2019	J	`jnl`	Linear Search by a Pair of Distinct-Speed Robots. Algorithmica Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2019	—	`ch.`	Oblivious Robots on Graphs: Exploration. Distributed Computing by Mobile Entities David Ilcinkas
2019	J	`jnl`	On asynchronous rendezvous in general graphs. Theor. Comput. Sci. Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
2019	Misc	`conf`	Silent self-stabilizing scheme for spanning-tree-like constructions. ICDCN Stéphane Devismes, David Ilcinkas, Colette Johnen
2019	—	`book`	Structural Information in Distributed Computing. David Ilcinkas
2018	J	`jnl`	Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. Theory Comput. Syst. David Ilcinkas, Ahmed Mouhamadou Wade
2018	J	`jnl`	On mobile agent verifiable problems. Inf. Comput. Evangelos Bampas, David Ilcinkas
2017	J	`jnl`	Robustness of the Rotor-Router Mechanism. Algorithmica Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik
2017	J	`jnl`	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR Stéphane Devismes, David Ilcinkas, Colette Johnen
2017	J	`jnl`	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. Discret. Math. Theor. Comput. Sci. Stéphane Devismes, David Ilcinkas, Colette Johnen
2016	A	`ed.`	Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings DISC Cyril Gavoille, David Ilcinkas
2016	B	`conf`	Linear Search by a Pair of Distinct-Speed Robots. SIROCCO Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak
2016	B	`conf`	On Mobile Agent Verifiable Problems. LATIN Evangelos Bampas, David Ilcinkas
2016	B	`conf`	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. OPODIS Stéphane Devismes, David Ilcinkas, Colette Johnen
2016	J	`jnl`	The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci. Christian Glacet, Nicolas Hanusse, David Ilcinkas
2015	C	`conf`	Beachcombing on Strips and Islands. ALGOSENSORS Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing
2015	A*	`conf`	Brief Announcement: Routing the Internet with Very Few Entries. PODC Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
2014	C	`conf`	Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
2014	B	`conf`	Distributedly Testing Cycle-Freeness. WG Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
2014	B	`conf`	Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. SIROCCO David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
2013	J	`jnl`	Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2013	B	`conf`	Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. SIROCCO David Ilcinkas, Ahmed Mouhamadou Wade
2013	A	`conf`	On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
2013	J	`jnl`	Worst-case optimal exploration of terrains with obstacles. Inf. Comput. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2012	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
2012	J	`jnl`	Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica Paola Flocchini, David Ilcinkas, Nicola Santoro
2011	J	`jnl`	Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2011	J	`jnl`	Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2011	J	`jnl`	How many oblivious robots can explore a line. Inf. Process. Lett. Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2011	B	`conf`	On the Power of Waiting When Exploring Public Transportation Systems. OPODIS David Ilcinkas, Ahmed Mouhamadou Wade
2011	B	`conf`	The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS Christian Glacet, Nicolas Hanusse, David Ilcinkas
2010	A	`conf`	Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel
2010	B	`conf`	Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Asynchronous deterministic rendezvous in bounded terrains CoRR Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Communication algorithms with advice. J. Comput. Syst. Sci. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2010	B	`conf`	Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
2010	J	`jnl`	Fast radio broadcasting with advice. Theor. Comput. Sci. David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2010	A*	`conf`	Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse
2010	J	`jnl`	Optimal Exploration of Terrains with Obstacles CoRR Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	—	`conf`	Optimal Exploration of Terrains with Obstacles. SWAT Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010	J	`jnl`	Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2009	—	`conf`	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2009	J	`jnl`	Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2009	A	`conf`	Euler Tour Lock-In Problem in the Rotor-Router Model. DISC Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski
2009	J	`jnl`	Labeling Schemes for Tree Representation. Algorithmica Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2009	B	`conf`	More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs CoRR Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009	J	`jnl`	The cost of monotonicity in distributed graph searching. Distributed Comput. David Ilcinkas, Nicolas Nisse, David Soguet
2008	B	`conf`	Fast Radio Broadcasting with Advice. SIROCCO David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2008	J	`jnl`	Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Informaticae David Ilcinkas, Andrzej Pelc
2008	J	`jnl`	Impact of memory size on graph exploration capability. Discret. Appl. Math. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008	J	`jnl`	Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2008	A	`conf`	Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC Paola Flocchini, David Ilcinkas, Nicola Santoro
2008	B	`conf`	Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2008	J	`jnl`	Setting port numbers for fast graph exploration. Theor. Comput. Sci. David Ilcinkas
2008	J	`jnl`	Tree exploration with advice. Inf. Comput. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2007	B	`conf`	Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2007	A*	`conf`	Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2007	B	`conf`	The Cost of Monotonicity in Distributed Graph Searching. OPODIS David Ilcinkas, Nicolas Nisse, David Soguet
2006	—	`—`	Complexité en espace de l'exploration de graphes. David Ilcinkas
2006	A*	`conf`	Oracle size: a new measure of difficulty for communication tasks. PODC Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006	B	`conf`	Setting Port Numbers for Fast Graph Exploration. SIROCCO David Ilcinkas
2006	—	`conf`	The Reduced Automata Technique for Graph Exploration Space Lower Bounds. Essays in Memory of Shimon Even Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
2006	B	`conf`	Tree Exploration with an Oracle. MFCS Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2005	J	`jnl`	Graph exploration by a finite automaton. Theor. Comput. Sci. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005	A*	`conf`	Label-Guided Graph Exploration by a Finite Automaton. ICALP Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	—	`conf`	Labeling Schemes for Tree Representation. IWDC Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	B	`conf`	Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
2004	A	`conf`	Digraphs Exploration with Little Memory. STACS Pierre Fraigniaud, David Ilcinkas
2004	B	`conf`	Graph Exploration by a Finite Automaton. MFCS Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg