Search results for "David Ilcinkas"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Paola Flocchini, David Ilcinkas, Nicola Santoro	Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro	How many oblivious robots can explore a line.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc	Asynchronous deterministic rendezvous in bounded terrains.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Derandomizing random walks in undirected graphs using locally fair exploration strategies.	Distributed Computing	2011	DBLP DOI BibTeX RDF
1	David Ilcinkas, Ahmed Mouhamadou Wade	On the Power of Waiting When Exploring Public Transportation Systems.	OPODIS	2011	DBLP DOI BibTeX RDF
1	Christian Glacet, Nicolas Hanusse, David Ilcinkas	The Impact of Edge Deletions on the Number of Errors in Networks.	OPODIS	2011	DBLP DOI BibTeX RDF
1	David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc	Fast radio broadcasting with advice.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro	Remembering without memory: Tree exploration by asynchronous oblivious robots.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc	Asynchronous deterministic rendezvous in bounded terrains	CoRR	2010	DBLP BibTeX RDF
1	Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc	Optimal Exploration of Terrains with Obstacles	CoRR	2010	DBLP BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Communication algorithms with advice.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
1	Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas	Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.	WG	2010	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc	Optimal Exploration of Terrains with Obstacles.	SWAT	2010	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc	Asynchronous Deterministic Rendezvous in Bounded Terrains.	SIROCCO	2010	DBLP DOI BibTeX RDF
1	Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel	Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.	DISC	2010	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF	faulty networks, distributed computing, mobile agents, random walks, expanders
1	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Labeling Schemes for Tree Representation.	Algorithmica	2009	DBLP DOI BibTeX RDF	Spanning tree, Labeling scheme, Tree representation
1	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	2009	DBLP BibTeX RDF
1	David Ilcinkas, Nicolas Nisse, David Soguet	The cost of monotonicity in distributed graph searching.	Distributed Computing	2009	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc	Distributed computing with advice: information sensitivity of graph coloring.	Distributed Computing	2009	DBLP DOI BibTeX RDF	Distributed computing, Graph coloring, Network algorithm
1	Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.	ICALP	2009	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Euler Tour Lock-In Problem in the Rotor-Router Model.	DISC	2009	DBLP DOI BibTeX RDF
1	David Ilcinkas	Setting port numbers for fast graph exploration.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Tree exploration with advice.	Inf. Comput.	2008	DBLP DOI BibTeX RDF
1	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Label-guided graph exploration by a finite automaton.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Distributed algorithms, labeling schemes, graph exploration
1	David Ilcinkas, Andrzej Pelc	Impact of Asynchrony on the Behavior of Rational Selfish Agents.	Fundam. Inform.	2008	DBLP BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Impact of memory size on graph exploration capability.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro	Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.	SIROCCO	2008	DBLP DOI BibTeX RDF
1	David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc	Fast Radio Broadcasting with Advice.	SIROCCO	2008	DBLP DOI BibTeX RDF	deterministic broadcasting, distributed algorithm, radio network, advice
1	Paola Flocchini, David Ilcinkas, Nicola Santoro	Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.	DISC	2008	DBLP DOI BibTeX RDF	dangerous graphs, distributed computing, mobile agents, autonomous robots, graph exploration
1	Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc	Distributed Computing with Advice: Information Sensitivity of Graph Coloring.	ICALP	2007	DBLP DOI BibTeX RDF
1	David Ilcinkas, Nicolas Nisse, David Soguet	The Cost of Monotonicity in Distributed Graph Searching.	OPODIS	2007	DBLP DOI BibTeX RDF	Monotonicity, Competitive ratio, Graph searching
1	Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro	Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.	OPODIS	2007	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Tree Exploration with an Oracle.	MFCS	2006	DBLP DOI BibTeX RDF
1	David Ilcinkas	Setting Port Numbers for Fast Graph Exploration.	SIROCCO	2006	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Oracle size: a new measure of difficulty for communication tasks.	PODC	2006	DBLP DOI BibTeX RDF	broadcast, oracle, wakeup
1	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	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg	Graph exploration by a finite automaton.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
1	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Labeling Schemes for Tree Representation.	IWDC	2005	DBLP DOI BibTeX RDF
1	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Label-Guided Graph Exploration by a Finite Automaton.	ICALP	2005	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil	Space Lower Bounds for Graph Exploration via Reduced Automata.	SIROCCO	2005	DBLP DOI BibTeX RDF	robot, mobile agent, finite automaton, Graph exploration
1	Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg	Graph Exploration by a Finite Automaton.	MFCS	2004	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, David Ilcinkas	Digraphs Exploration with Little Memory.	STACS	2004	DBLP DOI BibTeX RDF

Publications of "David Ilcinkas" ( http://dblp.L3S.de/Authors/David_Ilcinkas )