Polynomial universal traversing sequences for cycles are constructible
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Lower bounds on the length of universal traversal sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
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)
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |