Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen. - Friedrich W. von Henke; Klaus Weihrauch (GI Jahrestagung, 1972)

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. - Friedrich W. von Henke; Klaus Indermark; Klaus Weihrauch (ICALP, 1972)

Einführung in die Codierungstheorie I. - Tiko Kameda; Klaus Weihrauch (BI-Wissenschaftsverlag, 1973)

A characterization of the classes L1 and R1 of primitive recursive wordfunctions. - G. Rose; Klaus Weihrauch (Automatentheorie und Formale Sprachen, 1973)

The Compuational Complexity of Program Schemata. - Klaus Weihrauch (ICALP, 1974)

On primitive recursive wordfunctions. - Friedrich W. von Henke; G. Rose; Klaus Indermark; Klaus Weihrauch (Computing, 1975)

Program Schemata with Polynomial Bounded Counters. - Klaus Weihrauch (Inf. Process. Lett., 1975)

The Influence of the Data Presentation on the Computational POwer of Machines. - Rutger Verbeek; Klaus Weihrauch (MFCS, 1976)

The Computational Complexity of Program Schemata. - Klaus Weihrauch (J. Comput. Syst. Sci., 1976)

A Genralized Computability Thesis. - Klaus Weihrauch (FCT, 1977)

A Generalized Computability Thesis (Abstract). - Klaus Weihrauch (MFCS, 1977)

Data Representation and Computational Complexity. - Rutger Verbeek; Klaus Weihrauch (Theor. Comput. Sci., 1978)

Natural Numberings and Generalized Computability. - Angelika Reiser; Klaus Weihrauch (J. Inf. Process. Cybern., 1980)

Recursion and Complexity Theory on CPO-S. - Klaus Weihrauch (Theoretical Computer Science, 1981)

Embedding Metric Spaces Into CPO's. - Klaus Weihrauch; Ulrich Schreiber (Theor. Comput. Sci., 1981)

Complexity theory on real numbers and functions. - Christoph Kreitz; Klaus Weihrauch (Theoretical Computer Science, 1983)

Admissible Representations of Effective CPO's. - Klaus Weihrauch; Gisela Schäfer (Theor. Comput. Sci., 1983)

Theory of Representations. - Christoph Kreitz; Klaus Weihrauch (Theor. Comput. Sci., 1985)

Type 2 Recursion Theory. - Klaus Weihrauch (Theor. Comput. Sci., 1985)

Compactness in constructive analysis revisited. - Christoph Kreitz; Klaus Weihrauch (Ann. Pure Appl. Log., 1987)

Representations of the real numbers and of the open subsets of the set of real numbers. - Klaus Weihrauch; Christoph Kreitz (Ann. Pure Appl. Log., 1987)

Computability - Klaus Weihrauch (Springer, 1987)

Constructivity, Computability, and Computational Complexity in Analysis. - Klaus Weihrauch (FCT, 1989)

Logik für Informatiker - eine Einführung. - Bernhard Heinemann; Klaus Weihrauch (Teubner, 1991)

A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. - Klaus Weihrauch (Constructivity in Computer Science, 1991)

On the complexity of online computations of real functions. - Klaus Weihrauch (J. Complex., 1991)

Type 2 Computational Complexity of Functions on Cantor's Space. - Klaus Weihrauch; Christoph Kreitz (Theor. Comput. Sci., 1991)

Computability on Computable Metric Spaces. - Klaus Weihrauch (Theor. Comput. Sci., 1993)

Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. - Peter Hertling; Klaus Weihrauch (CCCG, 1994)

A Foundation of Computable Analysis. - Klaus Weihrauch (Bull. EATCS, 1995)

On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. - Ker-I Ko; Klaus Weihrauch (CCC, 1996)

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. - Klaus Weihrauch; Xizhong Zheng (COCOON, 1997)

Computability on the Probability Measures on the Borel Sets of the Unit Interval. - Klaus Weihrauch (ICALP, 1997)

Randomness Spaces. - Peter Hertling; Klaus Weihrauch (ICALP, 1998)

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

A Finite Hierarchy of the Recursively Enumerable Real Numbers. - Klaus Weihrauch; Xizhong Zheng (MFCS, 1998)

A Refined Model of Computation for Continuous Problems. - Klaus Weihrauch (J. Complex., 1998)

The Wave Propagator Is Turing Computable. - Klaus Weihrauch; Ning Zhong 002 (ICALP, 1999)

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

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

Computability on the Probability Measureson the Borel Sets of the Unit Interval. - Klaus Weihrauch (Theor. Comput. Sci., 1999)

Effectiveness of the Global Modulus of Continuity on Metric Spaces. - Klaus Weihrauch; Xizhong Zheng (Theor. Comput. Sci., 1999)

On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. - Klaus Weihrauch (CCA, 2000)

Is the Linear Schrödinger Propagator Turing Computable? - Klaus Weihrauch; Ning Zhong 002 (CCA, 2000)

Weakly Computable Real Numbers. - Klaus Ambos-Spies; Klaus Weihrauch; Xizhong Zheng (J. Complex., 2000)

Computability on continuous, lower semi-continuous and upper semi-continuous real functions. - Klaus Weihrauch; Xizhong Zheng (Theor. Comput. Sci., 2000)

Computable Analysis - An Introduction - Klaus Weihrauch (Springer, 2000)

Turing Computability of a Nonlinear Schrödinger Propagator. - Klaus Weihrauch; Ning Zhong 002 (COCOON, 2001)

The Arithmetical Hierarchy of Real Numbers. - Xizhong Zheng; Klaus Weihrauch (Math. Log. Q., 2001)

Computational Complexity on Computable Metric Spaces - Klaus Weihrauch (Electron. Colloquium Comput. Complex., 2002)

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

The Computational Complexity of Some Julia Sets. - Robert Rettinger; Klaus Weihrauch (CCA, 2002)

The Solution Operator of the Korteweg-de Vries Equation is Computable. - Klaus Weihrauch; Ning Zhong 002 (CCA, 2002)

Foreword. - Ker-I Ko; Anil Nerode; Klaus Weihrauch (Theor. Comput. Sci., 2002)

Random elements in effective topological spaces with measure. - Peter Hertling; Klaus Weihrauch (Inf. Comput., 2003)

Computatbility theory of generalized functions. - Ning Zhong 002; Klaus Weihrauch (J. ACM, 2003)

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

Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. - Klaus Weihrauch (CCA, 2005)

Computable Analysis. - Klaus Weihrauch (CiE, 2005)

A Computable Version of Dini's Theorem for Topological Spaces. - Tanja Grubba; Klaus Weihrauch (ISCIS, 2005)

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. - Klaus Weihrauch; Ning Zhong 002 (Theor. Comput. Sci., 2005)

Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? - Klaus Weihrauch; Ning Zhong 002 (TAMC, 2006)

Preface. - Douglas Cenzer; Ruth Dillhage; Tanja Grubba; Klaus Weihrauch (CCA, 2006)

On Computable Metrization. - Tanja Grubba; Klaus Weihrauch (CCA, 2006)

Computable Riesz Representation for the Dual of C. - Hong Lu 011; Klaus Weihrauch (CCA, 2006)

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I). - Klaus Weihrauch; Ning Zhong 002 (CCA, 2006)

Computing Schrödinger propagators on Type-2 Turing machines. - Klaus Weihrauch; Ning Zhong 002 (J. Complex., 2006)

An Algorithm for Computing Fundamental Solutions. - Klaus Weihrauch; Ning Zhong 002 (SIAM J. Comput., 2006)

A computable version of the Daniell-Stone theorem on integration and linear functionals. - Yongcheng Wu; Klaus Weihrauch (Theor. Comput. Sci., 2006)

Absolutely Non-effective Predicates and Functions in Computable Analysis. - Decheng Ding; Klaus Weihrauch; Yongcheng Wu (TAMC, 2007)

Preface. - Ruth Dillhage; Tanja Grubba; Andrea Sorbi; Klaus Weihrauch; Ning Zhong 002 (CCA, 2007)

Effectivity on Continuous Functions in Topological Spaces. - Tanja Grubba; Klaus Weihrauch; Yatao Xu (CCA, 2007)

Connectivity Properties of Dimension Level Sets. - Jack H. Lutz; Klaus Weihrauch (CCA, 2007)

Computable metrization. - Tanja Grubba; Matthias Schröder 001; Klaus Weihrauch (Math. Log. Q., 2007)

Editorial: Math. Log. Quart. 4-5/2007. - Ker-I Ko; Klaus Weihrauch; Xizhong Zheng (Math. Log. Q., 2007)

Computable Riesz representation for the dual of C [0; 1]. - Hong Lu 011; Klaus Weihrauch (Math. Log. Q., 2007)

Complexity of Blowup Problems: Extended Abstract. - Robert Rettinger; Klaus Weihrauch; Ning Zhong 002 (CCA, 2008)

Computable Riesz Representation for Locally Compact Hausdorff Spaces. - Hong Lu 011; Klaus Weihrauch (J. Univers. Comput. Sci., 2008)

The Computable Multi-Functions on Multi-represented Sets are Closed under Programming. - Klaus Weihrauch (J. Univers. Comput. Sci., 2008)

Computable Separation in Topology, from T_0 to T_3. - Klaus Weihrauch (CCA, 2009)

Topological Complexity of Blowup Problems. - Robert Rettinger; Klaus Weihrauch; Ning Zhong 002 (J. Univers. Comput. Sci., 2009)

Elementary Computable Topology. - Klaus Weihrauch; Tanja Grubba (J. Univers. Comput. Sci., 2009)

Absolutely non-computable predicates and functions in analysis. - Klaus Weihrauch; Yongcheng Wu; Decheng Ding (Math. Struct. Comput. Sci., 2009)

Computable Separation in Topology, from T0 to T2. - Klaus Weihrauch (J. Univers. Comput. Sci., 2010)

Turing machines on represented sets, a model of computation for Analysis - Nazanin Tavana; Klaus Weihrauch (Log. Methods Comput. Sci., 2011)

Computability of the Radon-Nikodym Derivative. - Mathieu Hoyrup; Cristobal Rojas; Klaus Weihrauch (Comput., 2012)

Products of effective topological spaces and a uniformly computable Tychonoff Theorem. - Robert Rettinger; Klaus Weihrauch (Log. Methods Comput. Sci., 2013)

The Riesz Representation Operator on the Dual of C[0; 1] is Computable. - Tahereh Jafarikhah; Klaus Weihrauch (J. Univers. Comput. Sci., 2013)

Computably regular topological spaces. - Klaus Weihrauch (Log. Methods Comput. Sci., 2013)

Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$. - Klaus Weihrauch; Tahereh Jafarikhah (Log. Methods Comput. Sci., 2014)

Representations of measurable sets in computable measure theory. - Klaus Weihrauch; Nazanin Roshandel Tavana (Log. Methods Comput. Sci., 2014)

Computability on measurable functions. - Klaus Weihrauch (Comput., 2017)

Computable planar curves intersect in a computable point. - Klaus Weihrauch (Comput., 2019)

Intersection points of planar curves can be computed. - Klaus Weihrauch (Comput., 2022)