Navigation Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 par Auteur "ILCINKAS, David"
-
Fast radio broadcasting with advice
ILCINKAS, David; KOWALSKI, Dariusz R.; PELC, Andrzej(Theoretical Computer Science. vol. 411, n° 14-15, pp. 1544-1557, 2010-03)Article de revue -
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
BONICHON, Nicolas; GAVOILLE, Cyril; HANUSSE, Nicolas ...Document de travail - Pré-publication -
Communication algorithms with advice
FRAIGNIAUD, Pierre; ILCINKAS, David; PELC, Andrzej(Journal of Computer and System Sciences. vol. 76, n° 3-4, pp. 222-232, 2010)Article de revue -
The Cost of Monotonicity in Distributed Graph Searching
ILCINKAS, David; NISSE, Nicolas; SOGUET, David(Distributed Computing. vol. 22, n° 2, pp. 117-127, 2009)Article de revue -
Euler Tour Lock-in Problem in the Rotor-Router Model
BAMPAS, Evangelos; GASIENIEC, Leszek; HANUSSE, Nicolas ...Communication dans un congrès -
Distributed computing with advice: information sensitivity of graph coloring
FRAIGNIAUD, Pierre; GAVOILLE, Cyril; ILCINKAS, David ...(Distributed Computing. vol. 21, n° 6, pp. 395-403, 2009-03)Article de revue -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
CZYZOWICZ, Jurek; DOBREV, Stefan; GASIENIEC, Leszek ...Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
COOPER, Colin; ILCINKAS, David; KLASING, Ralf ...Communication dans un congrès -
Label-Guided Graph Exploration by a Finite Automaton
COHEN, Reuven; FRAIGNIAUD, Pierre; ILCINKAS, David ...(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue -
Tree exploration with advice
FRAIGNIAUD, Pierre; ILCINKAS, David; PELC, Andrzej(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
Setting port numbers for fast graph exploration
ILCINKAS, David(Theoretical Computer Science. vol. 401, n° 1-3, pp. 236-242, 2008-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
FLOCCHINI, Paola; ILCINKAS, David; SANTORO, NicolaCommunication dans un congrès -
Impact of memory size on graph exploration capability
FRAIGNIAUD, Pierre; ILCINKAS, David; PELC, Andrzej(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue -
On the Power of Waiting when Exploring Public Transportation Systems
ILCINKAS, David; WADE, AhmedCommunication dans un congrès -
Asynchronous deterministic rendezvous in bounded terrains
CZYZOWICZ, Jurek; ILCINKAS, David; LABOUREL, Arnaud ...(Theoretical Computer Science. vol. 412, n° 50, pp. 6926-6937, 2011-11)Article de revue -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
COOPER, Colin; ILCINKAS, David; KLASING, Ralf ...(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)Article de revue -
How many oblivious robots can explore a line
FLOCCHINI, Paola; ILCINKAS, David; PELC, Andrzej ...(Information Processing Letters. vol. 111, n° 20, pp. 1027-1031, 2011-10-31)Article de revue -
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
FLOCCHINI, Paola; ILCINKAS, David; PELC, Andrzej ...Communication dans un congrès