Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 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: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1979, pp. 218–223.
3. Universal sequences for complete graphs;Alon;Discrete Appl. Math.,1990
4. R. Armoni, A. Ta-Shma, A. Wigderson, S. Zhou, SL⊆ L4/3, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1997, pp. 230–239.
5. L. Babai, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences (extended abstract), in: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1989, pp. 1–11.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献