• 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.

• Tanja Grubba, Klaus Weihrauch, and Yatao Xu. Effectivity on continuous functions in topological spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 237-254. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for locally compact Hausdorff spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 3-12. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for locally compact Hausdorff spaces. Journal of Universal Computer Science, 14(6):845-860, 2008.

• Jack Lutz and Klaus Weihrauch. Connectivity properties of dimension level sets. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 295-304. Elsevier, 2008. CCA 2007, Siena, Italy, June 16-18, 2007.

• Klaus Weihrauch. The computable multi-functions on multi-represented sets are closed under programming. Journal of Universal Computer Science, 14(6):801-844, 2008.

• Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong. CCA 2007, fourth international conference on computability and complexity in analysis. Informatik Berichte 338, FernUniversität Hagen, Hagen, June 2007. CCA 2007, Siena, Italy, June 16-18, 2007.

• Decheng Ding, Klaus Weihrauch, and Yongcheng Wu. Absolutely non-effective predicates and functions in computable analysis. In Jin-Yi Cai, S. Barry Cooper, and Hong Zhou, editors, Theory and Applications of Models of Computation, volume 4484 of Lecture Notes in Computer Science, pages 595-604, 2007.

• Tanja Grubba and Klaus Weihrauch. On computable metrization. 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 345-364, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Tanja Grubba, Matthias Schröder, and Klaus Weihrauch. Computable metrization. Mathematical Logic Quarterly, 53(4-5):381-395, 2007.

• Tanja Grubba, Klaus Weihrauch, and Yatao Xu. Effectivity on continuous functions in topological spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, CCA 2007, Fourth International Conference on Computability and Complexity in Analysis, volume 338 of Informatik Berichte, pages 137-154. FernUniversität in Hagen, June 2007. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for locally compact Hausdorff spaces. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, CCA 2007, Fourth International Conference on Computability and Complexity in Analysis, volume 338 of Informatik Berichte, pages 205-217. FernUniversität in Hagen, June 2007. CCA 2007, Siena, Italy, June 16-18, 2007.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for the dual of C[0;1]. 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 157-177, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for the dual of C[0;1]. Mathematical Logic Quarterly, 53(4-5):415-430, 2007.

• Jack Lutz and Klaus Weihrauch. Connectivity properties of dimension level sets. In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors, CCA 2007, Fourth International Conference on Computability and Complexity in Analysis, volume 338 of Informatik Berichte, pages 219-229. FernUniversität in Hagen, June 2007. CCA 2007, Siena, Italy, June 16-18, 2007.

• Klaus Weihrauch and Ning Zhong. Computable analysis of the abstract Cauchy problem in a Banach space and its applications (I). 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 33-59, Amsterdam, 2007. Elsevier. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Klaus Weihrauch and Ning Zhong. Computable analysis of the abstract Cauchy problem in a Banach space and its applications I. Mathematical Logic Quarterly, 53(4-5):511-531, 2007.

• Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch. CCA 2006, third international conference on computability and complexity in analysis. Informatik Berichte 333, FernUniversität Hagen, Hagen, September 2006. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Tanja Grubba and Klaus Weihrauch. On computable metrization. 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 176-191. FernUniversität in Hagen, September 2006. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Hong Lu and Klaus Weihrauch. Computable Riesz representation for the dual of C[0;1]. 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 193-210. FernUniversität in Hagen, September 2006. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Klaus Weihrauch and Ning Zhong. An algorithm for computing fundamental solutions. SIAM Journal on Computing, 35(6):1283-1294, 2006.

• Klaus Weihrauch and Ning Zhong. Computable analysis of the abstract Cauchy problem in a Banach space and its applications (I). 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 287-309. FernUniversität in Hagen, September 2006. CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.

• Klaus Weihrauch and Ning Zhong. Computing Schrödinger propagators on Type-2 Turing machines. Journal of Complexity, 22(6):918-935, 2006.

• Yongcheng Wu and Klaus Weihrauch. A computable version of the Daniell-Stone theorem on integration and linear functionals. Theoretical Computer Science, 359(1-3):28-42, 2006.

• Tanja Grubba and Klaus Weihrauch. A computable version of Dini's theorem for topological spaces. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 117-129. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Tanja Grubba and Klaus Weihrauch. A computable version of Dini's theorem for topological spaces. In Pinar Yolum, Tunga Güngör, Fikret Gürgen, and Can Özturan, editors, Computer and Information Sciences - ISCIS 2005, volume 3733 of Lecture Notes in Computer Science, pages 927-936, Berlin, 2005. Springer. 20th International Symposium, ISCIS, Istanbul, Turkey, October 2005.

• Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 326, FernUniversität Hagen, Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Klaus Weihrauch. Multi-functions on multi-represented sets are closed under flowchart programming. In Tanja Grubba, Peter Hertling, Hideki Tsuiki, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 326 of Informatik Berichte, pages 267-300. FernUniversität in Hagen, July 2005. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25-29, 2005.

• Klaus Weihrauch and Ning Zhong. An algorithm for computing fundamental solutions. 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 201-215, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• Klaus Weihrauch and Ning Zhong. Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines. Theoretical Computer Science, 332(1-3):337-366, 2005.

• Yongcheng Wu and Klaus Weihrauch. A computable version of the Daniell-Stone theorem on integration and linear functionals. 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 217-230, Amsterdam, 2005. Elsevier. 6th International Workshop, CCA 2004, Wittenberg, Germany, August 16-20, 2004.

• 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.

• Klaus Weihrauch and Ning Zhong. An algorithm for computing fundamental solutions. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 320 of Informatik Berichte, pages 181-194. FernUniversität in Hagen, August 2004. Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany, August 16-20, 2004.

• Yongcheng Wu and Klaus Weihrauch. A computable version of the Daniell-Stone theorem on integration and linear functionals. In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 320 of Informatik Berichte, pages 195-207. FernUniversität in Hagen, August 2004. Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany, August 16-20, 2004.

• 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.

• Peter Hertling and Klaus Weihrauch. Random elements in effective topological spaces with measure. Information and Computation, 181(1):32-56, 2003.

• Robert Rettinger and Klaus Weihrauch. The computational complexity of some Julia sets. In Michel X. Goemans, editor, Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 177-185, New York, 2003. ACM Press. San Diego, California, USA, June 9-11, 2003.

• Klaus Weihrauch. Computational complexity on computable metric spaces. Mathematical Logic Quarterly, 49(1):3-21, 2003.

• Klaus Weihrauch. Continuity in computable analysis (abstract). In Vasco Brattka, Matthias Schröder, Klaus Weihrauch, and Ning Zhong, editors, Computability and Complexity in Analysis, volume 302 of Informatik Berichte, pages 99-100. FernUniversität in Hagen, August 2003. International Conference, CCA 2003, Cincinnati, USA, August 28-30, 2003.

• Ning Zhong and Klaus Weihrauch. Computability theory of generalized functions. Journal of the Association for Computing Machinery, 50(4):469-505, 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.

• Robert Rettinger and Klaus Weihrauch. The computational complexity of some Julia sets. 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.

• Klaus Weihrauch. Computable analysis. In B.D. Masurov et al., editor, Proceedings of the international conference ``Logic and Applications'' honouring Yu. L. Ershov on his 60th birthday, pages 165-178, Novosibirsk, 2002. University of Novosibirsk.

• Klaus Weihrauch. Computational complexity on computable metric spaces. Electronic Colloquium in Computational Complexity TR02-014, University Trier, Trier, 2002.

• Klaus Weihrauch and Ning Zhong. Is wave propagation computable or can wave computers beat the Turing machine? Proceedings of the London Mathematical Society, 85(2):312-332, 2002.

• Klaus Weihrauch and Ning Zhong. The solution operator of the Korteweg-de Vries equation is computable. 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.

• Klaus Weihrauch and Ning Zhong. The solution operator of the Korteweg-de Vries equation is computable. Informatik Berichte 293, FernUniversität Hagen, Hagen, June 2002.

• C.S. Calude, P. Hertling, H. Jürgensen, and K. Weihrauch. Randomness on full shift spaces. Chaos, Solitons & Fractals, 12(3):491-503, 2001.

• Klaus Weihrauch. Computational complexity on computable metric spaces. Informatik Berichte 291, FernUniversität Hagen, Hagen, December 2001.

• Klaus Weihrauch. On computable metric spaces Tietze-Urysohn extension is computable. In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 357-368, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Klaus Weihrauch and Ning Zhong. Is the linear Schrödinger propagator Turing computable? In Jens Blanck, Vasco Brattka, and Peter Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 369-377, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.

• Klaus Weihrauch and Ning Zhong. Turing computability of a nonlinear Schrödinger propagator. Informatik Berichte 285, FernUniversität Hagen, Hagen, May 2001.

• Klaus Weihrauch and Ning Zhong. Turing computability of a nonlinear Schrödinger propagator. In Jie Wang, editor, Computing and Combinatorics, volume 2108 of Lecture Notes in Computer Science, pages 596-599, Berlin, 2001. Springer. 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001.

• Xizhong Zheng and Klaus Weihrauch. The arithmetical hierarchy of real numbers. Mathematical Logic Quarterly, 47(1):51-65, 2001.

• Klaus Ambos-Spies, Klaus Weihrauch, and Xizhong Zheng. Weakly computable real numbers. Journal of Complexity, 16(4):676-690, 2000.

• 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.

• Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.

• Klaus Weihrauch. On computable metric spaces Tietze-Urysohn extension is computable. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 441-452. FernUniversität Hagen, September 2000. CCA 2000 Workshop, Swansea, Wales, September 17-19, 2000.

• Klaus Weihrauch and Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theoretical Computer Science, 234:109-133, 2000.

• Ning Zhong and Klaus Weihrauch. Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen, September 2000.

• Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65-93, 1999.

• C.S. Calude, P. Hertling, H. Jürgensen, and K. Weihrauch. Randomness on full shift spaces. Technical Report 100, CDMTCS, Auckland, April 1999.

• Klaus Weihrauch. Computability on the probability measures on the Borel sets of the unit interval. Theoretical Computer Science, 219:421-437, 1999.

• Klaus Weihrauch and Xizhong Zheng. Effectiveness of the global modulus of continuity on metric spaces. Theoretical Computer Science, 219:439-450, 1999.

• Klaus Weihrauch and Ning Zhong. The wave propagator is Turing computable. In Jirí Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 697-706, Berlin, 1999. Springer. 26th International Colloquium, ICALP'99, Prague, Czech Republic, July, 1999.

• Xizhong Zheng and Klaus Weihrauch. The arithmetical hierarchy of real numbers. In Miroslaw Kutylowski, Leszek Pacholski, and Tomasz Wierzbicki, editors, Mathematical Foundations of Computer Science 1999, volume 1672 of Lecture Notes in Computer Science, pages 23-33, Berlin, 1999. Springer. 24th International Symposium, MFCS'99, Szklarska Por c eba, Poland, September, 1999.

• Xizhong Zheng, Vasco Brattka, and Klaus Weihrauch. Approaches to effective semi-continuity of real functions. Mathematical Logic Quarterly, 45(4):481-496, 1999.

• 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.

• Peter Hertling and Klaus Weihrauch. Randomness spaces. In Kim G. Larsen, Sven Skyum, and Glynn Winskel, editors, Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 796-807, Berlin, 1998. Springer. 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 1998.

• Peter Hertling and Klaus Weihrauch. Randomness spaces. Technical Report 079, CDMTCS, Auckland, January 1998.

• Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jirí Wiedermann. Computability and complexity in analysis. Informatik Berichte 235, FernUniversität Hagen, Hagen, August 1998. Proceedings of the CCA Workshop, Brno, Czech Republic, August, 1998.

• Klaus Weihrauch. A refined model of computation for continuous problems. Journal of Complexity, 14:102-121, 1998.

• Klaus Weihrauch and Xizhong Zheng. A finite hierarchy of the recursively enumerable real numbers. In Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, Mathematical Foundations of Computer Science 1998, volume 1450 of Lecture Notes in Computer Science, pages 798-806, Berlin, 1998. Springer. 23rd International Symposium, MFCS'98, Brno, Czech Republic, August, 1998.

• Klaus Weihrauch and Xizhong Zheng. A finite hierarchy of the recursively enumerable real numbers. 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 117-125. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Klaus Weihrauch and Ning Zhong. The wave propagator is Turing computable. 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 127-155. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.

• Klaus Weihrauch. Computability on the probability measures on the Borel sets of the unit interval. Informatik Berichte 212, FernUniversität Hagen, Hagen, February 1997.

• Klaus Weihrauch. Computability on the probability measures on the Borel sets of the unit interval. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, volume 1256 of Lecture Notes in Computer Science, pages 166-176, Berlin, 1997. Springer. 24th International Colloquium, ICALP'97, Bologna, Italy, July 1997.

• Klaus Weihrauch. A foundation for computable analysis. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, pages 66-89, Singapore, 1997. Springer. Proceedings of DMTCS'96.

• Klaus Weihrauch. A foundation for computable analysis. In Christian Freksa, Matthias Jantzen, and Rüdiger Valk, editors, Foundations of Computer Science, volume 1337 of Lecture Notes in Computer Science, pages 185-199, Berlin, 1997. Springer. Potential - Theory - Cognition.

• Klaus Weihrauch. A foundation for computable analysis. In Frantisek Plásil and Keith G. Jeffery, editors, SOFSEM'97: Theory and Practice of Informatics, volume 1338 of Lecture Notes in Computer Science, pages 104-121, Berlin, 1997. Springer. 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 1997.

• Klaus Weihrauch. Random real numbers. Informatik Berichte 219, FernUniversität Hagen, Hagen, June 1997.

• Klaus Weihrauch and Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. In Tao Jiang and D.T. Lee, editors, Computing and Combinatorics, volume 1276 of Lecture Notes in Computer Science, pages 166-175, Berlin, 1997. Springer. Third Annual Conference, COCOON'97, Shanghai, China, August 1997.

• Klaus Weihrauch and Xizhong Zheng. Effectiveness of the global modulus of continuity on metric spaces. In Eugenio Moggi and Giuseppe Rosolini, editors, Category Theory and Computer Science, volume 1290 of Lecture Notes in Computer Science, pages 210-219, Berlin, 1997. Springer. 7th International Conference, CTCS'97, Santa Margherita Ligure, Italy, September 4-6, 1997.

• Ker-I Ko and Klaus Weihrauch. On the measure of two-dimensional regions with polynomial-time computable boundaries. In Steve Homer and Jin-Yi Cai, editors, Eleventh Annual IEEE Conference on Computational Complexity, pages 150-159, Los Alamitos, 1996. IEEE Computer Society Press.

• Ker-I Ko, Norbert Müller, and Klaus Weihrauch. Computability and complexity in analysis. Forschungsbericht Mathematik/Informatik 96-44, Universität Trier, Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Klaus Weihrauch. Computability on the probability measures on the Borel sets of the unit interval. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 99-112. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Klaus Weihrauch. A foundation of computable analysis. In Jean-Paul Allouche, Jean-Claude Bajard, Laurent-Stephane Didier, and Pierre Liardet, editors, Second Real Numbers and Computer Conference, pages 101-119. Centre International de Recontres Mathematiques, 1996. Marseille, April 9-11, 1996.

• Klaus Weihrauch and Xizhong Zheng. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. In Ker-I Ko, Norbert Müller, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, pages 115-129. Universität Trier, 1996. Second CCA Workshop, Trier, August 22-23, 1996.

• Ker-I Ko and Klaus Weihrauch. Computability and complexity in analysis. Informatik Berichte 190, FernUniversität Hagen, Hagen, September 1995. Proceedings of the CCA Workshop, Hagen, August 19-20, 1995.

• Klaus Weihrauch. A foundation of computable analysis. Bulletin of the European Association for Theoretical Computer Science, 57:167-182, October 1995. The Structural Complexity Column by Juris Hartmanis.

• Klaus Weihrauch. A simple introduction to computable analysis. Informatik Berichte 171, FernUniversität Hagen, Hagen, July 1995. 2nd edition.

• Peter Hertling and Klaus Weihrauch. Levels of degeneracy and exact lower complexity bounds for geometric algorithms. In Proceedings of the Sixth Canadian Conference on Computational Geometry, pages 237-242. University of Saskatchewan, 1994. Saskatoon, Saskatchewan, August 2-6, 1994.

• Peter Hertling and Klaus Weihrauch. On the topological classification of degeneracies. Informatik Berichte 154, FernUniversität Hagen, Hagen, February 1994.

• Klaus Weihrauch. Effektive Analysis. Correspondence course 1681, FernUniversität Hagen, 1994.

• Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191-210, 1993. Fundamental Study.

• Bernhard Heinemann and Klaus Weihrauch. Logik für Informatiker. Teubner, Stuttgart, 2. edition, 1992.

• Ludwig Staiger and Klaus Weihrauch. In the Cantor space and Baire space, G_ delta setminus F_ sigma is a single Wadge-degree, an effective proof. Informatik Berichte 119, FernUniversität Hagen, Hagen, January 1992.

• Klaus Weihrauch. The degrees of discontinuity of some translators between representations of the real numbers. Technical Report TR-92-050, International Computer Science Institute, Berkeley, July 1992.

• Klaus Weihrauch. The degrees of discontinuity of some translators between representations of the real numbers. Informatik Berichte 129, FernUniversität Hagen, Hagen, July 1992.

• Klaus Weihrauch. A simple and powerful approach for studying constructivity, computability, and complexity. In J.P. Myers and M.J. O'Donnell, editors, Constructivity in computer science, volume 613 of Lecture Notes in Computer Science, pages 228-246, Berlin, New York, 1992. Springer. Summer Symposium San Antonio, TX, June 19-22, 1991.

• Klaus Weihrauch. The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130, FernUniversität Hagen, Hagen, September 1992.

• Klaus Weihrauch. The lowest Wadge-degrees of subsets of the Cantor space. Informatik Berichte 107, FernUniversität Hagen, Hagen, April 1991.

• Klaus Weihrauch. On the complexity of online computations of real functions. Journal of Complexity, 7:380-394, 1991.

• Klaus Weihrauch and Christoph Kreitz. Type 2 computational complexity of functions on Cantor's space. Theoretical Computer Science, 82:1-18, 1991. Fundamental Study.

• Klaus Weihrauch. Constructivity, computability, and computational complexity in analysis. In J. Csirik, J. Demetrovics, and F. Gécseg, editors, Fundamentals of Computation Theory, volume 380 of Lecture Notes in Computer Science, pages 480-493. Springer, 1989. International Conference FCT'89, Szeged, Hungary, August 21-25, 1989.

• Christoph Kreitz and Klaus Weihrauch. Compactness in constructive analysis revisited. Annals of Pure and Applied Logic, 36:29-38, 1987.

• Klaus Weihrauch. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987.

• Klaus Weihrauch. Constructivity as continuity: an approach to constructive and computable mathematics without constructive logic. Informatik Berichte 67, FernUniversität Hagen, Hagen, May 1987.

• Klaus Weihrauch and Christoph Kreitz. Dependence, convergence, and computational complexity of continuous functionals and operators on cantor's space. Informatik Berichte 68, FernUniversität Hagen, Hagen, May 1987.

• Klaus Weihrauch and Christoph Kreitz. Representations of the real numbers and of the open subsets of the set of real numbers. Annals of Pure and Applied Logic, 35:247-260, 1987.

• H.J. Dettki, H. Schuster, and K. Weihrauch. Type 2 recursion theory. In J. Demetrovics, G. Katona, and A. Salomaa, editors, Algebra, Combinatorics and Logic in Computer Science, Vol. 1, volume 42 of Coll. Math. Soc. János Bolyai, pages 355-361, 1986. Papers from Colloq., Sept. 12-16, 1983, Györ.

• Klaus Weihrauch. Stetige und berechenbare Funktionen auf berechenbaren metrischen Räumen. Informatik Berichte 63, FernUniversität Hagen, Hagen, September 1986.

• Christoph Kreitz and Klaus Weihrauch. Theory of representations. Theoretical Computer Science, 38:35-53, 1985.

• Klaus Weihrauch. A simple formalism for solving domain equations. Informatik Berichte 57, FernUniversität Hagen, Hagen, November 1985.

• Klaus Weihrauch. Type 2 recursion theory. Theoretical Computer Science, 38:17-33, 1985.

• Christoph Kreitz and Klaus Weihrauch. Compactness in constructive analysis revisited. Informatik Berichte 49, FernUniversität Hagen, Hagen, September 1984.

• Christoph Kreitz and Klaus Weihrauch. Towards a thoery of representations. In G. Wechsung, editor, Frege Conference 1984, pages 73-79, Berlin, 1984. Akademie-Verlag. Proceedings of the International Conference held at Schwerin, September 10-14, 1984.

• Christoph Kreitz and Klaus Weihrauch. A unified approach to constructive and recursive analysis. In M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, and W. Thomas, editors, Computation and Proof Theory, volume 1104 of Lecture Notes in Mathematics, pages 259-278, Berlin, 1984. Springer. Proceedings of the Logic Colloquium, Aachen, July 18-23, 1983, Part II.

• Christoph Kreitz and Klaus Weihrauch. A unified approach to constructive and recursive analysis. Informatik Berichte 44, FernUniversität Hagen, Hagen, February 1984.

• Klaus Weihrauch and Christoph Kreitz. Representations of the real numbers and of the open subsets of the set of real numbers. Informatik Berichte 43, FernUniversität Hagen, Hagen, February 1984.

• Christoph Kreitz and Klaus Weihrauch. Towards a theory of representations. Informatik Berichte 40, FernUniversität Hagen, Hagen, July 1983.

• Klaus Weihrauch and G. Schäfer. Admissible representations of effective cpo's. Theoretical Computer Science, 26:131-147, 1983.

• Christoph Kreitz and Klaus Weihrauch. Complexity theory on real numbers and functions. In A.B. Cremers and H.P. Kriegel, editors, Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science. Springer, 1982. 6th GI-Conference, Dortmund, January 5-7, 1983.

• Christoph Kreitz and Klaus Weihrauch. Komplexitätstheorie auf reellen Zahlen und Funktionen. Informatik Berichte 28, FernUniversität Hagen, Hagen, November 1982.

• Klaus Weihrauch. On natural numberings and representations. Informatik Berichte 29, FernUniversität Hagen, Hagen, December 1982.

• Giesela Schäfer and Klaus Weihrauch. Admissible representations of effective cpo-s. Informatik Berichte 16, FernUniversität Hagen, Hagen, April 1981.

• Klaus Weihrauch. Computability on metric spaces. Informatik Berichte 21, FernUniversität Hagen, Hagen, September 1981.

• Klaus Weihrauch. Is binary notation optimal? The American Mathematical Monthly, pages 199-200, 1981. Unsolved problems, edited by Guy, Richard.

• Klaus Weihrauch. Recursion and complexity theory on cpo-s. In Peter Deussen, editor, Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer, 1981. 5th GI-Conference, Karlsruhe, March 23-25, 1981.

• Klaus Weihrauch and Giesela Schäfer. Admissible representations of effective cpo's. In J. Gruska and M. Chytil, editors, Mathematical Foundations of Computer Science 1981, volume 118 of Lecture Notes in Computer Science. Springer, 1981. Proceedings, 10th Sympsoium Strbské Pleso, Czechoslovakia, August 31-September 4, 1981.

• Klaus Weihrauch and Ulrich Schreiber. Embedding metric spaces into cpo's. Theoretical Computer Science, 16:5-24, 1981.

• Angelika Reiser and Klaus Weihrauch. Natural numberings and generalized computability. Elektronische Informationsverarbeitung und Kybernetik, 16:11-20, 1980.

• Klaus Weihrauch. Rekursionstheorie und Komplexitätstheorie auf effektiven CPO-s. Informatik Berichte 9, FernUniversität Hagen, Hagen, September 1980.

• Klaus Weihrauch and Thomas Deil. Berechenbarkeit auf cpo-s. Schriften zur Informatik und angewandten Mathematik 63, Technische Hochschule Aachen, Aachen, 1980. Eine Vorlesung von Klaus Weihrauch ausgearbeitet von Thomas Deil.

• Klaus Weihrauch and Ulrich Schreiber. Embedding metric spaces into cpo-s. Informatik Berichte 2, FernUniversität Hagen, Hagen, April 1980.

• Klaus Weihrauch and Ulrich Schreiber. Metric spaces defined by weighted algebraic cpo-s. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT'79, pages 516-522, Berlin, 1979. Akademie-Verlag. Proceedings of the Conference on Algebraic, Arithmetic, and Categorial Methods in Computation Theory, Berlin, September 17-21, 1979.

• Rutger Verbeek and Klaus Weihrauch. Data representation and computational complexity. Theoretical Computer Science, 7:99-116, 1978.

• Rutger Verbeek and Klaus Weihrauch. Data presentation and computational complexity. Proceedings of a conference on theoretical computer science, University of Waterloo, 1977.

• Klaus Weihrauch. Computational complexity and control structure of programs. Rivista di Informatica, 7(1):17-24, March 1977.

• Klaus Weihrauch. A generalized computability thesis. In J. Gruska, editor, Mathematical Foundations of Computer Science 1977, volume 53 of Lecture Notes in Computer Science, pages 570-570. Springer, 1977. Proceedings, 6th Symposium, Tatranska Lomnica, September 5-9, 1977.

• Klaus Weihrauch. A generalized computability thesis. In Marek Karpinski, editor, Fundamentals of Computation Theory, volume 56 of Lecture Notes in Computer Science, pages 538-542. Springer, 1977. Proceedings of the 1977 International FCT-Conference, Poznan-Kornik, Poland, September 19-23, 1977.

• Rutger Verbeek and Klaus Weihrauch. Datendarstellung und Leistungsfähigkeit von Maschinen. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 96, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, June 1976.

• Rutger Verbeek and Klaus Weihrauch. The influence of the data presentation on the computational power of machines. In A. Mazurkiewicz, editor, Mathematical Foundations of Computer Science 1976, volume 45 of Lecture Notes in Computer Science, pages 551-558. Springer, 1976. Proceedings, 5th Symposium, Gdansk, September 6-10, 1976.

• Klaus Weihrauch. The computational complexity of program schemata. Journal of Computer and Systems Sciences, 12(1):80-107, February 1976.

• F.W. v. Henke, K. Indermark, G. Rose, and K. Weihrauch. On primitive recursive wordfunctions. Computing, 15:217-234, 1975.

• Klaus Weihrauch. Die Berechnungskomplexität von Programmschemata. Habilitationsschrift, Universität Bonn, Bonn, 1975.

• Klaus Weihrauch. Program schemata with polynomial bounded counters. Information Processing Letters, 3(3):91-96, January 1975.

• Klaus Weihrauch. The computational complexity of program schemata. In Jacques Loeckx, editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 326-334. Springer, 1974. 2nd Colloquium, University of Saarbrücken, July 29-August 2, 1974.

• Klaus Weihrauch. A general definition of computability on sets of finite objects. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 80, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, July 1974.

• Klaus Weihrauch. On the computational complexity of program schemata. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 70, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, February 1974.

• Klaus Weihrauch. On the computational complexity of program schemata. Technical Report TR 74-196, Cornell University, Dept. of Computer Science, Ithaca, New York, February 1974.

• Klaus Weihrauch. Program schemata with additional devices that do not help. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 74, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, April 1974.

• Klaus Weihrauch. Teilklassen primitiv-rekursiver Wortfunktionen. Bericht 91, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, 1974.

• F.W. v. Henke and Klaus Weihrauch. Klassifizierung von primitiv-rekursiven Transformationen und Automatentransduktionen. In Peter Deussen, editor, Gessellschaft für Informatik, 2. Jahrestagung, volume 78 of Lecture Notes in Economics and Mathematical Systems, pages 63-71. Springer, 1973. Karlsruhe, 2.--4. Oktober 1972.

• Friedrich W. von Henke, Klaus Indermark, and Klaus Weihrauch. Hierarchies of primitive recursive wordfunctions and transductions defined by automata. In M. Nivat, editor, Automata, Languages and Programming, pages 549-561. North-Holland, 1973. Proceedings of a symposium organised by IRIA, July 3-7, 1972.

• T. Kameda and K. Weihrauch. Einführung in die Codierungstheorie I, volume 7 of Skripten zur Informatik. B.I.-Wissenschaftsverlag, Mannheim, 1973.

• G. Rose and K. Weihrauch. Eine Charakterisierung der Klassen L₁ und R₁ primitiv-rekursiver Wortfunktionen. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 63, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, May 1973.

• Klaus Weihrauch. Hierarchien primitiv-rekursiver Wortfunktionen I. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 49, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, May 1972.

• Klaus Weihrauch. Hierarchien primitiv-rekursiver Wortfunktionen II. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 57, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, October 1972.

• Klaus Weihrauch. Über Eigenschaften abstrakter Komplexitätsmaße von Algorithmen. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 34, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, April 1971.

This bibliography has been automatically generated with bib2html , a BibTeX to HTML converter of David Hull.