Publications

Here you can find a list of my publications, sorted by type. For some of the papers there are abstracts and electronical versions available.

  • Vasco Brattka, Peter Hertling, and Klaus Weihrauch. A tutorial on computable analysis. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 425-491. Springer, New York, 2008.

  • Vasco Brattka. From Hilbert's 13th Problem to the theory of neural networks: constructive aspects of Kolmogorov's Superposition Theorem. In Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, Kolmogorov's Heritage in Mathematics, pages 253-280. Springer, Berlin, 2007.

  • Vasco Brattka. Computability on non-separable Banach spaces and Landau's theorem. In Laura Crosilla and Peter Schuster, editors, From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics, pages 316-333. Oxford University Press, 2005.

  • Vasco Brattka. 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 Éric Charpentier, Annick Lesne, and Nikolai Nikolski, editors, L'héritage de Kolmogorov en mathématiques, pages 241-268. Éditions Belin, Paris, 2004.

  • Vasco Brattka. Computability over topological structures. In S. Barry Cooper and Sergey S. Goncharov, editors, Computability and Models, pages 93-136. Kluwer Academic Publishers, New York, 2003.

  • Vasco Brattka and Iraj Kalantari. A bibliography of recursive analysis and recursive topology. In Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, editors, Handbook of Recursive Mathematics, volume 138 of Studies in Logic and the Foundations of Mathematics, pages 583-620. Elsevier, Amsterdam, 1998. Volume 1, Recursive Model Theory.

  • Vasco Brattka and Stéphane Le Roux and Arno Pauly. On the Computational Content of the Brouwer Fixed Point Theorem. In S. Barry Cooper and Anuj Dawar and Benedikt Löwe, editors, How the World Computes, volume 7318 of Lecture Notes in Computer Science, pages 57-67. Springer, Berlin, 2012. Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 2012.

  • Vasco Brattka and Guido Gherardi. Weihrauch Degrees, Omniscience Principles and Weak Computability. In Andrej Bauer and Peter Hertling and Ker-I Ko, editors, CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, DROPS Series, Leibniz-Zentrum für Informatik, pages 83-94, Schloß Dagstuhl, Germany, 2009.

  • Vasco Brattka and Guido Gherardi. Effective Choice and Boundedness Principles in Computable Analysis. In Andrej Bauer and Peter Hertling and Ker-I Ko, editors, CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, DROPS Series, Leibniz-Zentrum für Informatik, pages 95-106, Schloß Dagstuhl, Germany, 2009.

  • Ruth Dillhage and Vasco Brattka. Computability of the metric projection onto finite-dimensional linear subspaces. In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, pages 45-60. Elsevier, 2008. CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24, 2008.

  • Vasco Brattka and Ruth Dillhage. On computable compact operators on Banach spaces. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, Proceedings of the Third International Conference on Computability and Complexity in Analysis, volume 167 of Electronic Notes in Theoretical Computer Science, pages 365-386, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

  • Vasco Brattka and Guido Gherardi. Borel complexity of topological operations on computable metric spaces. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, pages 83-97, Berlin, 2007. Springer. Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007.

  • Vasco Brattka. Computable versions of the uniform boundedness theorem. In Z. Chatzidakis, P. Koepke, and W. Pohlers, editors, Logic Colloquium 2002, volume 27 of Lecture Notes in Logic, pages 130-151, Urbana, 2006. Association for Symbolic Logic.

  • Vasco Brattka and Ruth Dillhage. On computable compact operators on Banach spaces. In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors, CCA 2006, Third International Conference on Computability and Complexity in Analysis, volume 333 of Informatik Berichte, pages 49-66. FernUniversität in Hagen, September 2006. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

  • Vasco Brattka. On the Borel complexity of Hahn-Banach extensions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, pages 3-16, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

  • Vasco Brattka. Some aspects of computable functional analysis (abstract). In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, page vii. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

  • Vasco Brattka and Matthias Schröder. Computing with sequences, weak topologies and the axiom of choice. In Luke Ong, editor, Computer science logic, volume 3634 of Lecture Notes in Computer Science, pages 462-476. Springer, 2005.

  • Vasco Brattka. On the Borel complexity of Hahn-Banach extensions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 320 of Informatik Berichte, pages 1-13. FernUniversität in Hagen, August 2004. Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany, August 16-20, 2004.

  • Vasco Brattka. Effective Borel measurability and reducibility of functions. In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 117-152. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

  • Vasco Brattka. The emperor's new recursiveness: The epigraph of the exponential function in two models of computability. In Masami Ito and Teruo Imaoka, editors, Words, Languages & Combinatorics III, pages 63-72, Singapore, 2003. World Scientific Publishing. ICWLC 2000, Kyoto, Japan, March 14-18, 2000.

  • Vasco Brattka. The inversion problem for computable linear operators. In Helmut Alt and Michel Habib, editors, STACS 2003, volume 2607 of Lecture Notes in Computer Science, pages 391-402, Berlin, 2003. Springer. 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003.

  • Vasco Brattka. Plottable real number functions. In Marc Daumas and et al., editors, RNC'5 Real Numbers and Computers, pages 13-30. INRIA, Institut National de Recherche en Informatique et en Automatique, 2003. Lyon, September 3-5, 2003.

  • Vasco Brattka. Computing uniform bounds. In Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors, CCA 2002 Computability and Complexity in Analysis, volume 66 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

  • Vasco Brattka. Random numbers and an incomplete immune recursive set. In Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 950-961, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8-13, 2002.

  • Vasco Brattka. Recursion and computability over topological structures (Abstract). In Ted Hurley, Mícheál Mac an Airchinnigh, Michel Schellekens, and Anthony Seda, editors, The First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, volume 40 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. MFCSIT 2000, Cork, Ireland, July 20-21, 2000.

  • Vasco Brattka and Martin Ziegler. Computability of linear equations. In Ricardo Baeza-Yates, Ugo Montanari, and Nicola Santoro, editors, Foundations of Information Technology in the Era of Network and Mobile Computing, volume 223 of IFIP International Federation for Information Processing, pages 95-106, Dordrecht, 2002. Kluwer Academic Publishers. 2nd IFIP International Conference on Theoretical Computer Science, Montréal, Canada, August 25-30, 2002.

  • Mariko Yasugi, Vasco Brattka, and Masako Washihara. Limit computation of some discontinuous functions. In Theoretical development and feasibility of mathematical analysis on the computer, volume 1286 of Surikaisekikenkyusho Kokyuroku, pages 79-84, Kyoto, 2002. Research Institute for Mathematical Sciences.

  • Vasco Brattka. Computable versions of Baire's category theorem. In Jirí Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, volume 2136 of Lecture Notes in Computer Science, pages 224-235, Berlin, 2001. Springer. 26th International Symposium, MFCS 2001, Mariánské Lázne, Czech Republic, August 27-31, 2001.

  • Martin Ziegler and Vasco Brattka. A computable spectral theorem. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 378-388, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

  • Martin Ziegler and Vasco Brattka. Turing computability of (non-)linear optimization. In Therese Biedl, editor, Thirteenth Canadian Conference on Computational Geometry, pages 181-184. University of Waterloo, 2001. CCCG 2001, August 13-15, 2001.

  • Vasco Brattka. A computable Kolmogorov superposition theorem. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 7-22. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

  • Vasco Brattka. Realistic models of computability on the real numbers. In Atsushi Yoshikawa, editor, Relevance and Feasibility of Mathematical Analysis on the Computer, volume 1169 of Surikaisekikenkyusho Kokyuroku, pages 62-75, Kyoto, 2000. Research Institute for Mathematical Sciences.

  • Martin Ziegler and Vasco Brattka. A computable spectral theorem. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 469-479. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

  • Martin Ziegler and Vasco Brattka. Computing the dimension of linear subspaces. In Václav Hlavác, Keith G. Jeffery, and Jirí Wiedermann, editors, SOFSEM 2000: Theory and Practice of Informatics, volume 1963 of Lecture Notes in Computer Science, pages 450-458, Berlin, 2000. Springer. 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25-December 2, 2000.

  • Vasco Brattka. A stability theorem for recursive analysis. In Cristian S. Calude and Michael J. Dinneen, editors, Combinatorics, Computation & Logic, Discrete Mathematics and Theoretical Computer Science, pages 144-158, Singapore, 1999. Springer. Proceedings of DMTCS'99 and CATS'99, Auckland, New Zealand, January 1999.

  • Vasco Brattka. A stability theorem for recursive analysis. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 1-15. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

  • Vasco Brattka and Klaus Weihrauch. Recursive and recursively enumerable closed subsets of Euclidean space. In Maurice Margenstern, editor, Actes de MCU'98, volume 2, pages 214-234. I.U.T. de Metz, 1998. Second International Colloquium, Universal Machines and Computations, Metz, March 23-27, 1998.

  • Vasco Brattka, Klaus Weihrauch, and Xizhong Zheng. Approaches to effective semi-continuity of real functions. In Wen-Lian Hsu and Ming-Yang Kao, editors, Computing and Combinatorics, volume 1449 of Lecture Notes in Computer Science, pages 184-193, Berlin, 1998. Springer. Fourth Annual Conference, COCOON'98, Taipei, Taiwan, August 1998.

  • Vasco Brattka. Computable invariance. In Tao Jiang and D.T. Lee, editors, Computing and Combinatorics, volume 1276 of Lecture Notes in Computer Science, pages 146-155, Berlin, 1997. Springer. Third Annual Conference, COCOON'97, Shanghai, China, August 1997.

  • Vasco Brattka. Computable invariance. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 5-22. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

  • Vasco Brattka and Peter Hertling. Feasible real random access machines. In Jean-Paul Allouche, Jean-Claude Bajard, Laurent-Stephane Didier, and Pierre Liardet, editors, Second Real Numbers and Computer Conference, pages 139-172. Centre International de Recontres Mathematiques, 1996. Marseille, April 9-11, 1996.

  • Vasco Brattka and Peter Hertling. Feasible real random access machines. In Keith G. Jeffrey, Jaroslav Král, and Miroslav Bartosek, editors, SOFSEM'96: Theory and Practice of Informatics, volume 1175 of Lecture Notes in Computer Science, pages 335-342, Berlin, 1996. Springer. 23rd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23-30, 1996.

  • Vasco Brattka. Computable selection in analysis. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 125-138. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

  • Vasco Brattka and Peter Hertling. Feasible real random access machines. In Ker-I Ko and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 190 of Informatik Berichte, pages 71-82. FernUniversität Hagen, September 1995. CCA Workshop, Hagen, August 19-20, 1995.

  • Paola Bonizzoni, Vasco Brattka and Benedikt Löwe, editors. The Nature of Computation. Logic, Algorithms, Applications, volume 7921 of Lecture Notes in Computer Science, Berlin, 2013. Springer. Proceedings of the 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013.

  • Ulrich Berger, Vasco Brattka and Andrei S. Morozov and Dieter Spreen, editors. Continuity, Computability, Constructivity: From Logic to Algorithms , volume 163, issue 8 of Annals of Pure and Applied Logic, Amsterdam, 2012. Elsevier.

  • Margaret Archibald, Vasco Brattka, Valentin Goranko, and Benedikt Löwe, editors. Infinity in Logic and Computation, volume 5489 of Lecture Notes in Artificial Intelligence, Berlin, 2009. Springer. Selected Papers of the International Conference ILC 2007 held in Cape Town, South Africa, November 2007.

  • Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors. Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, volume 221 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2008. Elsevier. CCA 2008, Hagen, Germany, August 21-24, 2008.

  • Vasco Brattka, Hajime Ishihara, Matthias Schröder, and Ning Zhong, editors. Computability and Complexity in Analysis, volume 14 of Journal of Universal Computer Science, Graz, 2008. Graz University of Technology. Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy.

  • Vasco Brattka, Hajime Ishihara, Matthias Schröder, and Ning Zhong, editors. Computability and Complexity in Analysis, volume 54 of Mathematical Logic Quarterly, Weinheim, 2008. Wiley-VCH. Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy.

  • Vasco Brattka, Gerhard Jäger, and Hans-Peter Künzi, editors. Logic and Information, From Logic to Constructive Reasoning, volume 76 of The Journal of Logic and Algebraic Programming, Amsterdam, 2008. Elsevier. Selected Papers of the Swiss-South-African joint seminar, University of Bern, Switzerland, January 22-25, 2007.

  • Vasco Brattka, Christiane Frougny, and Norbert Müller, editors. Real Numbers, volume 41 of Theoretical Informatics and Applications, Les Ulis, 2007. EDP Sciences. Selected Papers of the 6th conference on Real Numbers and Computers, Dagstuhl, Germany, November 15-17, 2004.

  • Vasco Brattka, Peter Hertling, Ker-I Ko, and Hideki Tsuiki, editors. Computability and Complexity in Analysis, volume 522 of Journal of Complexity, Amsterdam, 2006. Elsevier. Selected Papers of the International Conference CCA 2005, held in Kyoto, Japan, August 25-29, 2005.

  • Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors. Proceedings of the 6th Workshop on Computability and Complexity in Analysis, volume 120 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

  • Vasco Brattka, Peter Hertling, Ker-I Ko, and Ning Zhong, editors. Special Issue Computability and Complexity in Analysis, volume 50 of Mathematical Logic Quarterly, Weinheim, 2004. Wiley-VCH. Selected Papers of the International Conference CCA 2003, held in Cincinnati, Ohio, August 28-30, 2003.

  • Vasco Brattka, Peter Hertling, Mariko Yasugi, and Ning Zhong, editors. Selected Papers of the Dagstuhl Seminar on Computability and Complexity in Analysis 2001, volume 48 (Suppl. 1) of Mathematical Logic Quarterly, Weinheim, 2002. Wiley-VCH.

  • Vasco Brattka, Matthias Schröder, and Klaus Weihrauch, editors. Computability and Complexity in Analysis, volume 66(1) of Electronic Notes in Theoretical Computer Science, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

  • Jens Blanck, Vasco Brattka, and Peter Hertling, editors. Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers.

  • Margaret Archibald, Vasco Brattka, and Clemens Heuberger. Randomness with respect to the signed-digit representation. Report 2007-13, Institut für Optimierung und Diskrete Mathematik, TU Graz, Graz, September 2007.

  • Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 320, FernUniversität Hagen, Hagen, August 2004. Preliminary Proccedings, Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany, August 16-20, 2004.

  • Christiane Frougny, Vasco Brattka, and Norbert Müller. RNC'6, 6th conference on real numbers and computers. Forschungsbericht 04-8, Fachbereich Mathematik/Informatik, Unversität Trier, Trier, 2004. RNC 6, Dagstuhl, Germany, November 15-17, 2004.

  • Vasco Brattka. Computability on asymmetric spaces. Informatik Berichte 305, FernUniversität in Hagen, Fachbereich Informatik, Hagen, December 2003.

  • Vasco Brattka. Plottable real number functions and the computable graph theorem. Informatik Berichte 300, FernUniversität in Hagen, Fachbereich Informatik, Hagen, July 2003.

  • Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong. Computability and complexity in analysis. Informatik Berichte 302, FernUniversität in Hagen, Hagen, August 2003. Proccedings, International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

  • Vasco Brattka, Matthias Schröder, and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 294, FernUniversität Hagen, Hagen, June 2002. Preliminary Proccedings, 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002.

  • Vasco Brattka. Computability of Banach space principles. Informatik Berichte 286, FernUniversität Hagen, Fachbereich Informatik, Hagen, June 2001.

  • Vasco Brattka and Martin Ziegler. Computability of linear equations. Technical Report-Reihe Informatik 226, Universität Paderborn, Fachbereich Mathematik-Informatik, Paderborn, September 2001.

  • Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 272, FernUniversität Hagen, Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

  • Vasco Brattka. Recursive and computable operations over topological structures. Informatik Berichte 255, FernUniversität Hagen, Fachbereich Informatik, Hagen, July 1999. Dissertation.

  • Vasco Brattka and Peter Hertling. Feasible real random access machines. Informatik Berichte 193, FernUniversität Hagen, Hagen, December 1995.

  • Vasco Brattka and Peter Hertling. Continuity and computability of relations. Informatik Berichte 164, FernUniversität Hagen, Hagen, September 1994.