1. Constructive Analysis;Bishop,1985
2. Borel complexity and computability of the Hahn-Banach Theorem;Brattka;Archive for Mathematical Logic,2008
3. Plottable real number functions and the computable graph theorem;Brattka;SIAM Journal on Computing,2008
4. V. Brattka, G. Gherardi, Weihrauch degrees, omniscience principles and weak computability, Journal of Symbolic Logic (in press). URL: preliminary version: http://arxiv.org/abs/0905.4679.
5. Computability on subsets of metric spaces;Brattka;Theoretical Computer Science,2003