Klaus Weihrauch

According to our database1, Klaus Weihrauch authored at least 103 papers between 1972 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Computability on measurable functions.
Computability, 2017

2014
Representations of measurable sets in computable measure theory.
Logical Methods in Computer Science, 2014

Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$.
Logical Methods in Computer Science, 2014

2013
Computably regular topological spaces.
Logical Methods in Computer Science, 2013

The Riesz Representation Operator on the Dual of C[0; 1] is Computable.
J. UCS, 2013

Products of effective topological spaces and a uniformly computable Tychonoff Theorem.
Logical Methods in Computer Science, 2013

2011
Turing machines on represented sets, a model of computation for Analysis
Logical Methods in Computer Science, 2011

Computability of the Radon-Nikodym Derivative.
Proceedings of the Models of Computation in Context, 2011

2010
Computable Separation in Topology, from T0 to T2.
J. UCS, 2010

2009
Absolutely non-computable predicates and functions in analysis.
Mathematical Structures in Computer Science, 2009

Elementary Computable Topology.
J. UCS, 2009

Topological Complexity of Blowup Problems.
J. UCS, 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
Connectivity properties of dimension level sets.
Math. Log. Q., 2008

The Computable Multi-Functions on Multi-represented Sets are Closed under Programming.
J. UCS, 2008

Computable Riesz Representation for Locally Compact Hausdorff Spaces.
J. UCS, 2008

Complexity of Blowup Problems: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2008

Connectivity Properties of Dimension Level Sets.
Electr. Notes Theor. Comput. Sci., 2008

Computable Riesz Representation for Locally Compact Hausdorff Spaces.
Electr. Notes Theor. Comput. Sci., 2008

Effectivity on Continuous Functions in Topological Spaces.
Electr. Notes Theor. Comput. Sci., 2008

Preface.
Electr. Notes Theor. Comput. Sci., 2008

2007
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I.
Math. Log. Q., 2007

Computable Riesz representation for the dual of C [0; 1].
Math. Log. Q., 2007

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

Computable metrization.
Math. Log. Q., 2007

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I).
Electr. Notes Theor. Comput. Sci., 2007

Computable Riesz Representation for the Dual of C.
Electr. Notes Theor. Comput. Sci., 2007

On Computable Metrization.
Electr. Notes Theor. Comput. Sci., 2007

Preface.
Electr. Notes Theor. Comput. Sci., 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. Complexity, 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 the Daniell-Stone Theorem on Integration and Linear Functionals.
Electr. Notes Theor. Comput. Sci., 2005

An Algorithm for Computing Fundamental Solutions.
Electr. Notes Theor. Comput. Sci., 2005

Preface.
Electr. Notes 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

A Computable Version of Dini's Theorem for Topological Spaces.
Proceedings of the CCA 2005, 2005

2003
Computational complexity on computable metric spaces.
Math. Log. Q., 2003

Computatbility theory of generalized functions.
J. ACM, 2003

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

The computational complexity of some julia sets.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Foreword.
Theor. Comput. Sci., 2002

The Solution Operator of the Korteweg-de Vries Equation is Computable.
Electr. Notes Theor. Comput. Sci., 2002

Preface.
Electr. Notes Theor. Comput. Sci., 2002

Computational Complexity on Computable Metric Spaces
Electronic Colloquium on Computational Complexity (ECCC), 2002

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

Weakly Computable Real Numbers.
J. Complexity, 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
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 Arithmetical Hierarchy of Real Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

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

1998
A Refined Model of Computation for Continuous Problems.
J. Complexity, 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

Approaches to Effective Semi-continuity of Real Functions.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
A Foundation for Computable Analysis.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 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

Effectiveness of the Global Modulus of Continuity on Metric Spaces.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

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

A Foundation for Computable Analysis.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
A Foundation for Computable Analysis.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

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

Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions.
CCA, 1996

Computability on the probability measures on the Borel sets of the unit interval.
CCA, 1996

1995
A Foundation of Computable Analysis.
Bulletin of the 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. Complexity, 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. Logic, 1987

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

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

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

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

Admissible Representations of Effective CPO's.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Natural Numberings and Generalized Computability.
Elektronische Informationsverarbeitung und Kybernetik, 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.
FCT, 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

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

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


  Loading...