Escardó, Martín and Pauly, Arno and Schröder, Matthias
and Weihrauch, Klaus (eds.), Special issue: Selected papers of the Ninth International Conference
on Computability and Complexity in Analysis (CCA) 2012, Held in Cambridge, June 24-27, 2012, LMCS, 2013/14
Jafarikhah, Tahereh and Weihrauch, Klaus, The Riesz representation operator on the dual of C[0;1] is
computable, Journal of Universal Computer Science19:6 (2013) 750-770
Hoyrup, Mathieu and Rojas, Cristóbal and Weihrauch, Klaus, Computability of the Radon-Nikodym derivative, in: Löwe, Benedikt and Normann, Dag and Soskov, Ivan and Soskova,
Alexandra (eds.), Models of Computation in Context, vol. 6735 of LNCS, Springer, Heidelberg, 2011, pages 132-141
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
Grubba, Tanja and Weihrauch, Klaus and Xu, Yatao, Effectivity on Continuous Functions in Topological Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability
and Complexity in Analysis (CCA 2007), vol. 202 of ENTCS, Elsevier, 2008, pages 237-254
Lu, Hong and Weihrauch, Klaus, Computable Riesz Representation for Locally Compact Hausdorff
Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability
and Complexity in Analysis (CCA 2007), vol. 202 of ENTCS, Elsevier, 2008, pages 3-12
Lu, Hong and Weihrauch, Klaus, Computable Riesz Representation for Locally Compact Hausdorff
Spaces, JUCS14:6 (2008) 845-860
Lutz, Jack and Weihrauch, Klaus, Connectivity Properties of Dimension Level Sets, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability
and Complexity in Analysis (CCA 2007), vol. 202 of ENTCS, Elsevier, 2008, pages 295-304
Lutz, Jack H. and Weihrauch, Klaus, Connectivity properties of dimension level sets, MLQ54:5 (2008) 483-491
Rettinger, Robert and Weihrauch, Klaus and Zhong, Ning, Complexity of Blowup Problems (Extended Abstract), 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 ENTCS, Elsevier, 2008, pages 219-230
Weihrauch, Klaus, The Computable Multi-Functions on Multi-represented Sets are Closed
under Programming, JUCS14:6 (2008) 801-844
2007
Ding, Decheng and Weihrauch, Klaus and Wu, Yongcheng, Absolutely non-effective predicates and functions in Computable Analysis, in: Cai, Jin-Yi and Cooper, S. Barry and Zhou, Hong (eds.), Theory and Applications of Models of Computation, vol. 4484 of LNCS, 2007, pages 595-604
Grubba, Tanja and Schröder, Matthias and Weihrauch, Klaus, Computable metrization, MLQ53:4-5 (2007) 381-395
Grubba, Tanja and Weihrauch, Klaus, On computable metrization, 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 ENTCS, Elsevier, Amsterdam, 2007, pages 345-364
Grubba, Tanja and Weihrauch, Klaus and Xu, Yatao, Effectivity on Continuous Functions in Topological Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), CCA 2007, Fourth International Conference on Computability and
Complexity in Analysis, vol. 338 of Informatik Berichte, FernUniversität in Hagen, 2007, pages 137-154
Lu, Hong and Weihrauch, Klaus, Computable Riesz representation for the dual of C[0;1], 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 ENTCS, Elsevier, Amsterdam, 2007, pages 157-177
Lu, Hong and Weihrauch, Klaus, Computable Riesz Representation for Locally Compact Hausdorff
Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), CCA 2007, Fourth International Conference on Computability and
Complexity in Analysis, vol. 338 of Informatik Berichte, FernUniversität in Hagen, 2007, pages 205-217
Lu, Hong and Weihrauch, Klaus, Computable Riesz representation for the dual of C[0;1], MLQ53:4-5 (2007) 415-430
Lutz, Jack and Weihrauch, Klaus, Connectivity Properties of Dimension Level Sets, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning (eds.), CCA 2007, Fourth International Conference on Computability and
Complexity in Analysis, vol. 338 of Informatik Berichte, FernUniversität in Hagen, 2007, pages 219-229
Weihrauch, Klaus and Zhong, Ning, Computable analysis of the abstract Cauchy problem in a Banach
space and its applications (I), 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 ENTCS, Elsevier, Amsterdam, 2007, pages 33-59
Weihrauch, Klaus and Zhong, Ning, Computable analysis of the abstract Cauchy problem in a Banach
space and its applications I, MLQ53:4-5 (2007) 511-531
2006
Grubba, Tanja and Weihrauch, Klaus, On computable metrization, 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 176-191
Lu, Hong and Weihrauch, Klaus, Computable Riesz representation for the dual of C[0;1], 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 193-210
Weihrauch, Klaus and Zhong, Ning, Computable analysis of the abstract Cauchy problem in a Banach
space and its applications (I), 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 287-309
Weihrauch, Klaus and Zhong, Ning, An algorithm for computing fundamental solutions, SIAM35:6 (2006) 1283-1294
Weihrauch, Klaus and Zhong, Ning, Computing Schrödinger propagators on Type-2 Turing machines, JC22:6 (2006) 918-935
Wu, Yongcheng and Weihrauch, Klaus, A computable version of the Daniell-Stone theorem on integration
and linear functionals, TCS359:1-3 (2006) 28-42
2005
Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in
Analysis, 6th International Workshop, CCA 2004, Wittenberg, Germany, August
16-20, 2004, vol. 120 of ENTCS, Elsevier, Amsterdam, 2005
Grubba, Tanja and Weihrauch, Klaus, A computable version of Dini's Theorem for topological spaces, 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, pages 117-129
Grubba, Tanja and Weihrauch, Klaus, A computable version of Dini's Theorem for topological spaces, in: Yolum, Pinar and Güngör, Tunga and Gürgen, Fikret and
Özturan, Can (eds.), Computer and Information Sciences - ISCIS 2005, vol. 3733 of LNCS, Springer, Berlin, 2005, pages 927-936
Weihrauch, Klaus, Multi-functions on multi-represented sets are closed under flowchart
programming, 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, pages 267-300
Weihrauch, Klaus and Zhong, Ning, An Algorithm for Computing Fundamental Solutions, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in
Analysis, vol. 120 of ENTCS, Elsevier, Amsterdam, 2005, pages 201-215
Weihrauch, Klaus and Zhong, Ning, Computing the solution of the Korteweg-de Vries equation with
arbitrary precision on Turing machines, TCS332:1-3 (2005) 337-366
2004
Weihrauch, Klaus and Zhong, Ning, An Algorithm for Computing Fundamental Solutions, 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 181-194
2003
Hertling, Peter and Weihrauch, Klaus, Random elements in effective topological spaces with measure, IC181:1 (2003) 32-56
Rettinger, Robert and Weihrauch, Klaus, The computational complexity of some Julia sets, in: Goemans, Michel X. (ed.), Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2003, pages 177-185
Weihrauch, Klaus, Continuity in computable analysis (Abstract), 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 99-100
Zhong, Ning and Weihrauch, Klaus, Computability theory of generalized functions, JACM50:4 (2003) 469-505
2002
Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, 5th International Workshop, CCA 2002, Málaga, Spain, July
12-13, 2002, vol. 66(1) of ENTCS, Elsevier, Amsterdam, 2002
Ko, Ker-I and Nerode, Anil and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 284(2) of TCS, Elsevier, Amsterdam, 2002
Rettinger, Robert and Weihrauch, Klaus, The Computational Complexity of Some Julia Sets, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of ENTCS, Elsevier, Amsterdam, 2002
Weihrauch, Klaus, Computable Analysis, in: B.D. Masurov et al. (eds.), Proceedings of the international conference "Logic and Applications"
honouring Yu. L. Ershov on his 60th birthday, University of Novosibirsk, Novosibirsk, 2002, pages 165-178
Weihrauch, Klaus and Zhong, Ning, The Solution Operator of the Korteweg-de Vries Equation is Computable, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of ENTCS, Elsevier, Amsterdam, 2002
Weihrauch, Klaus and Zhong, Ning, Is wave propagation computable or can wave computers beat the Turing
machine?, LMS85:2 (2002) 312-332
2001
Weihrauch, Klaus, On Computable Metric Spaces Tietze-Urysohn Extension is Computable, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of LNCS, Springer, Berlin, 2001, pages 357-368
Weihrauch, Klaus and Zhong, Ning, Is the Linear Schrödinger Propagator Turing Computable?, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of LNCS, Springer, Berlin, 2001, pages 369-377
Weihrauch, Klaus and Zhong, Ning, Turing Computability of a Nonlinear Schrödinger Propagator, in: Wang, Jie (ed.), Computing and Combinatorics, vol. 2108 of LNCS, Springer, Berlin, 2001, pages 596-599
Zheng, Xizhong and Weihrauch, Klaus, The Arithmetical Hierarchy of Real Numbers, MLQ47:1 (2001) 51-65
2000
Ambos-Spies, Klaus and Weihrauch, Klaus and Zheng, Xizhong, Weakly Computable Real Numbers, JC16:4 (2000) 676-690
Weihrauch, Klaus, On Computable Metric Spaces Tietze-Urysohn Extension is Computable, 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 441-452
Weihrauch, Klaus and Zheng, Xizhong, Computability on continuous, lower semi-continuous and upper semi-continuous
real functions, TCS234 (2000) 109-133
1999
Nerode, Anil and Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Special issue of Theoretical Computer Science, Elsevier, Amsterdam, 1999
Brattka, Vasco and Weihrauch, Klaus, Computability on Subsets of Euclidean Space I: Closed and Compact
Subsets, TCS219 (1999) 65-93
Weihrauch, Klaus, Computability on the probability measures on the Borel sets of
the unit interval, TCS219 (1999) 421-437
Weihrauch, Klaus and Zheng, Xizhong, Effectiveness of the global modulus of continuity on metric spaces, TCS219 (1999) 439-450
Weihrauch, Klaus and Zhong, Ning, The Wave Propagator is Turing Computable, in: Wiedermann, Jiří and van Emde Boas, Peter and Nielsen,
Mogens (eds.), Automata, Languages and Programming, vol. 1644 of LNCS, Springer, Berlin, 1999, pages 697-706
Zheng, Xizhong and Weihrauch, Klaus, The Arithmetical Hierarchy of Real Numbers, in: Kutyłowski, Mirosław and Pacholski, Leszek and Wierzbicki,
Tomasz (eds.), Mathematical Foundations of Computer Science 1999, vol. 1672 of LNCS, Springer, Berlin, 1999, pages 23-33
1998
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 LNCS, Springer, Berlin, 1998, pages 184-193
Hertling, Peter and Weihrauch, Klaus, Randomness Spaces, in: Kim G. Larsen and Sven Skyum and Glynn Winskel (eds.), Automata, Languages and Programming, vol. 1443 of LNCS, Springer, Berlin, 1998, pages 796-807
Weihrauch, Klaus, A Refined Model of Computation for Continuous Problems, JC14 (1998) 102-121
Weihrauch, Klaus and Zheng, Xizhong, A Finite Hierarchy of the Recursively Enumerable Real Numbers, in: Brim, Luboš and Gruska, Jozef and Zlatuška, Jiří (eds.), Mathematical Foundations of Computer Science 1998, vol. 1450 of LNCS, Springer, Berlin, 1998, pages 798-806
Weihrauch, Klaus and Zheng, Xizhong, A Finite Hierarchy of the Recursively Enumerable Real Numbers, 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 117-125
Weihrauch, Klaus and Zhong, Ning, The Wave Propagator is Turing Computable, 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 127-155
1997
Weihrauch, Klaus, A Foundation for Computable Analysis, in: Bridges, Douglas S. and Calude, Cristian S. and Gibbons, Jeremy and
Reeves, Steve and Witten, Ian H. (eds.), Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pages 66-89
Weihrauch, Klaus, Computability on the Probability Measures on the Borel Sets of
the Unit Interval, in: Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela,
Alberto (eds.), Automata, Languages and Programming, vol. 1256 of LNCS, Springer, Berlin, 1997, pages 166-176
Weihrauch, Klaus, A Foundation for Computable Analysis, in: Freksa, Christian and Jantzen, Matthias and Valk, Rüdiger (eds.), Foundations of Computer Science, vol. 1337 of LNCS, Springer, Berlin, 1997, pages 185-199
Weihrauch, Klaus, A Foundation for Computable Analysis, in: Plášil, František and Jeffery, Keith G. (eds.), SOFSEM'97: Theory and Practice of Informatics, vol. 1338 of LNCS, Springer, Berlin, 1997, pages 104-121
Weihrauch, Klaus and Zheng, Xizhong, Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous
Real Functions, in: Jiang, Tao and Lee, D.T. (eds.), Computing and Combinatorics, vol. 1276 of LNCS, Springer, Berlin, 1997, pages 166-175
Weihrauch, Klaus and Zheng, Xizhong, Effectiveness of the Global Modulus of Continuity on Metric Spaces, in: Moggi, Eugenio and Rosolini, Giuseppe (eds.), Category Theory and Computer Science, vol. 1290 of LNCS, Springer, Berlin, 1997, pages 210-219
1996
Ko, Ker-I and Weihrauch, Klaus, On the measure of two-dimensional regions with polynomial-time computable
boundaries, in: Homer, Steve and Cai, Jin-Yi (eds.), Eleventh Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, 1996, pages 150-159
Weihrauch, Klaus, A foundation of computable analysis, in: Allouche, Jean-Paul and Bajard, Jean-Claude and Didier, Laurent-Stephane
and Liardet, Pierre (eds.), Second Real Numbers and Computer Conference, 1996, pages 101-119
Weihrauch, Klaus, Computability on the probability measures on the Borel sets of
the unit interval, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 99-112
Weihrauch, Klaus and Zheng, Xizhong, Computability on continuous, lower semi-continuous and upper semi-continuous
real functions, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 115-129
1995
Weihrauch, Klaus, A foundation of computable analysis, BEATCS57 (1995) 167-182
1994
Hertling, Peter and Weihrauch, Klaus, Levels of degeneracy and exact lower complexity bounds for geometric
algorithms, in: Proceedings of the Sixth Canadian Conference on Computational Geometry, 1994, pages 237-242
1993
Weihrauch, Klaus, Computability on computable metric spaces, TCS113 (1993) 191-210
1992
Heinemann, Bernhard and Weihrauch, Klaus, Logik für Informatiker, 2. ed., Teubner, Stuttgart, 1992
Weihrauch, Klaus, A simple and powerful approach for studying constructivity, computability,
and complexity, in: Myers, J.P. and O'Donnell, M.J. (eds.), Constructivity in computer science, vol. 613 of LNCS, Springer, Berlin, New York, 1992, pages 228-246
Weihrauch, Klaus and Kreitz, Christoph, Type 2 computational complexity of functions on Cantor's space, TCS82 (1991) 1-18
1989
Weihrauch, Klaus, Constructivity, computability, and computational complexity in analysis, in: Csirik, J. and Demetrovics, J. and Gécseg, F. (eds.), Fundamentals of Computation Theory, vol. 380 of LNCS, Springer, 1989, pages 480-493
1987
Kreitz, Christoph and Weihrauch, Klaus, Compactness in constructive analysis revisited, APAL36 (1987) 29-38
Weihrauch, Klaus, Computability, vol. 9 of EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1987
Weihrauch, Klaus and Kreitz, Christoph, Representations of the real numbers and of the open subsets of the
set of real numbers, APAL35 (1987) 247-260
1986
Dettki, H.J. and Schuster, H. and Weihrauch, K., Type 2 recursion theory, in: Demetrovics, J. and Katona, G. and Salomaa, A. (eds.), Algebra, Combinatorics and Logic in Computer Science, Vol. 1, vol. 42 of Coll. Math. Soc. János Bolyai, 1986, pages 355-361
1985
Kreitz, Christoph and Weihrauch, Klaus, Theory of representations, TCS38 (1985) 35-53
Weihrauch, Klaus, Type 2 recursion theory, TCS38 (1985) 17-33
1984
Kreitz, Christoph and Weihrauch, Klaus, A unified approach to constructive and recursive analysis, in: Richter, M.M. and Börger, E. and Oberschelp, W. and Schinzel, B.
and Thomas, W. (eds.), Computation and Proof Theory, vol. 1104 of LNM, Springer, Berlin, 1984, pages 259-278
Kreitz, Christoph and Weihrauch, Klaus, Towards a theory of representations, in: Wechsung, G. (ed.), Frege Conference 1984, Akademie-Verlag, Berlin, 1984, pages 73-79
1983
Kreitz, Christoph and Weihrauch, Klaus, Complexity theory on real numbers and functions, in: Cremers, A.B. and Kriegel, H.P. (eds.), Theoretical Computer Science, vol. 145 of LNCS, Springer, 1983
Weihrauch, Klaus and Schäfer, G., Admissible representations of effective cpo's, TCS26 (1983) 131-147
1981
Weihrauch, Klaus, Recursion and complexity theory on cpo-s, in: Deussen, Peter (ed.), Theoretical Computer Science, vol. 104 of LNCS, Springer, 1981
Weihrauch, Klaus, Is binary notation optimal?, AMM (1981) 199-200
Weihrauch, Klaus and Schreiber, Ulrich, Embedding metric spaces into cpo's, TCS16 (1981) 5-24
Weihrauch, Klaus and Schäfer, Giesela, Admissible representations of effective cpo's, in: Gruska, J. and Chytil, M. (eds.), Mathematical Foundations of Computer Science 1981, vol. 118 of LNCS, Springer, 1981
1980
Reiser, Angelika and Weihrauch, Klaus, Natural numberings and generalized computability, EIK16 (1980) 11-20
1979
Weihrauch, Klaus (ed.), Theoretical Computer Science, 4th GI Conference, Aachen, March 1979, vol. 67 of LNCS, Springer, Berlin, Heidelberg, 1979
Weihrauch, Klaus and Schreiber, Ulrich, Metric spaces defined by weighted algebraic cpo-s, in: Budach, Lothar (ed.), Fundamentals of Computation Theory, FCT'79, Akademie-Verlag, Berlin, 1979, pages 516-522
1978
Verbeek, Rutger and Weihrauch, Klaus, Data representation and computational complexity, TCS7 (1978) 99-116
1977
Weihrauch, Klaus, A generalized computability thesis, in: Gruska, J. (ed.), Mathematical Foundations of Computer Science 1977, vol. 53 of LNCS, Springer, 1977, pages 570-570
Weihrauch, Klaus, A generalized computability thesis, in: Karpinski, Marek (ed.), Fundamentals of Computation Theory, vol. 56 of LNCS, Springer, 1977, pages 538-542
Weihrauch, Klaus, Computational complexity and control structure of programs, Rivista di Informatica7:1 (1977) 17-24
1976
Verbeek, Rutger and Weihrauch, Klaus, The influence of the data presentation on the computational power
of machines, in: Mazurkiewicz, A. (ed.), Mathematical Foundations of Computer Science 1976, vol. 45 of LNCS, Springer, 1976, pages 551-558
Weihrauch, Klaus, The computational complexity of program schemata, JCSS12:1 (1976) 80-107
1975
Henke, F.W. v. and Indermark, K. and Rose, G. and Weihrauch, K., On primitive recursive wordfunctions, Computing15 (1975) 217-234
Weihrauch, Klaus, Program schemata with polynomial bounded counters, IPL3:3 (1975) 91-96
Weihrauch, Klaus, Die Berechnungskomplexität von Programmschemata, PhD thesis, Universität Bonn, Bonn, 1975
1974
Weihrauch, Klaus, The computational complexity of program schemata, in: Loeckx, Jacques (ed.), Automata, Languages and Programming, vol. 14 of LNCS, Springer, 1974, pages 326-334
1973
Henke, F.W. v. and Weihrauch, Klaus, Klassifizierung von primitiv-rekursiven Transformationen und Automatentransduktionen, in: Deussen, Peter (ed.), Gessellschaft für Informatik, 2. Jahrestagung, vol. 78 of Lecture Notes in Economics and Mathematical Systems, Springer, 1973, pages 63-71
Henke, Friedrich W. von and Indermark, Klaus and Weihrauch, Klaus, Hierarchies of primitive recursive wordfunctions and transductions
defined by automata, in: Nivat, M. (ed.), Automata, Languages and Programming, North-Holland, 1973, pages 549-561
Kameda, T. and Weihrauch, K., Einführung in die Codierungstheorie I, vol. 7 of Skripten zur Informatik, B.I.-Wissenschaftsverlag, Mannheim, 1973