Skip to Main content Skip to Navigation


...
hal-00464580v1  Journal articles
David IlcinkasDariusz R. KowalskiAndrzej Pelc. Fast radio broadcasting with advice
Theoretical Computer Science, Elsevier, 2010, 411 (14-15), pp.1544-1557. ⟨10.1016/j.tcs.2010.01.004⟩
...
hal-00341613v1  Journal articles
David Ilcinkas. Setting port numbers for fast graph exploration
Theoretical Computer Science, Elsevier, 2008, 401 (1-3), pp.236-242. ⟨10.1016/j.tcs.2008.03.035⟩
...
inria-00476151v1  Conference papers
Nicolas BonichonCyril GavoilleNicolas HanusseDavid IlcinkasLjubomir Perkovic. Comment résumer le plan
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
...
hal-00985637v1  Conference papers
Christian GlacetNicolas HanusseDavid Ilcinkas. Impact de la dynamique sur la fiabilité d'informations de routage
ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
...
inria-00475863v1  Conference papers
Nicolas HanusseDavid IlcinkasAdrian KosowskiNicolas Nisse. Comment battre la marche aléatoire en comptant ?
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
...
hal-00643668v1  Journal articles
Paola FlocchiniDavid IlcinkasAndrzej PelcNicola Santoro. How many oblivious robots can explore a line
Information Processing Letters, Elsevier, 2011, 111 (20), pp.1027-1031. ⟨10.1016/j.ipl.2011.07.018⟩
...
hal-00412058v1  Journal articles
Pierre FraigniaudDavid IlcinkasAndrzej Pelc. Communication algorithms with advice
Journal of Computer and System Sciences, Elsevier, 2010, 76 (3-4), pp.222-232. ⟨10.1016/j.jcss.2009.07.002⟩
...
hal-01084297v1  Conference papers
Heger ArfaouiPierre FraigniaudDavid IlcinkasFabien Mathieu. Distributedly Testing Cycle-Freeness
Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.15 - 28, ⟨10.1007/978-3-319-12340-0_2⟩
...
hal-00341609v1  Journal articles
Reuven CohenPierre FraigniaudDavid IlcinkasAmos KormanDavid Peleg. Label-Guided Graph Exploration by a Finite Automaton
ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (4), pp.Article 42. ⟨10.1145/1383369.1383373⟩
...
hal-00341600v1  Journal articles
Pierre FraigniaudDavid IlcinkasAndrzej Pelc. Impact of memory size on graph exploration capability
Discrete Applied Mathematics, Elsevier, 2008, 156 (12), pp.2310-2319. ⟨10.1016/j.dam.2007.11.001⟩
...
hal-00341624v1  Journal articles
Pierre FraigniaudDavid IlcinkasAndrzej Pelc. Tree exploration with advice
Information and Computation, Elsevier, 2008, 206 (11), pp.1276-1287. ⟨10.1016/j.ic.2008.07.005⟩