Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference51 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Boston (1974)
2. Arora, S., Barak, B.: Computational complexity - a modern approach. Cambridge University Press, Cambridge (2009)
3. Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47(3), 469–479 (2014)
4. Asano, T., Izumi, T., Kiyomi, M., Konagaya, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J., Uehara, R.: Depth-first search using O(n) bits. In: 25th ISAAC, LNCS, vol. 8889, pp 553–564 (2014)
5. Asano, T., Kirkpatrick, D.G., Nakagawa, K., Watanabe, O.: Ȯ(√ n)-space and polynomial-time algorithm for planar directed graph reachability. In: 39th MFCS LNCS, vol. 8634, pp 45–56 (2014)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献