Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. R. Aleliunas, A simple graph traversing problem, Master's Thesis, University of Toronto, 1978 (Technical Report 20).
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annu. Symp. on Foundations of Computer Science, 1979, pp. 218–223.
3. R. Armoni, A. Ta-Shma, A. Wigderson, S. Zhou, SL⊆ L4/3, in: Proc. 29th Annu. ACM Symp. on Theory of Computing, 1997, pp. 230–239.
4. Bounds on universal sequences;Bar-Noy;SIAM J. Comput.,1989
5. Universal traversal sequences for paths and cycles;Bridgland;J. Algorithms,1987
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献