A tutorial on computable analysis V Brattka, P Hertling, K Weihrauch New computational paradigms, 425-491, 2008 | 207 | 2008 |

Computability on subsets of metric spaces V Brattka, G Presser Theoretical Computer Science 305 (1-3), 43-76, 2003 | 205 | 2003 |

Computability on subsets of Euclidean space I: Closed and compact subsets V Brattka, K Weihrauch Theoretical Computer Science 219 (1-2), 65-93, 1999 | 160 | 1999 |

Weihrauch degrees, omniscience principles and weak computability V Brattka, G Gherardi The Journal of Symbolic Logic 76 (1), 143-176, 2011 | 156 | 2011 |

Effective choice and boundedness principles in computable analysis V Brattka, G Gherardi Bulletin of Symbolic Logic 17 (1), 73-117, 2011 | 147 | 2011 |

Closed choice and a uniform low basis theorem V Brattka, M De Brecht, A Pauly Annals of Pure and Applied Logic 163 (8), 986-1008, 2012 | 129 | 2012 |

Effective Borel measurability and reducibility of functions V Brattka Mathematical Logic Quarterly 51 (1), 19-44, 2005 | 116 | 2005 |

The Bolzano–Weierstrass theorem is the jump of weak Kőnig’s lemma V Brattka, G Gherardi, A Marcone Annals of Pure and Applied Logic 163 (6), 623-655, 2012 | 110 | 2012 |

Randomness and differentiability V Brattka, JS Miller, A Nies Transactions of the American Mathematical Society 368 (1), 581-605, 2016 | 106 | 2016 |

Computability and analysis: the legacy of Alan Turing. J Avigad, V Brattka, R Downey Turing's Legacy, 1-47, 2014 | 90 | 2014 |

Feasible real random access machines V Brattka, P Hertling Journal of Complexity 14 (4), 490-526, 1998 | 87 | 1998 |

Recursive characterization of computable real-valued functions and relations V Brattka Theoretical Computer Science 162 (1), 45-77, 1996 | 76 | 1996 |

Weihrauch complexity in computable analysis V Brattka, G Gherardi, A Pauly Handbook of computability and complexity in analysis, 367-417, 2021 | 64 | 2021 |

Computability over topological structures V Brattka Computability and Models, 93-136, 2003 | 64 | 2003 |

Probabilistic computability and choice V Brattka, G Gherardi, R Hölzl Information and Computation 242, 249-286, 2015 | 63 | 2015 |

Plottable real number functions and the computable graph theorem V Brattka SIAM Journal on Computing 38 (1), 303-328, 2008 | 62 | 2008 |

Topological properties of real number representations V Brattka, P Hertling Theoretical Computer Science 284 (2), 241-257, 2002 | 59 | 2002 |

Computable invariance V Brattka Theoretical Computer Science 210 (1), 3-20, 1999 | 52 | 1999 |

Computable versions of Baire’s category theorem V Brattka International Symposium on Mathematical Foundations of Computer Science, 224-235, 2001 | 51 | 2001 |

Recursive and computable operations over topological structures V Brattka | 51 | 1999 |