Klaus Weihrauch

Affiliations:
  • University of Hagen, Germany


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Intersection points of planar curves can be computed.
Comput., 2022

2019
Computable planar curves intersect in a computable point.
Comput., 2019

2017
Computability on measurable functions.
Comput., 2017

2014
Representations of measurable sets in computable measure theory.
Log. Methods Comput. Sci., 2014

Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$.
Log. Methods Comput. Sci., 2014

2013
Computably regular topological spaces.
Log. Methods Comput. Sci., 2013

The Riesz Representation Operator on the Dual of <i>C</i>[0; 1] is Computable.
J. Univers. Comput. Sci., 2013

Products of effective topological spaces and a uniformly computable Tychonoff Theorem.
Log. Methods Comput. Sci., 2013

2012
Computability of the Radon-Nikodym Derivative.
Comput., 2012

2011
Turing machines on represented sets, a model of computation for Analysis
Log. Methods Comput. Sci., 2011

2010
Computable Separation in Topology, from <i>T</i><sub>0</sub> to <i>T</i><sub>2</sub>.
J. Univers. Comput. Sci., 2010

2009
Absolutely non-computable predicates and functions in analysis.
Math. Struct. Comput. Sci., 2009

Elementary Computable Topology.
J. Univers. Comput. Sci., 2009

Topological Complexity of Blowup Problems.
J. Univers. Comput. Sci., 2009

Computable Separation in Topology, from T_0 to T_3.
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.
J. Univers. Comput. Sci., 2008

Computable Riesz Representation for Locally Compact Hausdorff Spaces.
J. Univers. Comput. Sci., 2008

Complexity of Blowup Problems: Extended Abstract.
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].
Math. Log. Q., 2007

Editorial: Math. Log. Quart. 4-5/2007.
Math. Log. Q., 2007

Computable metrization.
Math. Log. Q., 2007

Connectivity Properties of Dimension Level Sets.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Effectivity on Continuous Functions in Topological Spaces.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

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

Absolutely Non-effective Predicates and Functions in Computable Analysis.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
A computable version of the Daniell-Stone theorem on integration and linear functionals.
Theor. Comput. Sci., 2006

An Algorithm for Computing Fundamental Solutions.
SIAM J. Comput., 2006

Computing Schrödinger propagators on Type-2 Turing machines.
J. Complex., 2006

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I).
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Computable Riesz Representation for the Dual of C.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

On Computable Metrization.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Preface.
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?
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.
Theor. Comput. Sci., 2005

A Computable Version of Dini's Theorem for Topological Spaces.
Proceedings of the Computer and Information Sciences, 2005

Computable Analysis.
Proceedings of the New Computational Paradigms, 2005

Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming.
Proceedings of the CCA 2005, 2005

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

2003
Computatbility theory of generalized functions.
J. ACM, 2003

Random elements in effective topological spaces with measure.
Inf. Comput., 2003

2002
Foreword.
Theor. Comput. Sci., 2002

The Solution Operator of the Korteweg-de Vries Equation is Computable.
Proceedings of the Computability and Complexity in Analysis, 2002

The Computational Complexity of Some Julia Sets.
Proceedings of the Computability and Complexity in Analysis, 2002

Preface.
Proceedings of the Computability and Complexity in Analysis, 2002

Computational Complexity on Computable Metric Spaces
Electron. Colloquium Comput. Complex., 2002

2001
The Arithmetical Hierarchy of Real Numbers.
Math. Log. Q., 2001

Turing Computability of a Nonlinear Schrödinger Propagator.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Computable Analysis - An Introduction
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.
Theor. Comput. Sci., 2000

Weakly Computable Real Numbers.
J. Complex., 2000

Is the Linear Schrödinger Propagator Turing Computable?
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Effectiveness of the Global Modulus of Continuity on Metric Spaces.
Theor. Comput. Sci., 1999

Computability on the Probability Measureson the Borel Sets of the Unit Interval.
Theor. Comput. Sci., 1999

Computability on Subsets of Euclidean Space I: Closed and Compact Subsets.
Theor. Comput. Sci., 1999

Approaches to Effective Semi-Continuity of Real Functions.
Math. Log. Q., 1999

The Wave Propagator Is Turing Computable.
Proceedings of the Automata, 1999

1998
A Refined Model of Computation for Continuous Problems.
J. Complex., 1998

A Finite Hierarchy of the Recursively Enumerable Real Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Recursive and Recursively Enumerable Closed Subsets of Euclidean Space.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

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

1997
Computability on the Probability Measures on the Borel Sets of the Unit Interval.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
A Foundation of Computable Analysis.
Bull. EATCS, 1995

1994
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Computability on Computable Metric Spaces.
Theor. Comput. Sci., 1993

1991
Type 2 Computational Complexity of Functions on Cantor's Space.
Theor. Comput. Sci., 1991

On the complexity of online computations of real functions.
J. Complex., 1991

A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity.
Proceedings of the Constructivity in Computer Science, 1991

Logik für Informatiker - eine Einführung.
Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02248-0, 1991

1989
Constructivity, Computability, and Computational Complexity in Analysis.
Proceedings of the Fundamentals of Computation Theory, 1989

1987
Computability
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.
Ann. Pure Appl. Log., 1987

Compactness in constructive analysis revisited.
Ann. Pure Appl. Log., 1987

1985
Type 2 Recursion Theory.
Theor. Comput. Sci., 1985

Theory of Representations.
Theor. Comput. Sci., 1985

1983
Admissible Representations of Effective CPO's.
Theor. Comput. Sci., 1983

Complexity theory on real numbers and functions.
Proceedings of the Theoretical Computer Science, 1983

1981
Embedding Metric Spaces Into CPO's.
Theor. Comput. Sci., 1981

Recursion and Complexity Theory on CPO-S.
Proceedings of the Theoretical Computer Science, 1981

1980
Natural Numberings and Generalized Computability.
J. Inf. Process. Cybern., 1980

1978
Data Representation and Computational Complexity.
Theor. Comput. Sci., 1978

1977
A Generalized Computability Thesis (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

A Genralized Computability Thesis.
Proceedings of the Fundamentals of Computation Theory, 1977

1976
The Computational Complexity of Program Schemata.
J. Comput. Syst. Sci., 1976

The Influence of the Data Presentation on the Computational POwer of Machines.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
Program Schemata with Polynomial Bounded Counters.
Inf. Process. Lett., 1975

On primitive recursive wordfunctions.
Computing, 1975

1974
The Compuational Complexity of Program Schemata.
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.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

Einführung in die Codierungstheorie I.
Skripten zur Informatik 7, BI-Wissenschaftsverlag, ISBN: 978-3-411-00783-7, 1973

1972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.
Proceedings of the Automata, 1972

Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen.
Proceedings of the Gesellschaft für Informatik e.V., 1972


  Loading...