• Brattka, Vasco, Weihrauch complexity and the Hagen school of computable analysis, in: Löwe, Benedikt and Sarikaya, Deniz (eds.), 60 Jahre DVMLG, vol. 48 of Tributes, College Publications, London, 2022, pages 13-44
  • Brattka, Vasco and Gherardi, Guido and Pauly, Arno, Weihrauch Complexity in Computable Analysis, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 367-417
  • Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly, Arno, The Vitali Covering Theorem in the Weihrauch Lattice, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 188-200
  • Avigad, Jeremy and Brattka, Vasco, Computability and analysis: the legacy of Alan Turing, in: Downey, Rod (ed.), Turing's Legacy: Developments from Turing's Ideas in Logic, vol. 42 of Lecture Notes in Logic, Cambridge University Press, Cambridge, UK, 2014, pages 1-47
  • Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus, A Tutorial on Computable Analysis, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), New Computational Paradigms: Changing Conceptions of What Is Computable, Springer, New York, 2008, pages 425-491
  • Brattka, Vasco, From Hilbert's 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov's Superposition Theorem, in: Charpentier, Éric and Lesne, Annick and Nikolski, Nikolaï (eds.), Kolmogorov's Heritage in Mathematics, Springer, Berlin, 2007, pages 253-280
  • Brattka, Vasco, Computability on Non-Separable Banach Spaces and Landau's Theorem, in: Crosilla, Laura and Schuster, Peter (eds.), From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, Oxford University Press, 2005, pages 316-333
  • Brattka, Vasco, Du 13-ième problème de Hilbert à la théorie des réseaux de neurones : aspects constructifs du théorème de superposition de Kolmogorov, in: Charpentier, Éric and Lesne, Annick and Nikolski, Nikolaï (eds.), L'héritage de Kolmogorov en mathématiques, Éditions Belin, Paris, 2004, pages 241-268
  • Brattka, Vasco, Computability over Topological Structures, in: Cooper, S. Barry and Goncharov, Sergey S. (eds.), Computability and Models, Kluwer Academic Publishers, New York, 2003, pages 93-136
  • Brattka, Vasco and Kalantari, Iraj, A Bibliography of Recursive Analysis and Recursive Topology, in: Ershov, Yu. L. and Goncharov, S.S. and Nerode, A. and Remmel, J.B. (eds.), Handbook of Recursive Mathematics, vol. 138 of Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam, 1998, pages 583-620

  • Brattka, Vasco and Hölzl, Rupert and Kuyper, Rutger, Monte Carlo Computability, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 17:1-17:14
  • Brattka, Vasco, Computability and Analysis, a Historical Approach, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 45-57
  • Brattka, Vasco and Le Roux, Stéphane and Miller, Joseph S. and Pauly, Arno, The Brouwer Fixed Point Theorem Revisited, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 58-67
  • Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Las Vegas Computability and Algorithmic Randomness, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 130-142
  • Brattka, Vasco and Le Roux, Stéphane and Pauly, Arno, On the Computational Content of the Brouwer Fixed Point Theorem, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Berlin, 2012, pages 57-67
  • Brattka, Vasco and Pauly, Arno, Computation with Advice, in: Zheng, Xizhong and Zhong, Ning (eds.), CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis, vol. 24 of Electronic Proceedings in Theoretical Computer Science, 2010, pages 41-55
  • Brattka, Vasco and Gherardi, Guido, Weihrauch Degrees, Omniscience Principles and Weak Computability, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 83-94
  • Brattka, Vasco and Gherardi, Guido, Effective Choice and Boundedness Principles in Computable Analysis, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 95-106
  • Dillhage, Ruth and Brattka, Vasco, Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 45-60
  • Brattka, Vasco and Dillhage, Ruth, On Computable Compact Operators on Banach Spaces, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 365-386
  • Brattka, Vasco and Gherardi, Guido, Borel Complexity of Topological Operations on Computable Metric Spaces, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 83-97
  • Brattka, Vasco, Computable Versions of the Uniform Boundedness Theorem, in: Chatzidakis, Z. and Koepke, P. and Pohlers, W. (eds.), Logic Colloquium 2002, vol. 27 of Lecture Notes in Logic, Association for Symbolic Logic, Urbana, 2006, pages 130-151
  • Brattka, Vasco and Dillhage, Ruth, On computable compact operators on Banach spaces, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), CCA 2006, Third International Conference on Computability and Complexity in Analysis, vol. 333 of Informatik Berichte, FernUniversität in Hagen, 2006, pages 49-66
  • Brattka, Vasco, On the Borel Complexity of Hahn-Banach Extensions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 3-16
  • Brattka, Vasco, Some aspects of computable functional analysis (abstract), in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, page vii
  • Brattka, Vasco and Schröder, Matthias, Computing with Sequences, Weak Topologies and the Axiom of Choice, in: Ong, Luke (ed.), Computer science logic, vol. 3634 of Lecture Notes in Computer Science, Springer, 2005, pages 462-476
  • Brattka, Vasco, On the Borel Complexity of Hahn-Banach Extensions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 320 of Informatik Berichte, FernUniversität in Hagen, 2004, pages 1-13
  • Brattka, Vasco, The Inversion Problem for Computable Linear Operators, in: Alt, Helmut and Habib, Michel (eds.), STACS 2003, vol. 2607 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pages 391-402
  • Brattka, Vasco, Effective Borel measurability and reducibility of functions, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 117-152
  • Brattka, Vasco, Plottable real number functions, in: Daumas, Marc and et al. (eds.), RNC'5 Real Numbers and Computers, 2003, pages 13-30
  • Brattka, Vasco, The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability, in: Ito, Masami and Imaoka, Teruo (eds.), Words, Languages & Combinatorics III, World Scientific Publishing, Singapore, 2003, pages 63-72
  • Brattka, Vasco, Computing Uniform Bounds, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
  • Brattka, Vasco, Recursion and Computability over Topological Structures (Abstract), in: Hurley, Ted and Mac an Airchinnigh, Mícheál and Schellekens, Michel and Seda, Anthony (eds.), The First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, vol. 40 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
  • Brattka, Vasco, Random Numbers and an Incomplete Immune Recursive Set, in: Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo (eds.), Automata, Languages and Programming, vol. 2380 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pages 950-961
  • Brattka, Vasco and Ziegler, Martin, Computability of linear equations, in: Baeza-Yates, Ricardo and Montanari, Ugo and Santoro, Nicola (eds.), Foundations of Information Technology in the Era of Network and Mobile Computing, vol. 223 of IFIP International Federation for Information Processing, Kluwer Academic Publishers, Dordrecht, 2002, pages 95-106
  • Yasugi, Mariko and Brattka, Vasco and Washihara, Masako, Limit computation of some discontinuous functions, in: Theoretical development and feasibility of mathematical analysis on the computer, vol. 1286 of Sūrikaisekikenkyūsho Kōkyūroku, Research Institute for Mathematical Sciences, Kyoto, 2002, pages 79-84
  • Brattka, Vasco, Computable versions of Baire's category theorem, in: Sgall, Jiří and Pultr, Aleš and Kolman, Petr (eds.), Mathematical Foundations of Computer Science 2001, vol. 2136 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 224-235
  • Ziegler, Martin and Brattka, Vasco, Turing Computability of (Non-)Linear Optimization, in: Therese Biedl (ed.), Thirteenth Canadian Conference on Computational Geometry, University of Waterloo, 2001, pages 181-184
  • Ziegler, Martin and Brattka, Vasco, A Computable Spectral Theorem, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 378-388
  • Brattka, Vasco, A Computable Kolmogorov Superposition Theorem, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 7-22
  • Brattka, Vasco, Realistic models of computability on the real numbers, in: Yoshikawa, Atsushi (ed.), Relevance and Feasibility of Mathematical Analysis on the Computer, vol. 1169 of Sūrikaisekikenkyūsho Kōkyūroku, Research Institute for Mathematical Sciences, Kyoto, 2000, pages 62-75
  • Ziegler, Martin and Brattka, Vasco, A Computable Spectral Theorem, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 469-479
  • Ziegler, Martin and Brattka, Vasco, Computing the Dimension of Linear Subspaces, in: Hlaváč, Václav and Jeffery, Keith G. and Wiedermann, Jiří (eds.), SOFSEM 2000: Theory and Practice of Informatics, vol. 1963 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pages 450-458
  • Brattka, Vasco, A Stability Theorem for Recursive Analysis, in: Cristian S. Calude and Michael J. Dinneen (eds.), Combinatorics, Computation & Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1999, pages 144-158
  • Brattka, Vasco, A Stability Theorem for Recursive Analysis, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 1-15
  • Brattka, Vasco and Weihrauch, Klaus, Recursive and Recursively Enumerable Closed Subsets of Euclidean Space, in: Margenstern, Maurice (ed.), Actes de MCU'98, I.U.T. de Metz, 1998, pages 214-234
  • Brattka, Vasco and Weihrauch, Klaus and Zheng, Xizhong, Approaches to Effective Semi-continuity of Real Functions, in: Hsu, Wen-Lian and Kao, Ming-Yang (eds.), Computing and Combinatorics, vol. 1449 of Lecture Notes in Computer Science, Springer, Berlin, 1998, pages 184-193
  • Brattka, Vasco, Computable Invariance, in: Jiang, Tao and Lee, D.T. (eds.), Computing and Combinatorics, vol. 1276 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 146-155
  • Brattka, Vasco, Computable Invariance, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 5-22
  • Brattka, Vasco and Hertling, Peter, Feasible real random access machines, in: Allouche, Jean-Paul and Bajard, Jean-Claude and Didier, Laurent-Stephane and Liardet, Pierre (eds.), Second Real Numbers and Computer Conference, 1996, pages 139-172
  • Brattka, Vasco and Hertling, Peter, Feasible real random access machines, in: Jeffrey, Keith G. and Král, Jaroslav and Bartošek, Miroslav (eds.), SOFSEM'96: Theory and Practice of Informatics, vol. 1175 of Lecture Notes in Computer Science, Springer, Berlin, 1996, pages 335-342
  • Brattka, Vasco, Computable selection in analysis, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 125-138
  • Brattka, Vasco and Hertling, Peter, Feasible real random access machines, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 71-82



  • Avigad, Jeremy and Brattka, Vasco, Computability and analysis: the legacy of Alan Turing, technical report, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, 2012
  • Brattka, Vasco and Le Roux, Stéphane and Pauly, Arno, Connected Choice and the Brouwer Fixed Point Theorem, technical report, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, 2012
  • Archibald, Margaret and Brattka, Vasco and Heuberger, Clemens, Randomness with respect to the Signed-Digit Representation, technical report, Institut für Optimierung und Diskrete Mathematik, TU Graz, Graz, 2007
  • Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus, Computability and Complexity in Analysis, technical report, FernUniversität Hagen, Hagen, 2004
  • Frougny, Christiane and Brattka, Vasco and Müller, Norbert, RNC'6, 6th Conference on Real Numbers and Computers, technical report, Fachbereich Mathematik/Informatik, Unversität Trier, Trier, 2004
  • Brattka, Vasco, Plottable real number functions and the computable graph theorem, technical report, FernUniversität in Hagen, Fachbereich Informatik, Hagen, 2003
  • Brattka, Vasco, Computability on Asymmetric Spaces, technical report, FernUniversität in Hagen, Fachbereich Informatik, Hagen, 2003
  • Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning, Computability and Complexity in Analysis, technical report, FernUniversität in Hagen, Hagen, 2003
  • Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus, Computability and Complexity in Analysis, technical report, FernUniversität Hagen, Hagen, 2002
  • Brattka, Vasco, Computability of Banach Space Principles, technical report, FernUniversität Hagen, Fachbereich Informatik, Hagen, 2001
  • Brattka, Vasco and Ziegler, Martin, Computability of linear equations, technical report, Universität Paderborn, Fachbereich Mathematik-Informatik, Paderborn, 2001
  • Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus, Computability and Complexity in Analysis, technical report, FernUniversität Hagen, Hagen, 2000
  • Brattka, Vasco, Recursive and Computable Operations over Topological Structures, technical report, FernUniversität Hagen, Fachbereich Informatik, Hagen, 1999
  • Brattka, Vasco and Hertling, Peter, Feasible real random access machines, technical report, FernUniversität Hagen, Hagen, 1995
  • Brattka, Vasco and Hertling, Peter, Continuity and computability of relations, technical report, FernUniversität Hagen, Hagen, 1994
This publication list has currently 158 entries