Funder
National Science Foundation
Infosys Foundation
SERB-MATRICS
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference41 articles.
1. Aggarwal, A., Anderson, R.J., Kao, M.-Y.: Parallel depth-first search in general directed graphs. SIAM J. Comput. 19(2), 397–409 (1990). https://doi.org/10.1137/0219025
2. Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theory Comput. Syst. 45(4), 675–723 (2009). https://doi.org/10.1007/s00224-009-9172-z
3. Allender, E., Chauhan, A., Datta, S.: Depth-first search in directed graphs, revisited. Technical report TR20-074, Electronic Colloquium on Computational Complexity (ECCC) (2020)
4. Allender, E., Chauhan, A., Datta, S., Mukherjee, A.: Planarity, exclusivity, and unambiguity. Electron. Colloq. Comput. Complex. ECCC 26, 39 (2019)
5. Allender, E., Lange, K.-J.: $$ RUSPACE(\log n) \subseteq DSPACE (\log ^2 n/\log \log n)$$. Theory Comput. Syst. 31(5), 539–550 (1998). https://doi.org/10.1007/s002240000102
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献