Klaus Weihrauch

According to our database, Klaus Weihrauch authored at least 94 papers between 1972 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Intersection points of planar curves can be computed.

Klaus Weihrauch

Comput., 2022

2019

Computable planar curves intersect in a computable point.

Klaus Weihrauch

Comput., 2019

2017

Computability on measurable functions.

Klaus Weihrauch

Comput., 2017

2014

Representations of measurable sets in computable measure theory.

Klaus Weihrauch, Nazanin Roshandel Tavana

Log. Methods Comput. Sci., 2014

Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$.

Klaus Weihrauch, Tahereh Jafarikhah

Log. Methods Comput. Sci., 2014

2013

Computably regular topological spaces.

Klaus Weihrauch

Log. Methods Comput. Sci., 2013

The Riesz Representation Operator on the Dual of <i>C</i>[0; 1] is Computable.

Tahereh Jafarikhah, Klaus Weihrauch

J. Univers. Comput. Sci., 2013

Products of effective topological spaces and a uniformly computable Tychonoff Theorem.

Robert Rettinger, Klaus Weihrauch

Log. Methods Comput. Sci., 2013

2012

Computability of the Radon-Nikodym Derivative.

Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch

Comput., 2012

2011

Turing machines on represented sets, a model of computation for Analysis

Nazanin Tavana, Klaus Weihrauch

Log. Methods Comput. Sci., 2011

2010

Computable Separation in Topology, from <i>T</i>₀ to <i>T</i>₂.

Klaus Weihrauch

J. Univers. Comput. Sci., 2010

2009

Absolutely non-computable predicates and functions in analysis.

Klaus Weihrauch, Yongcheng Wu, Decheng Ding

Math. Struct. Comput. Sci., 2009

Elementary Computable Topology.

Klaus Weihrauch, Tanja Grubba

J. Univers. Comput. Sci., 2009

Topological Complexity of Blowup Problems.

Robert Rettinger, Klaus Weihrauch, Ning Zhong

J. Univers. Comput. Sci., 2009

Computable Separation in Topology, from T_0 to T_3.

Klaus Weihrauch

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

The Computable Multi-Functions on Multi-represented Sets are Closed under Programming.

Klaus Weihrauch

J. Univers. Comput. Sci., 2008

Complexity of Blowup Problems: Extended Abstract.

Robert Rettinger, Klaus Weihrauch, Ning Zhong

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Computable Riesz representation for the dual of <i>C</i> [0; 1].

Hong Lu, 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 metrization.

Tanja Grubba, Matthias Schröder, Klaus Weihrauch

Math. Log. Q., 2007

Connectivity Properties of Dimension Level Sets.

Jack H. Lutz, Klaus Weihrauch

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Computable Riesz Representation for Locally Compact Hausdorff Spaces.

Hong Lu, Klaus Weihrauch

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Effectivity on Continuous Functions in Topological Spaces.

Tanja Grubba, Klaus Weihrauch, Yatao Xu

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Preface.

Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Absolutely Non-effective Predicates and Functions in Computable Analysis.

Decheng Ding, Klaus Weihrauch, Yongcheng Wu

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Computing Schrödinger propagators on Type-2 Turing machines.

Klaus Weihrauch, Ning Zhong

J. Complex., 2006

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I).

Klaus Weihrauch, Ning Zhong

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Computable Riesz Representation for the Dual of C.

Hong Lu, Klaus Weihrauch

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

On Computable Metrization.

Tanja Grubba, Klaus Weihrauch

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Preface.

Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?

Klaus Weihrauch, Ning Zhong

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing.

Klaus Weihrauch, Ning Zhong

Theor. Comput. Sci., 2005

Computable Analysis.

Klaus Weihrauch

Proceedings of the New Computational Paradigms, 2005

Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming.

Klaus Weihrauch

Proceedings of the CCA 2005, 2005

A Computable Version of Dini's Theorem for Topological Spaces.

Tanja Grubba, Klaus Weihrauch

Proceedings of the CCA 2005, 2005

2004

A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals.

Yongcheng Wu, Klaus Weihrauch

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

An Algorithm for Computing Fundamental Solutions.

Klaus Weihrauch, Ning Zhong

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

Preface.

Vasco Brattka, Ludwig Staiger, Klaus Weihrauch

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003

Computational complexity on computable metric spaces.

Klaus Weihrauch

Math. Log. Q., 2003

Computatbility theory of generalized functions.

Ning Zhong, Klaus Weihrauch

J. ACM, 2003

Random elements in effective topological spaces with measure.

Peter Hertling, Klaus Weihrauch

Inf. Comput., 2003

2002

Foreword.

Ker-I Ko, Anil Nerode, Klaus Weihrauch

Theor. Comput. Sci., 2002

The Solution Operator of the Korteweg-de Vries Equation is Computable.

Klaus Weihrauch, Ning Zhong

Proceedings of the Computability and Complexity in Analysis, 2002

The Computational Complexity of Some Julia Sets.

Robert Rettinger, Klaus Weihrauch

Proceedings of the Computability and Complexity in Analysis, 2002

Preface.

Vasco Brattka, Matthias Schröder, Klaus Weihrauch

Proceedings of the Computability and Complexity in Analysis, 2002

2001

The Arithmetical Hierarchy of Real Numbers.

Xizhong Zheng, Klaus Weihrauch

Math. Log. Q., 2001

Turing Computability of a Nonlinear Schrödinger Propagator.

Klaus Weihrauch, Ning Zhong

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Computable Analysis - An Introduction

Klaus Weihrauch

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-56999-9, 2000

Computability on continuous, lower semi-continuous and upper semi-continuous real functions.

Klaus Weihrauch, Xizhong Zheng

Theor. Comput. Sci., 2000

Weakly Computable Real Numbers.

Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng

J. Complex., 2000

Is the Linear Schrödinger Propagator Turing Computable?

Klaus Weihrauch, Ning Zhong

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.

Klaus Weihrauch

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

Effectiveness of the Global Modulus of Continuity on Metric Spaces.

Klaus Weihrauch, Xizhong Zheng

Theor. Comput. Sci., 1999

Computability on the Probability Measureson the Borel Sets of the Unit Interval.

Klaus Weihrauch

Theor. Comput. Sci., 1999

Computability on Subsets of Euclidean Space I: Closed and Compact Subsets.

Vasco Brattka, Klaus Weihrauch

Theor. Comput. Sci., 1999

Approaches to Effective Semi-Continuity of Real Functions.

Vasco Brattka, Xizhong Zheng, Klaus Weihrauch

Math. Log. Q., 1999

The Wave Propagator Is Turing Computable.

Klaus Weihrauch, Ning Zhong

Proceedings of the Automata, 1999

1998

A Refined Model of Computation for Continuous Problems.

Klaus Weihrauch

J. Complex., 1998

A Finite Hierarchy of the Recursively Enumerable Real Numbers.

Klaus Weihrauch, Xizhong Zheng

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Recursive and Recursively Enumerable Closed Subsets of Euclidean Space.

Vasco Brattka, Klaus Weihrauch

Proceedings of the International Colloquium Universal Machines and Computations, 1998

Randomness Spaces.

Peter Hertling, Klaus Weihrauch

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions.

Klaus Weihrauch, Xizhong Zheng

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.

Ker-I Ko, Klaus Weihrauch

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Computability on the probability measures on the Borel sets of the unit interval.

Klaus Weihrauch

Proceedings of the Second Workshop on Computability and Complexity in Analysis, 1996

1995

A Foundation of Computable Analysis.

Klaus Weihrauch

Bull. EATCS, 1995

1994

Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms.

Peter Hertling, Klaus Weihrauch

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Computability on Computable Metric Spaces.

Klaus Weihrauch

Theor. Comput. Sci., 1993

1991

Type 2 Computational Complexity of Functions on Cantor's Space.

Klaus Weihrauch, Christoph Kreitz

Theor. Comput. Sci., 1991

On the complexity of online computations of real functions.

Klaus Weihrauch

J. Complex., 1991

A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity.

Klaus Weihrauch

Proceedings of the Constructivity in Computer Science, 1991

Logik für Informatiker - eine Einführung.

Bernhard Heinemann, Klaus Weihrauch

Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02248-0, 1991

1989

Constructivity, Computability, and Computational Complexity in Analysis.

Klaus Weihrauch

Proceedings of the Fundamentals of Computation Theory, 1989

1987

Computability

Klaus Weihrauch

EATCS Monographs on Theoretical Computer Science 9, Springer, ISBN: 0-387-13721-1, 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

Compactness in constructive analysis revisited.

Christoph Kreitz, Klaus Weihrauch

Ann. Pure Appl. Log., 1987

1985

Type 2 Recursion Theory.

Klaus Weihrauch

Theor. Comput. Sci., 1985

Theory of Representations.

Christoph Kreitz, Klaus Weihrauch

Theor. Comput. Sci., 1985

1983

Admissible Representations of Effective CPO's.

Klaus Weihrauch, Gisela Schäfer

Theor. Comput. Sci., 1983

Complexity theory on real numbers and functions.

Christoph Kreitz, Klaus Weihrauch

Proceedings of the Theoretical Computer Science, 1983

1981

Embedding Metric Spaces Into CPO's.

Klaus Weihrauch, Ulrich Schreiber

Theor. Comput. Sci., 1981

Recursion and Complexity Theory on CPO-S.

Klaus Weihrauch

Proceedings of the Theoretical Computer Science, 1981

1980

Natural Numberings and Generalized Computability.

Angelika Reiser, Klaus Weihrauch

J. Inf. Process. Cybern., 1980

1978

Data Representation and Computational Complexity.

Rutger Verbeek, Klaus Weihrauch

Theor. Comput. Sci., 1978

1977

A Generalized Computability Thesis (Abstract).

Klaus Weihrauch

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

A Genralized Computability Thesis.

Klaus Weihrauch

Proceedings of the Fundamentals of Computation Theory, 1977

1976

The Computational Complexity of Program Schemata.

Klaus Weihrauch

J. Comput. Syst. Sci., 1976

The Influence of the Data Presentation on the Computational POwer of Machines.

Rutger Verbeek, Klaus Weihrauch

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

Program Schemata with Polynomial Bounded Counters.

Klaus Weihrauch

Inf. Process. Lett., 1975

On primitive recursive wordfunctions.

Friedrich W. von Henke, G. Rose, Klaus Indermark, Klaus Weihrauch

Computing, 1975

1974

The Compuational Complexity of Program Schemata.

Klaus Weihrauch

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

A characterization of the classes L1 and R1 of primitive recursive wordfunctions.

G. Rose, Klaus Weihrauch

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

Einführung in die Codierungstheorie I.

Tiko Kameda, Klaus Weihrauch

Skripten zur Informatik 7, BI-Wissenschaftsverlag, ISBN: 978-3-411-00783-7, 1973

1972

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.

Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch

Proceedings of the Automata, 1972

Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen.

Friedrich W. von Henke, Klaus Weihrauch

Proceedings of the Gesellschaft für Informatik e.V., 1972