ACM Computing Surveys (CSUR)
Universal traversal sequences with backtracking
Journal of Computer and System Sciences - Complexity 2001
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03)
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Tree exploration with little memory
Journal of Algorithms
Graph exploration by a finite automaton
Theoretical Computer Science - Mathematical foundations of computer science 2004
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Impact of memory size on graph exploration capability
Discrete Applied Mathematics
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |