default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Ilcinkas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c39]Colette Johnen
, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas:
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC 2024: 538-548- [c38]Thibault Hilaire, David Ilcinkas, Jérôme Leroux:
A State-of-the-Art Karp-Miller Algorithm Certified in Coq. TACAS (1) 2024: 370-389 - 2023
- [i6]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR abs/2307.06635 (2023) - [i5]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 abs/2307.16593 (2023) - 2022
- [j32]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica 84(1): 85-123 (2022) - 2021
- [j31]David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory Comput. Syst. 65(2): 257-273 (2021) - 2020
- [j30]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33(2): 169-187 (2020) - [j29]Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing:
Beachcombing on strips and islands. Theor. Comput. Sci. 806: 236-255 (2020) - [j28]David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of carrier-based time-varying networks: The power of waiting. Theor. Comput. Sci. 841: 50-61 (2020) - [c37]Nicolas Hanusse, David Ilcinkas, Antonin Lentz:
Framing Algorithms for Approximate Multicriteria Shortest Paths. ATMOS 2020: 11:1-11:19
2010 – 2019
- 2019
- [b2]David Ilcinkas:
Structural Information in Distributed Computing. University of Bordeaux, France, 2019 - [j27]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): 317-342 (2019) - [j26]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. 132: 299-309 (2019) - [j25]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: 80-90 (2019) - [c36]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Silent self-stabilizing scheme for spanning-tree-like constructions. ICDCN 2019: 158-167 - [p1]David Ilcinkas:
Oblivious Robots on Graphs: Exploration. Distributed Computing by Mobile Entities 2019: 218-233 - 2018
- [j24]Evangelos Bampas, David Ilcinkas:
On mobile agent verifiable problems. Inf. Comput. 260: 51-71 (2018) - [j23]David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. Theory Comput. Syst. 62(5): 1144-1160 (2018) - 2017
- [j22]Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - [j21]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) - [i4]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR abs/1703.03315 (2017) - 2016
- [j20]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The impact of dynamic events on the number of errors in networks. Theor. Comput. Sci. 627: 1-12 (2016) - [c35]Evangelos Bampas, David Ilcinkas:
On Mobile Agent Verifiable Problems. LATIN 2016: 123-137 - [c34]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. OPODIS 2016: 10:1-10:16 - [c33]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: 195-211 - [e1]Cyril Gavoille, David Ilcinkas:
Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. Lecture Notes in Computer Science 9888, Springer 2016, ISBN 978-3-662-53425-0 [contents] - 2015
- [c32]Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing:
Beachcombing on Strips and Islands. ALGOSENSORS 2015: 155-168 - [c31]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
Brief Announcement: Routing the Internet with Very Few Entries. PODC 2015: 33-35 - 2014
- [c30]David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade:
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. SIROCCO 2014: 250-262 - [c29]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS 2014: 120-134 - [c28]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu:
Distributedly Testing Cycle-Freeness. WG 2014: 15-28 - 2013
- [j19]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65(3): 562-583 (2013) - [j18]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225: 16-28 (2013) - [c27]David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. SIROCCO 2013: 13-23 - [c26]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC 2013: 418-432 - 2012
- [j17]Paola Flocchini, David Ilcinkas, Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. Algorithmica 62(3-4): 1006-1033 (2012) - [j16]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: 60-76 (2012) - 2011
- [j15]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011) - [j14]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
How many oblivious robots can explore a line. Inf. Process. Lett. 111(20): 1027-1031 (2011) - [j13]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50): 6926-6937 (2011) - [c25]Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391 - [c24]David Ilcinkas, Ahmed Mouhamadou Wade:
On the Power of Waiting When Exploring Public Transportation Systems. OPODIS 2011: 451-464 - 2010
- [j12]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010) - [j11]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc:
Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15): 1544-1557 (2010) - [j10]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) - [c23]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 - [c22]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85 - [c21]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12 - [c20]Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel:
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311 - [c19]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas:
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278 - [i3]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. CoRR abs/1001.0639 (2010) - [i2]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. CoRR abs/1001.0889 (2010)
2000 – 2009
- 2009
- [j9]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) - [j8]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21(6): 395-403 (2009) - [j7]David Ilcinkas, Nicolas Nisse, David Soguet:
The cost of monotonicity in distributed graph searching. Distributed Comput. 22(2): 117-127 (2009) - [c18]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 - [c17]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 - [c16]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 - [i1]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) - 2008
- [j6]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Impact of memory size on graph exploration capability. Discret. Appl. Math. 156(12): 2310-2319 (2008) - [j5]David Ilcinkas, Andrzej Pelc:
Impact of Asynchrony on the Behavior of Rational Selfish Agents. Fundam. Informaticae 82(1-2): 113-125 (2008) - [j4]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008) - [j3]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4): 42:1-42:18 (2008) - [j2]David Ilcinkas:
Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1-3): 236-242 (2008) - [c15]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. SIROCCO 2008: 33-47 - [c14]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc:
Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305 - [c13]Paola Flocchini, David Ilcinkas, Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241 - 2007
- [c12]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - [c11]Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118 - [c10]David Ilcinkas, Nicolas Nisse, David Soguet:
The Cost of Monotonicity in Distributed Graph Searching. OPODIS 2007: 415-428 - 2006
- [b1]David Ilcinkas:
Complexité en espace de l'exploration de graphes. University of Paris-Sud, Orsay, France, 2006 - [c9]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 - [c8]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree Exploration with an Oracle. MFCS 2006: 24-37 - [c7]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187 - [c6]David Ilcinkas:
Setting Port Numbers for Fast Graph Exploration. SIROCCO 2006: 59-69 - 2005
- [j1]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) - [c5]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346 - [c4]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. IWDC 2005: 13-24 - [c3]Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil:
Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005: 140-154 - 2004
- [c2]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph Exploration by a Finite Automaton. MFCS 2004: 451-462 - [c1]Pierre Fraigniaud, David Ilcinkas:
Digraphs Exploration with Little Memory. STACS 2004: 246-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
