Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aleliunas R, Karp RM, Lipton R, Lovasz L, Rackoff C (1979) Random walks, universal traversal sequences, and the complexity of maze problems. In: FOCS, San Juan, pp 218–223
2. Armoni R, Ta-Shma A, Widgerson A, Zhou S (2000) An o(log(n)4∕3) space algorithm for (s, t) connectivity in undirected graphs. J ACM 47(2):294–311
3. Asano T, Rote G (2009) Constant-working-space algorithms for geometric problems. In: CCCG, Vancouver, pp 87–90
4. Asano T, Buchin K, Buchin M, Korman M, Mulzer W, Rote G, Schulz A (2012) Memory-constrained algorithms for simple polygons. Comput Geom Theory Appl 46(8):959–969
5. Barba L, Korman M, Langerman S, Silveira R (2014) Computing the visibility polygon using few variables. Comput Geom Theory Appl 47(9):918–926
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献