Recursive Characterization of Computable Real-Valued Functions and Relations. - Vasco Brattka (Theor. Comput. Sci., 1996)

Order-free Recursion on the Real Numbers. - Vasco Brattka (Math. Log. Q., 1997)

Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. - Vasco Brattka; Klaus Weihrauch (MCU (2), 1998)

Feasible Real Random Access Machines. - Vasco Brattka; Peter Hertling (J. Complex., 1998)

Approaches to Effective Semi-Continuity of Real Functions. - Vasco Brattka; Xizhong Zheng; Klaus Weihrauch (Math. Log. Q., 1999)

Computable Invariance. - Vasco Brattka (Theor. Comput. Sci., 1999)

Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. - Vasco Brattka; Klaus Weihrauch (Theor. Comput. Sci., 1999)

Recursive and computable operations over topological structures. - Vasco Brattka (Fernuniv., Fachbereich Informatik, 1999)

A Computable Spectral Theorem. - Martin Ziegler 001; Vasco Brattka (CCA, 2000)

The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability. - Vasco Brattka (Words, Languages & Combinatorics, 2000)

Computing the Dimension of Linear Subspaces. - Martin Ziegler 001; Vasco Brattka (SOFSEM, 2000)

Recursion and Computability over Topological Structures. - Vasco Brattka (MFCSIT, 2000)

Turing computability of (non-)linear optimization. - Martin Ziegler 001; Vasco Brattka (CCCG, 2001)

Computable Versions of Baire's Category Theorem. - Vasco Brattka (MFCS, 2001)

Random Numbers and an Incomplete Immune Recursive Set. - Vasco Brattka (ICALP, 2002)

Computability of Linear Equations. - Vasco Brattka; Martin Ziegler 001 (IFIP TCS, 2002)

Computing Uniform Bounds. - Vasco Brattka (CCA, 2002)

Preface. - Vasco Brattka; Matthias Schröder 001; Klaus Weihrauch (CCA, 2002)

Some Notes on Fine Computability. - Vasco Brattka (J. Univers. Comput. Sci., 2002)

Preface: MLQ - Math. Log. Quart. Supplement 1/2002. - Vasco Brattka; Peter Hertling; Mariko Yasugi; Ning Zhong 002 (Math. Log. Q., 2002)

Topological properties of real number representations. - Vasco Brattka; Peter Hertling (Theor. Comput. Sci., 2002)

The Inversion Problem for Computable Linear Operators. - Vasco Brattka (STACS, 2003)

Recursive quasi-metric spaces. - Vasco Brattka (Theor. Comput. Sci., 2003)

Computability on subsets of metric spaces. - Vasco Brattka; Gero Presser (Theor. Comput. Sci., 2003)

On the Borel Complexity of Hahn-Banach Extensions. - Vasco Brattka (CCA, 2004)

Preface. - Vasco Brattka; Ludwig Staiger; Klaus Weihrauch (CCA, 2004)

Preface: MLQ - Math. Log. Quart. 4-5/2004. - Vasco Brattka; Peter Hertling; Ker-I Ko; Ning Zhong 002 (Math. Log. Q., 2004)

Computability and Complexity in Analysis (CCA). A View from Interval Computations - Cincinnati, Ohio, USA, August 28-30, 2003. - Vasco Brattka; Vladik Kreinovich (Reliab. Comput., 2004)

Computability in linear algebra. - Martin Ziegler 001; Vasco Brattka (Theor. Comput. Sci., 2004)

Computability on Non-Separable Banach Spaces and Landau's Theorem. - Vasco Brattka (From sets and types to topology and analysis, 2005)

Some Aspects of Computable Functional Analysis. - Vasco Brattka (CCA, 2005)

Computing with Sequences, Weak Topologies and the Axiom of Choice. - Vasco Brattka; Matthias Schröder 001 (CSL, 2005)

Computability of the Spectrum of Self-Adjoint Operators. - Vasco Brattka; Ruth Dillhage (J. Univers. Comput. Sci., 2005)

Effective Borel measurability and reducibility of functions. - Vasco Brattka (Math. Log. Q., 2005)

On Computable Compact Operators on Banach Spaces. - Vasco Brattka; Ruth Dillhage (CCA, 2006)

Computability and complexity in analysis. - Vasco Brattka; Peter Hertling; Ker-I Ko; Hideki Tsuiki (J. Complex., 2006)

Towards computability of elliptic boundary value problems in variational formulation. - Vasco Brattka; Atsushi Yoshikawa 001 (J. Complex., 2006)

Foreword. - Vasco Brattka; Christiane Frougny; Norbert Th. Müller (RAIRO Theor. Informatics Appl., 2007)

Computability of compact operators on computable Banach spaces with bases. - Vasco Brattka; Ruth Dillhage (Math. Log. Q., 2007)

Borel complexity and computability of the Hahn-Banach Theorem. - Vasco Brattka (Arch. Math. Log., 2008)

Preface. - Vasco Brattka; Ruth Dillhage; Tanja Grubba; Angela Klutsch (CCA, 2008)

Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces. - Ruth Dillhage; Vasco Brattka (CCA, 2008)

Randomness with Respect to the Signed-Digit Representation. - Margaret Archibald; Vasco Brattka; Clemens Heuberger (Fundam. Informaticae, 2008)

Preface. - Vasco Brattka; Gerhard Jäger; Hans-Peter A. Künzi (J. Log. Algebraic Methods Program., 2008)

Computability and Complexity in Analysis. - Vasco Brattka; Hajime Ishihara; Matthias Schröder 001; Ning Zhong 002 (J. Univers. Comput. Sci., 2008)

Editorial: Math. Log. Quart. 5/2008. - Vasco Brattka; Hajime Ishihara; Matthias Schröder 001; Ning Zhong 002 (Math. Log. Q., 2008)

Plottable Real Number Functions and the Computable Graph Theorem. - Vasco Brattka (SIAM J. Comput., 2008)

A method to evaluate the computational complexity of the theorems from functional analysis. - Vasco Brattka; Guido Gherardi (ICTCS, 2009)

A computable version of Banach's Inverse Mapping Theorem. - Vasco Brattka (Ann. Pure Appl. Log., 2009)

Computability and Complexity in Analysis. - Vasco Brattka; Pieter Collins; Robert Rettinger (J. Univers. Comput. Sci., 2009)

Borel Complexity of Topological Operations on Computable Metric Spaces. - Vasco Brattka; Guido Gherardi (J. Log. Comput., 2009)

Computability of finite-dimensional linear subspaces and best approximation. - Vasco Brattka; Ruth Dillhage (Ann. Pure Appl. Log., 2010)

Computation with Advice - Vasco Brattka; Arno Pauly (CCA, 2010)

Effective choice and boundedness principles in computable analysis. - Vasco Brattka; Guido Gherardi (Bull. Symb. Log., 2011)

Randomness and Differentiability. - Vasco Brattka; Joseph S. Miller; André Nies (CoRR, 2011)

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Dagstuhl Reports, 2011)

Weihrauch degrees, omniscience principles and weak computability. - Vasco Brattka; Guido Gherardi (J. Symb. Log., 2011)

On the Computational Content of the Brouwer Fixed Point Theorem. - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CiE, 2012)

Foreword. - Ulrich Berger 001; Vasco Brattka; Andrei S. Morozov; Dieter Spreen (Ann. Pure Appl. Log., 2012)

Closed choice and a Uniform Low Basis Theorem. - Vasco Brattka; Matthew de Brecht; Arno Pauly (Ann. Pure Appl. Log., 2012)

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. - Vasco Brattka; Guido Gherardi; Alberto Marcone (Ann. Pure Appl. Log., 2012)

Editorial. - Vasco Brattka; Paola Bonizzoni; S. Barry Cooper; Benedikt Löwe; Elvira Mayordomo (Comput., 2012)

Computability and analysis: the legacy of Alan Turing - Jeremy Avigad; Vasco Brattka (CoRR, 2012)

Connected Choice and the Brouwer Fixed Point Theorem - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CoRR, 2012)

Computability and analysis: the legacy of Alan Turing. - Jeremy Avigad; Vasco Brattka (Turing's Legacy, 2014)

Las Vegas Computability and Algorithmic Randomness. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (STACS, 2015)

Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). - Vasco Brattka; Akitoshi Kawamura; Alberto Marcone; Arno Pauly (Dagstuhl Reports, 2015)

Probabilistic computability and choice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (Inf. Comput., 2015)

Preface to the special issue: Computing with infinite data: topological and logical foundations. - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Math. Struct. Comput. Sci., 2015)

The Brouwer Fixed Point Theorem Revisited. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (CiE, 2016)

Computability and Analysis, a Historical Approach. - Vasco Brattka (CiE, 2016)

Editorial. - Vasco Brattka; Paola Bonizzoni; Olivier Bournez; Elvira Mayordomo (Comput., 2016)

The Vitali Covering Theorem in the Weihrauch Lattice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001; Arno Pauly (Computability and Complexity, 2017)

Monte Carlo Computability. - Vasco Brattka; Rupert Hölzl 001; Rutger Kuyper (STACS, 2017)

Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. - Vasco Brattka; Andrea Cettolo; Guido Gherardi; Alberto Marcone; Matthias Schröder 001 (Ann. Pure Appl. Log., 2017)

Weihrauch Complexity in Computable Analysis. - Vasco Brattka; Guido Gherardi; Arno Pauly (CoRR, 2017)

Computability Theory (Dagstuhl Seminar 17081). - Klaus Ambos-Spies; Vasco Brattka; Rodney G. Downey; Steffen Lempp (Dagstuhl Reports, 2017)

On the Uniform Computational Content of Ramsey's Theorem. - Vasco Brattka; Tahina Rakotoniaina (J. Symb. Log., 2017)

On the Uniform Computational Content of Computability Theory. - Vasco Brattka; Matthew Hendtlass; Alexander P. Kreuzer (Theory Comput. Syst., 2017)

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). - Vasco Brattka; Damir D. Dzhafarov; Alberto Marcone; Arno Pauly (Dagstuhl Reports, 2018)

A Galois connection between Turing jumps and limits. - Vasco Brattka (Log. Methods Comput. Sci., 2018)

On the algebraic structure of Weihrauch degrees. - Vasco Brattka; Arno Pauly (Log. Methods Comput. Sci., 2018)

On the Uniform Computational Content of the Baire Category Theorem. - Vasco Brattka; Matthew Hendtlass; Alexander P. Kreuzer (Notre Dame J. Formal Log., 2018)

Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. - Vasco Brattka; Rod Downey; Julia F. Knight; Steffen Lempp (Comput., 2019)

Connected choice and the Brouwer fixed point theorem. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (J. Math. Log., 2019)

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. - Vasco Brattka; Damir D. Dzhafarov; Alberto Marcone; Arno Pauly (Comput., 2020)

Weihrauch Goes Brouwerian. - Vasco Brattka; Guido Gherardi (J. Symb. Log., 2020)

Completion of choice. - Vasco Brattka; Guido Gherardi (Ann. Pure Appl. Log., 2021)

Stashing And Parallelization Pentagons. - Vasco Brattka (Log. Methods Comput. Sci., 2021)

Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. - Vasco Brattka; Noam Greenberg; Iskander Sh. Kalimullin; Mariya Ivanova Soskova (Comput., 2022)

On the Complexity of Learning Programs. - Vasco Brattka (CiE, 2023)

On the Complexity of Computing Gödel Numbers. - Vasco Brattka (CoRR, 2023)

The discontinuity Problem. - Vasco Brattka (J. Symb. Log., 2023)

Effective Second Countability in Computable Analysis. - Vasco Brattka; Emmanuel Rauzy (CiE, 2025)

Computability of Initial Value Problems. - Vasco Brattka; Hendrik Smischliaew (CiE, 2025)

Loops, Inverse Limits and Non-Determinism. - Vasco Brattka (CoRR, 2025)