1. Oliver Aberth. Computable Analysis. McGraw-Hill, New York, 1980.
2. Oliver Aberth. Precise Numerical Analysis. Brown Publishers, Dubuque, 1988.
3. Helmut Alt. Multiplication is the easiest nontrivial arithmetic function. Theoretical Computer Science, 36:333–339, 1985.
4. Errett Bishop and Douglas S. Bridges. Constructive Analysis, volume 279 of Grundlehren der mathematischen Wissenschaft. Springer, Berlin, 1985.
5. Vasco Brattka and Peter Hertling. Feasible real random access machines. In Keith G. Jeffrey, Jaroslav Král, and Miroslav Bartošek, editors, SOFSEM'96: Theory and Practice of Informatics, volume 1175 of Lecture Notes in Computer Science, pages 335–342, Berlin, 1996. Springer. 23rd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republik, November 23–30, 1996.