1. A comparison of various analytic choice principles;Anglès d'Auriac;J. Symb. Log.,2021
2. Closed choice and a uniform low basis theorem;Brattka;Ann. Pure Appl. Log.,2012
3. Measuring the complexity of computational content: from combinatorial problems to analysis (Dagstuhl seminar 18361);Brattka;Dagstuhl Rep.,2019
4. Effective choice and boundedness principles in computable analysis;Brattka;Bull. Symb. Log.,2011
5. Weihrauch degrees, omniscience principles and weak computability;Brattka;J. Symb. Log.,2011