Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. M. F. Barnsley, Fractals Everywhere, Academic Press, 1988.
3. M. F. Barnsley, J. H. Elton and D. P. Hardin, “Recurrent Iterated Function Systems,” Constructive Approximation, 5, 3–31 (1989).
4. M. F. Barnsley, R. L. Devaney, B. B. Mandelbrot, H-O. Peitgen, De Saupe, and R. F. Voss, Science of Fractal Images, Springer-Verlag, 1988.
5. J. L. Bentley, D. Haken and J. B. Saxe, “A General Method for Solving Divideand-Conquer Recurrences,” SIGACT News, 12, 36–44 (1980).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Searching Trees: An Essay;Lecture Notes in Computer Science;2009