1. Ahlfors, L.: Complex Analysis. New York: McGraw-Hill, (1953)
2. Binder, I., Braverman, M., Yampolsky, M.: Filled Julia sets with empty interior are computable. http://arxiv/org/list/math.DS/0410580, 2004
3. Bishop, E., Bridges, D.S.: Constructive Analysis. Springer-Verlag, Berlin (1985)
4. Braverman, M.: Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable. Thesis, University of Toronto, 2004, and Proc. CCA 2004, in ENTCS, Vol. 120, 17–30 (2005)
5. Braverman, M.: Parabolic Julia Sets are Polynomial Time Computable. http://arxiv.org/list/math.DS/0505036, 2005