1. Abrahamsen, M.: Constant-workspace algorithms for visibility problems in the plane. Master’s thesis, University of Copenhagen (2013) http://www.diku.dk/forskning/~performance-engineering/Mikkel/thesis.pdf
2. Abrahamsen, M.: An optimal algorithm computing edge-to-edge visibility in a simple polygon. In: CCCG, pp. 157–162 (2013)
3. Akra, M., Bazzi, L.: On the solution of linear recurrence equations. Comput. Optim. Appl. 10(2), 195–210 (1998)
4. Aloupis, G.: A history of linear-time convex hull algorithms for simple polygons. http://cgm.cs.mcgill.ca/~athens/cs601/
5. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)