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
Log-Space constructible universal traversal sequences for cycles of length O(n4.03)
Theoretical Computer Science - Computing and combinatorics
Tree exploration with little memory
Journal of Algorithms
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Undirected connectivity in log-space
Journal of the ACM (JACM)
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)
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
SIAM Journal on Computing
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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.89 |