Universal traversal sequences with backtracking

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 21-27

  Koucky M ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SEQUENTIAL MACHINES; TREES (MATHEMATICS);

LOWER BOUNDS; NONDETERMINISTIC LOGSPACE; SYMMETRIC LOGSPACE; UNIVERSAL EXPLORATION SEQUENCES; UNIVERSAL TRAVERSAL SEQUENCES;

COMPUTATIONAL COMPLEXITY;

EID: 0034876623     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Reversible Markov chains and random walks on graphs
2. A simple graph traversing problem
3. Random walks, universal traversal sequences, and the complexity of maze problems
4. Universal sequences for complete graphs
5. 4/3
6. Multiparty protocols and logspace-hard pseudorandom sequences (Extended Abstract)
7. Bounds on universal sequences
8. Lower bounds on the length of traversal sequences
9. Universal traversal sequences for paths and cycles
10. Lower bounds on universal traversal sequences based on chains of length five
11. The electrical resistance of a graph captures its commute and cover times
12. Universal traversal sequences for expander graphs
13. Pseudorandomness for network algorithms
14. Polynomial universal traversing sequences for cycles are constructible (extended abstract)
15. On the cover time of random walks on graphs
16. O(logn) for cliques
17. 4.03)
18. Pseudorandom generators for space-bounded computation
19. 1.5 n) space
20. 3/2)
21. Lower bounds on universal traversal sequences for cycles and other low degree graphs