Author:
Datta Samir,Kulkarni Raghav,Roy Sambuddha
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Grid graph reachability problems. In: IEEE Conference on Computational Complexity, pp. 299–313 (2006)
2. Allender, E., Datta, S., Roy, S.: The directed planar reachability problem. In: FSTTCS, pp. 238–249 (2005)
3. Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: uniform and nonuniform upper bounds. J. Comput. Syst. Sci. 59(2), 164–181 (1999)
4. Braverman, M., Kulkarni, R., Roy, S.: Parity problems in planar graphs. In: IEEE Conference on Computational Complexity, pp. 222–235 (2007)
5. Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. In: IEEE Conference on Computational Complexity, pp. 217–221 (2007)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献