The SCEAS System
| |||||||

## Search the dblp DataBase
David Ilcinkas:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
**The Reduced Automata Technique for Graph Exploration Space Lower Bounds.**[Citation Graph (0, 0)][DBLP] Essays in Memory of Shimon Even, 2006, pp:1-26 [Conf] - Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
**Label-Guided Graph Exploration by a Finite Automaton.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:335-346 [Conf] - Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
**Labeling Schemes for Tree Representation.**[Citation Graph (0, 0)][DBLP] IWDC, 2005, pp:13-24 [Conf] - Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
**Tree Exploration with an Oracle.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:24-37 [Conf] - Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
**Graph Exploration by a Finite Automaton.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:451-462 [Conf] - Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
**Oracle size: a new measure of difficulty for communication tasks.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:179-187 [Conf] - Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
**Space Lower Bounds for Graph Exploration via Reduced Automata.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:140-154 [Conf] - David Ilcinkas
**Setting Port Numbers for Fast Graph Exploration.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:59-69 [Conf] - Pierre Fraigniaud, David Ilcinkas
**Digraphs Exploration with Little Memory.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:246-257 [Conf] - Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
**Graph exploration by a finite automaton.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:331-344 [Journal] - Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
**Distributed Computing with Advice: Information Sensitivity of Graph Coloring.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:231-242 [Conf] **Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.**[Citation Graph (, )][DBLP]**The Cost of Monotonicity in Distributed Graph Searching.**[Citation Graph (, )][DBLP]**Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.**[Citation Graph (, )][DBLP]**Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?**[Citation Graph (, )][DBLP]**Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.**[Citation Graph (, )][DBLP]**Fast Radio Broadcasting with Advice.**[Citation Graph (, )][DBLP]**More Efficient Periodic Traversal in Anonymous Undirected Graphs.**[Citation Graph (, )][DBLP]**Asynchronous Deterministic Rendezvous in Bounded Terrains.**[Citation Graph (, )][DBLP]**Optimal Exploration of Terrains with Obstacles.**[Citation Graph (, )][DBLP]**Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.**[Citation Graph (, )][DBLP]**Euler Tour Lock-In Problem in the Rotor-Router Model.**[Citation Graph (, )][DBLP]**Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.**[Citation Graph (, )][DBLP]**Labeling Schemes for Tree Representation.**[Citation Graph (, )][DBLP]**More efficient periodic traversal in anonymous undirected graphs**[Citation Graph (, )][DBLP]**Optimal Exploration of Terrains with Obstacles**[Citation Graph (, )][DBLP]**Asynchronous deterministic rendezvous in bounded terrains**[Citation Graph (, )][DBLP]**Impact of memory size on graph exploration capability.**[Citation Graph (, )][DBLP]**Distributed computing with advice: information sensitivity of graph coloring.**[Citation Graph (, )][DBLP]**The cost of monotonicity in distributed graph searching.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |