List of publications
Editorship
Book Chapters
- [B2] D. Ilcinkas.
Oblivious Robots on Graphs: Exploration.
Distributed Computing by Mobile Entities,
LNCS 11340, pages 218-233, 2019.
DOI,
HAL
- [B1] P. Fraigniaud, D. Ilcinkas, S. Rajsbaum and S. Tixeuil. The
reduced automata technique for graph exploration space lower bounds.
Essays in Memory of Shimon Even,
LNCS 3895, pages 1-26, 2006. DOI,
HAL
International Journals
- [J32] S. Devismes, D. Ilcinkas, and C. Johnen.
Optimized Silent Self-Stabilizing Scheme for Tree-based Constructions.
Algorithmica, volume 84, pages 85-123, 2022.
DOI,
HAL
- [J31] D. Ilcinkas and A. M. Wade.
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead.
Theory of Computing Systems, volume 65, pages 257-273, 2021.
DOI,
HAL
- [J30] D. Ilcinkas and A. M. Wade.
Exploration of carrier-based time-varying networks: The power of waiting.
Theoretical Computer Science, volume 841, pages 50-61, 2020.
DOI,
HAL
- [J29] H. Arfaoui, P. Fraigniaud, D. Ilcinkas, F. Mathieu, and A. Pelc.
Deciding and verifying network properties locally with few output bits.
Distributed Computing, volume 33, pages 169-187, 2020.
DOI,
HAL
- [J28] C. Glacet, N. Hanusse, D. Ilcinkas,
and C. Johnen. Disconnected components detection
and rooted shortest-path tree maintenance in networks.
Journal of Parallel and Distributed Computing,
volume 132, pages 299-309, 2019. DOI,
HAL
- [J27] E. Bampas, J. Czyzowicz, D. Ilcinkas, and R. Klasing.
Beachcombing on strips and islands.
Theoretical Computer Science, volume 806, pages 236-255, 2020.
DOI,
HAL
- [J26] E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop-Butucaru, and S. Tixeuil.
On Asynchronous Rendezvous in General Graphs.
Theoretical Computer Science, volume 753, pages 80-90, 2019.
DOI,
HAL
- [J25] E. Bampas, J. Czyzowicz, L. Gąsieniec, D. Ilcinkas, R. Klasing, T. Kociumaka, and D. Pająk.
Linear Search by a Pair of Distinct-Speed Robots.
Algorithmica, volume 81 (1), pages 317-342, 2019.
DOI,
HAL
- [J24] E. Bampas and D. Ilcinkas.
On mobile agent verifiable problems.
Information and Computation, volume 260, pages 51-71, 2018.
DOI,
HAL
- [J23] S. Devismes, D. Ilcinkas and C. Johnen. Self-Stabilizing
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
Discrete Mathematics and Theoretical Computer Science, volume 19 (3), 2017.
DOI,
HAL
- [J22] D. Ilcinkas and A. Wade. Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring.
Theory of Computing Systems, volume 62 (5), pages 1144-1160, 2018.
DOI,
HAL
- [J21] E. Bampas, L. Gąsieniec, N. Hanusse,
D. Ilcinkas, R. Klasing, A. Kosowski, and T. Radzik. Robustness of the Rotor-Router Mechanism.
Algorithmica, volume 78 (3), pages 869-895, 2017.
DOI,
HAL
- [J20] C. Glacet, N. Hanusse, and D. Ilcinkas. The impact of dynamic
events on the number of errors in networks. Theoretical Computer
Science, volume 627, pages 1-12, 2016. DOI,
HAL
- [J19] J. Czyzowicz, D. Ilcinkas, A.
Labourel, and A. Pelc. Worst-case optimal
exploration of terrains with obstacles. Information
and Computation, volume 225, pages 16-28, 2013. DOI,
HAL
- [J18] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. Computing Without
Communicating: Ring Exploration by Asynchronous Oblivious Robots.
Algorithmica, volume 65 (3),
pages 562-583, 2013. DOI,
HAL
- [J17] J. Czyzowicz, S. Dobrev, L.
Gąsieniec, D. Ilcinkas, J. Jansson, R. Klasing, I. Lignos, R. Martin, K.
Sadakane, and W.-K. Sung. More Efficient
Periodic Traversal in Anonymous Undirected Graphs. Theoretical
Computer Science, volume 444, pages 60-76, 2012. DOI,
HAL
- [J16] J. Czyzowicz, D. Ilcinkas, A.
Labourel, and A. Pelc. Asynchronous
deterministic rendezvous in bounded terrains. Theoretical
Computer Science, volume 412 (50), pages 6926-6937, 2011. DOI,
HAL
- [J15] C. Cooper, D. Ilcinkas, R. Klasing,
and A. Kosowski. Derandomizing Random
Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
Distributed Computing, volume 24
(2), pages 91-99, 2011. DOI,
HAL
- [J14] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. How many oblivious robots can
explore a line. Information
Processing Letters, volume 111 (20), pages 1027-1031, 2011. DOI,
HAL
- [J13] P. Flocchini, D. Ilcinkas, and N.
Santoro. Ping Pong in Dangerous
Graphs: Optimal Black Hole Search with Pebbles. Algorithmica,
volume 62 (3-4), pages 1006--1033, 2012. DOI,
HAL
- [J12] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. Remembering Without
Memory: Tree Exploration by Asynchronous Oblivious Robots. Theoretical
Computer
Science, volume 411 (14-15), pages 1583-1598, 2010. DOI,
HAL
- [J11] D. Ilcinkas, D. R. Kowalski and A.
Pelc. Fast Radio Broadcasting with
Advice. Theoretical Computer
Science, volume 411 (14-15), pages 1544-1557, 2010. DOI,
HAL
- [J10] D. Ilcinkas, N. Nisse and D. Soguet.
The cost of monotonicity in
distributed graph searching. Distributed
Computing, volume 22 (2), pages 117-127, 2009. DOI,
HAL
- [J9] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Communication algorithms with advice.
Journal of Computer and System Sciences,
volume 76 (3-4), pages 222-232, 2010. DOI,
HAL
- [J8] P. Fraigniaud, C. Gavoille, D.
Ilcinkas and A. Pelc. Distributed
computing with advice: information sensitivity of graph coloring.
Distributed Computing, volume 21
(6), pages 395-403, 2009. DOI,
HAL
- [J7] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Tree Exploration with Advice. Information
and Computation, volume 206 (11), pages 1276-1287, 2008. DOI,
HAL
- [J6] D. Ilcinkas. Setting Port
Numbers for Fast Graph Exploration. Theoretical
Computer Science, volume 401 (1-3), pages 236-242, 2008. DOI,
HAL
- [J5] R. Cohen, P. Fraigniaud, D. Ilcinkas,
A. Korman and D. Peleg. Label-Guided Graph
Exploration by a Finite Automaton. ACM
Transactions on Algorithms, volume 4 (4), article 42, 2008. DOI,
HAL
- [J4] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Impact of memory size on graph exploration
capability. Discrete Applied
Mathematics, volume 156 (12), pages 2310-2319, 2008. DOI,
HAL
- [J3] D. Ilcinkas and A. Pelc. Impact
of Asynchrony on the Behavior of Rational Selfish Agents. Fundamenta
Informaticae, volume 82 (1-2), pages 113-125, 2008. HAL
- [J2] R. Cohen, P. Fraigniaud, D. Ilcinkas,
A. Korman and D. Peleg. Labeling Schemes for
Tree Representation. Algorithmica,
volume 53 (1), pages 1-15, 2009. DOI,
HAL
- [J1] P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc and D. Peleg. Graph
Exploration by a Finite Automaton. Theoretical
Computer Science, volume 345 (2-3), pages 331-344, 2005. DOI,
HAL
International Conferences
- [C39] S. Devismes, D. Ilcinkas, C. Johnen, and F. Mazoit.
Being Efficient in Time, Space, and Workload: a Self-stabilizing Unison and Its Consequences.
In 42nd
International Symposium on Theoretical Aspects of Computer Science (STACS'25),
LIPIcs 327, pages 30:1-30:18, 2025. DOI,
HAL
- [C38] S. Devismes, D. Ilcinkas, C. Johnen, and F. Mazoit.
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient.
In 43rd
ACM Symposium on Principles of Distributed Computing (PODC'24),
pages 538-548, 2024. DOI,
HAL
- [C37] T. Hilaire, D. Ilcinkas and J. Leroux.
A State-of-the-Art Karp-Miller Algorithm Certified in Coq.
In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'24), LNCS 14570, pages 370-389, 2024.
DOI,
HAL
- [C36] N. Hanusse, D. Ilcinkas and A. Lentz.
Framing Algorithms for Approximate Multicriteria Shortest Paths.
In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'20), OASIcs 85, pages 11:1-11:19, 2020.
DOI,
HAL
- [C35] S. Devismes, D. Ilcinkas, and C. Johnen.
Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions.
In 20th International Conference on Distributed Computing and Networking (ICDCN'19), pages 158-167, 2019.
DOI,
HAL
- [C34] S. Devismes, D. Ilcinkas, and C. Johnen. Self-Stabilizing
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
In 20th International Conference On
Principles Of Distributed Systems (OPODIS'16),
LIPIcs 70, pages 10:1-10:16, 2017. DOI,
HAL
- [C33] E. Bampas, J. Czyzowicz, L. Gąsieniec, D. Ilcinkas, R. Klasing, T. Kociumaka, and D. Pająk.
Linear Search by a Pair of Distinct-Speed Robots. In 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO'16),
LNCS 9988, pages 195-211, 2016. DOI,
HAL
- [C32] E. Bampas and D. Ilcinkas.
On Mobile Agent Verifiable Problems. In 12th Latin American
Theoretical Informatics Symposium (LATIN'16),
LNCS 9644, pages 123-137, 2016. DOI,
HAL
- [C31] E. Bampas, J. Czyzowicz, D. Ilcinkas, and R. Klasing.
Beachcombing on Strips and Islands. In 11th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS'15),
LNCS 9536, pages 155-168, 2016. DOI,
HAL
- [C30] C. Gavoille, C. Glacet, N. Hanusse,
and D. Ilcinkas. Brief Announcement: Routing the
Internet with very few entries. In 34th
Annual ACM Symposium on Principles of Distributed Computing (PODC'15),
pages 33-35, 2015. DOI,
HAL
- [C29] C. Glacet, N. Hanusse, D. Ilcinkas,
and C. Johnen. Disconnected Components Detection
and Rooted Shortest-Path Tree Maintenance in Networks. In 16th
International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS'14),
LNCS 8756, pages 120-134, 2014. DOI,
HAL
- [C28] H. Arfaoui, P. Fraigniaud, D.
Ilcinkas, and F. Mathieu. Distributedly Testing
Cycle-Freeness. In 40th
International Workshop on Graph-Theoretic Concepts in Computer Science
(WG'14), LNCS 8747, pages 15-28,
2014. DOI,
HAL
- [C27] D. Ilcinkas, R. Klasing, and A. M.
Wade. Exploration of Constantly Connected
Dynamic Graphs Based on Cactuses. In 21st
International Colloquium on Structural Information and Communication
Complexity (SIROCCO'14),
LNCS 8576, pages 250-262, 2014. DOI,
HAL
- [C26] C. Gavoille, C. Glacet, N. Hanusse,
and D. Ilcinkas. On the Communication Complexity
of Distributed Name-Independent Routing Schemes. In 27th
International Symposium on Distributed Computing (DISC'13),
LNCS 8205, pages 418-432, 2013. DOI,
HAL
- [C25] D. Ilcinkas and A. Wade. Exploration
of the T-Interval-Connected Dynamic Graphs: the Case of the Ring.
In 20th International Colloquium on
Structural Information and Communication Complexity (SIROCCO'13),
LNCS 8179, pages 13-23, 2013. DOI,
HAL
- [C24] D. Ilcinkas and A. M. Wade. On
the Power of Waiting when Exploring Public Transportation Systems.
In 15th International Conference On
Principles Of Distributed Systems (OPODIS'11),
LNCS 7109, pages 451-464, 2011. DOI,
HAL
- [C23] C. Glacet, N. Hanusse and D.
Ilcinkas. The impact of edge deletions on
the number of errors in networks. In 15th
International Conference On Principles Of Distributed Systems (OPODIS'11),
LNCS 7109, pages 378-391, 2011. DOI,
HAL
- [C22] E. Bampas, J. Czyzowicz, L.
Gąsieniec, D. Ilcinkas, and A. Labourel. Almost
Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.
In 24th International Symposium on
Distributed Computing (DISC'10),
LNCS 6343, pages 297-311, 2010. DOI,
HAL
- [C21] N. Hanusse, D. Ilcinkas, A.
Kosowski, and N. Nisse. Locating a Target with
an Agent Guided by Unreliable Local Advice. In 29th
Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed
Computing (PODC'10),
pages 355-364, 2010. DOI,
HAL
- [C20] N. Bonichon, C. Gavoille, N.
Hanusse, and D. Ilcinkas. Connections between
Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. In
36th International Workshop on Graph
Theoretic Concepts in Computer Science (WG'10),
,
2010. DOI,
HAL
- [C19] J. Czyzowicz, D. Ilcinkas, A.
Labourel, and A. Pelc. Optimal Exploration of
Terrains with Obstacles. In 12th
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'10),
LNCS 6139, pages 1-12, 2010. DOI,
HAL (slides)
- [C18] J. Czyzowicz, D. Ilcinkas, A.
Labourel, and A. Pelc. Asynchronous
deterministic rendezvous in bounded terrains. In 17th
International Colloquium on Structural Information and Communication
Complexity (SIROCCO'10),
LNCS
6058, pages 72-85, 2010. DOI,
HAL
- [C17] E. Bampas, L. Gąsieniec, N. Hanusse,
D. Ilcinkas, R. Klasing, and A. Kosowski. Euler Tour
Lock-in Problem in the Rotor-Router Model. In 23rd
International Symposium on Distributed Computing (DISC'09),
LNCS 5805, pages 423-435, 2009. DOI,
HAL (slides)
- [C16] C. Cooper, D. Ilcinkas, R. Klasing,
and A. Kosowski. Derandomizing Random Walks in
Undirected Graphs Using Locally Fair Exploration Strategies. In 36th
International
Colloquium on Automata, Languages and Programming (ICALP'09),
LNCS
5556, pages 411-422, 2009. DOI,
HAL
- [C15] J. Czyzowicz, S. Dobrev, L.
Gąsieniec, D. Ilcinkas, J. Jansson, R. Klasing, I. Lignos, R. Martin, K.
Sadakane, and W.-K. Sung. More Efficient
Periodic Traversal in Anonymous Undirected Graphs. In 16th
International
Colloquium on Structural Information and Communication Complexity
(SIROCCO'09), LNCS 5869, pages
167-181, 2009. DOI,
HAL
- [C14] P. Flocchini, D. Ilcinkas and N.
Santoro. Ping Pong in Dangerous Graphs: Optimal
Black Hole Search with Pure Tokens. In 22nd
International Symposium on Distributed Computing (DISC'08),
LNCS 5218, pages 227-241, 2008. DOI,
HAL (slides)
- [C13] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. Remembering without Memory:
Tree Exploration by Asynchronous Oblivious Robots. In 15th
International Colloquium on Structural Information and Communication
Complexity (SIROCCO'08),
LNCS
5058,
pages 33-47, 2008. DOI,
HAL (slides)
- [C12] D. Ilcinkas, D. R. Kowalski and A.
Pelc. Fast Radio Broadcasting with Advice.
In 15th International Colloquium on
Structural Information and Communication Complexity (SIROCCO'08),
LNCS
5058,
pages 291-305, 2008. DOI,
HAL
- [C11] D. Ilcinkas, N. Nisse and D. Soguet.
The Cost of Monotonicity in Distributed Graph
Searching. In 11th
International Conference On Principles Of Distributed Systems (OPODIS'07),
LNCS 4878, pages 415-428, 2007. DOI,
HAL
- [C10] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. Computing Without
Communicating: Ring Exploration by Asynchronous Oblivious Robots.
In 11th International Conference On
Principles Of Distributed Systems (OPODIS'07),
LNCS 4878, pages 105-118, 2007. DOI,
HAL (slides)
- [C9] P. Fraigniaud, C. Gavoille, D.
Ilcinkas and A. Pelc. Distributed Computing
with Advice: Information Sensitivity of Graph Coloring. In 34th
International Colloquium on Automata, Languages and Programming
(ICALP'07), LNCS 4596, pages
231-242, 2007. DOI,
HAL (slides)
- [C8] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Tree Exploration with an Oracle. In 31st
International Symposium on Mathematical Foundations of Computer
Science (MFCS'06), LNCS
4162, pages 24-37, 2006. DOI,
HAL
- [C7] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Oracle Size: a New Measure of Difficulty
for Communication Tasks. In 25th
Annual
ACM Symposium on Principles of Distributed Computing (PODC'06),
pages 179-187, 2006. DOI,
HAL (slides)
- [C6] D. Ilcinkas. Setting
Port Numbers for Fast Graph Exploration. In 13th
International Colloquium on Structural Information and Communication
Complexity (SIROCCO'06),
LNCS
4056,
pages 59-69, 2006. DOI,
HAL (slides)
- [C5] R. Cohen, P. Fraigniaud, D. Ilcinkas,
A. Korman and D. Peleg. Labeling Schemes for Tree
Representation. In 7th
International Workshop on Distributed Computing (IWDC'05),
LNCS
3741,
pages 13-24, 2005. DOI,
HAL
- [C4] R. Cohen, P. Fraigniaud, D. Ilcinkas,
A. Korman and D. Peleg. Label-Guided Graph
Exploration by a Finite Automaton. In 32nd
International Colloquium on Automata, Languages and Programming
(ICALP'05), LNCS 3580, pages
335-346, 2005. DOI,
HAL (slides)
- [C3] P. Fraigniaud, D. Ilcinkas, S.
Rajsbaum and S. Tixeuil. Space Lower Bounds
for Graph Exploration via Reduced Automata. In 12th
International Colloquium on Structural Information and Communication
Complexity (SIROCCO'05),
LNCS
3499,
pages 140-154, 2005. DOI,
HAL (slides)
- [C2] P. Fraigniaud, D. Ilcinkas, G. Peer,
A. Pelc and D. Peleg. Graph Exploration by a
Finite Automaton. In 29th
International Symposium on Mathematical Foundations of Computer
Science (MFCS'04), LNCS
3153, pages 451-462, 2004. DOI,
HAL (slides)
- [C1] P. Fraigniaud and D. Ilcinkas. Digraphs
Exploration with Little Memory. In 21st
Symposium on Theoretical Aspects of Computer Science (STACS'04),
LNCS
2996, pages 246-257, 2004. DOI,
HAL (slides)
National conferences
- [N17] S. Devismes, D. Ilcinkas, C. Johnen, and F. Mazoit.
Nous aussi on fait du « log * » !.
In 26èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'24),
hal-04566761, 2024. HAL
- [N16] S. Devismes, D. Ilcinkas, and C. Johnen.
Schéma général auto-stabilisant et silencieux de
constructions de type arbres couvrants. In 20èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'18),
hal-01781338, 2018. HAL
- [N15] C. Gavoille, C. Glacet, N. Hanusse,
and D. Ilcinkas. Router dans Internet avec
quinze entrées. In 17èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'15),
hal-01149335, 2015. HAL
- [N14] E. Bampas and D. Ilcinkas. Problèmes
vérifiables par agents mobiles. In 17èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'15),
hal-01148475, 2015. HAL
- [N13] C. Glacet, N. Hanusse, and D.
Ilcinkas. Impact de la dynamique sur la
fiabilité d'informations de routage. In 16èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'14),
pages 86-89, 2014. HAL
- [N12] C. Gavoille, C. Glacet, N. Hanusse,
and D. Ilcinkas. Algorithme distribué de
routage compact en temps optimal. In 15èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'13),
pages 117-120, 2013. HAL
- [N11] D. Ilcinkas and A. M. Wade. Exploration
des graphes dynamiques T-intervalle-connexes : le cas de l'anneau.
In 15èmes Rencontres Francophones sur
les Aspects Algorithmiques des Télécommunications (AlgoTel'13),
pages 73-76, 2013. HAL
- [N10] D. Ilcinkas and A. M. Wade. Puissance
de l'attente aux stations pour l'exploration des réseaux de transport
public. In 14èmes Rencontres
Francophones sur les Aspects Algorithmiques des Télécommunications
(AlgoTel'12), pages 107-110,
2012. HAL
- [N9] A. M. Wade and D. Ilcinkas. L'exploration
des réseaux de transport - La puissance de l'attente aux stations.
In Colloque National sur la Recherche
en Informatique et ses Applications (CNRIA'12),
pages 59-66, 2012.
- [N8] N. Bonichon, C. Gavoille, N. Hanusse,
D. Ilcinkas, and L. Perkovic. Comment
résumer le plan. In 12èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'10),
pages 55-58, 2010. HAL
- [N7] N. Hanusse, D. Ilcinkas, A. Kosowski,
and N. Nisse. Comment battre la marche
aléatoire en comptant ?. In 12èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'10),
pages 27-30, 2010. HAL
- [N6] P. Flocchini, D. Ilcinkas, and N.
Santoro. Recherche optimale de trou noir
avec cailloux. In 10èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'08),
pages 101-104, 2008. HAL
(slides)
- [N5] D. Ilcinkas, N. Nisse, and D. Soguet.
Le coût de la monotonie dans les stratégies
d'encerclement réparti. In 10èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'08),
pages 33-36, 2008. HAL
- [N4] P. Flocchini, D. Ilcinkas, A. Pelc
and N. Santoro. Exploration d'arbres par des
équipes de robots asynchrones et sans mémoire. In 9èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'07),
pages 99-102, 2007. HAL
(slides)
- [N3] P. Fraigniaud, D. Ilcinkas and A.
Pelc. Exploration d'arbres avec oracle. In
8èmes Rencontres Francophones sur les
Aspects Algorithmiques des Télécommunications (AlgoTel'06),
pages 25-28, 2006. HAL
(slides)
- [N2] R. Cohen, P. Fraigniaud, D. Ilcinkas,
A. Korman and D. Peleg. Exploration par un
automate fini de réseaux anonymes étiquetés. In 7èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'05),
pages 9-12, 2005. HAL
(slides)
- [N1] P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc and D. Peleg. Exploration
de réseaux par un robot. In 6èmes
Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (AlgoTel'04),
pages 123-127, 2004. HAL
(slides)
Thesis