Author:
Gopalan Parikshit,Lipton Richard J.,Mehta Aranyak
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., Rakoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, pp. 218–223 (1979)
2. Armoni, R., Ta-Shma, A., Wigderson, A., Zhou, S.: An log(n)4/3 space algorithm for s-t connectivity in undirected graphs. Journal of the ACM 47, 294–311 (2000)
3. Barnes, G., Buss, J., Ruzzo, W., Schieber, B.: A sub-linear space, polynomial time algorithm for directed s-t connectivity. In: 7th annual conference on Structure in Complexity Theory, pp. 27–33 (1992)
4. Berman, P., Simon, J.: Lower bounds on graph threading by probabilistic machines. In: 24th Annual Symposium on Foundations of Computer Science, pp. 304–311 (1983)
5. Cook, S., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM Journal on Computing 9(3), 636–652 (1980)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献