Author:
Cohen Reuven,Fraigniaud Pierre,Ilcinkas David,Korman Amos,Peleg David
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: 19th Symposium on Foundations of Computer Science (FOCS), pp. 132–142 (1978)
2. Budach, L.: Automata and labyrinths. Math. Nachrichten, 195–282 (1978)
3. Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree Exploration with Little Memory. In: 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 588–597 (2002)
4. Lecture Notes in Computer Science;P. Fraigniaud,2004
5. Kozen, D.: Automata and planar graphs. In: Fund. Computat. Theory (FCT), pp. 243–254 (1979)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Anonymous Graph Exploration with Binoculars;Lecture Notes in Computer Science;2015
2. Local MST Computation with Short Advice;Theory of Computing Systems;2010-07-29
3. Proof labeling schemes;Distributed Computing;2010-03-03
4. Drawing Maps with Advice;Lecture Notes in Computer Science;2010
5. Low-Port Tree Representations;Graph-Theoretic Concepts in Computer Science;2010