The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Ilcinkas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
    Tree Exploration with an Oracle. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:24-37 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. David Ilcinkas
    Setting Port Numbers for Fast Graph Exploration. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:59-69 [Conf]
  9. Pierre Fraigniaud, David Ilcinkas
    Digraphs Exploration with Little Memory. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:246-257 [Conf]
  10. 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]
  11. 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]

  12. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]


  13. The Cost of Monotonicity in Distributed Graph Searching. [Citation Graph (, )][DBLP]


  14. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. [Citation Graph (, )][DBLP]


  15. 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]


  16. Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. [Citation Graph (, )][DBLP]


  17. Fast Radio Broadcasting with Advice. [Citation Graph (, )][DBLP]


  18. More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]


  19. Asynchronous Deterministic Rendezvous in Bounded Terrains. [Citation Graph (, )][DBLP]


  20. Optimal Exploration of Terrains with Obstacles. [Citation Graph (, )][DBLP]


  21. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. [Citation Graph (, )][DBLP]


  22. Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]


  23. Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. [Citation Graph (, )][DBLP]


  24. Labeling Schemes for Tree Representation. [Citation Graph (, )][DBLP]


  25. More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]


  26. Optimal Exploration of Terrains with Obstacles [Citation Graph (, )][DBLP]


  27. Asynchronous deterministic rendezvous in bounded terrains [Citation Graph (, )][DBLP]


  28. Impact of memory size on graph exploration capability. [Citation Graph (, )][DBLP]


  29. Distributed computing with advice: information sensitivity of graph coloring. [Citation Graph (, )][DBLP]


  30. The cost of monotonicity in distributed graph searching. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002