default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Weihrauch
Person information
- affiliation: University of Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j52]Klaus Weihrauch:
Intersection points of planar curves can be computed. Comput. 11(2): 113-133 (2022)
2010 – 2019
- 2019
- [j51]Klaus Weihrauch:
Computable planar curves intersect in a computable point. Comput. 8(3-4): 399-415 (2019) - 2017
- [j50]Klaus Weihrauch:
Computability on measurable functions. Comput. 6(1): 79-104 (2017) - 2014
- [j49]Klaus Weihrauch, Tahereh Jafarikhah:
Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$. Log. Methods Comput. Sci. 10(3) (2014) - [j48]Klaus Weihrauch, Nazanin Roshandel Tavana
:
Representations of measurable sets in computable measure theory. Log. Methods Comput. Sci. 10(3) (2014) - 2013
- [j47]Robert Rettinger, Klaus Weihrauch:
Products of effective topological spaces and a uniformly computable Tychonoff Theorem. Log. Methods Comput. Sci. 9(4) (2013) - [j46]Tahereh Jafarikhah, Klaus Weihrauch:
The Riesz Representation Operator on the Dual of C[0; 1] is Computable. J. Univers. Comput. Sci. 19(6): 750-770 (2013) - [j45]Klaus Weihrauch:
Computably regular topological spaces. Log. Methods Comput. Sci. 9(3) (2013) - 2012
- [j44]Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch:
Computability of the Radon-Nikodym Derivative. Comput. 1(1): 3-13 (2012) - 2011
- [j43]Nazanin Tavana, Klaus Weihrauch:
Turing machines on represented sets, a model of computation for Analysis. Log. Methods Comput. Sci. 7(2) (2011) - [c55]Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch:
Computability of the Radon-Nikodym Derivative. CiE 2011: 132-141 - 2010
- [j42]Klaus Weihrauch:
Computable Separation in Topology, from T0 to T2. J. Univers. Comput. Sci. 16(18): 2733-2753 (2010)
2000 – 2009
- 2009
- [j41]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Topological Complexity of Blowup Problems. J. Univers. Comput. Sci. 15(6): 1301-1316 (2009) - [j40]Klaus Weihrauch, Tanja Grubba:
Elementary Computable Topology. J. Univers. Comput. Sci. 15(6): 1381-1422 (2009) - [j39]Klaus Weihrauch, Yongcheng Wu, Decheng Ding:
Absolutely non-computable predicates and functions in analysis. Math. Struct. Comput. Sci. 19(1): 59-71 (2009) - [c54]Klaus Weihrauch:
Computable Separation in Topology, from T_0 to T_3. CCA 2009 - 2008
- [j38]Klaus Weihrauch:
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming. J. Univers. Comput. Sci. 14(6): 801-844 (2008) - [j37]Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for Locally Compact Hausdorff Spaces. J. Univers. Comput. Sci. 14(6): 845-860 (2008) - [j36]Jack H. Lutz, Klaus Weihrauch:
Connectivity properties of dimension level sets. Math. Log. Q. 54(5): 483-491 (2008) - [c53]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Complexity of Blowup Problems: Extended Abstract. CCA 2008: 219-230 - [e7]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007. Electronic Notes in Theoretical Computer Science 202, Elsevier 2008 [contents] - 2007
- [j35]Ker-I Ko, Klaus Weihrauch, Xizhong Zheng:
Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53(4-5): 325 (2007) - [j34]Tanja Grubba, Matthias Schröder, Klaus Weihrauch:
Computable metrization. Math. Log. Q. 53(4-5): 381-395 (2007) - [j33]Hong Lu, Klaus Weihrauch:
Computable Riesz representation for the dual of C [0; 1]. Math. Log. Q. 53(4-5): 415-430 (2007) - [j32]Klaus Weihrauch, Ning Zhong:
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I. Math. Log. Q. 53(4-5): 511-531 (2007) - [c52]Decheng Ding, Klaus Weihrauch, Yongcheng Wu:
Absolutely Non-effective Predicates and Functions in Computable Analysis. TAMC 2007: 595-604 - [c51]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Preface. CCA 2007: 1-2 - [c50]Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for Locally Compact Hausdorff Spaces. CCA 2007: 3-12 - [c49]Tanja Grubba, Klaus Weihrauch, Yatao Xu:
Effectivity on Continuous Functions in Topological Spaces. CCA 2007: 237-254 - [c48]Jack H. Lutz, Klaus Weihrauch:
Connectivity Properties of Dimension Level Sets. CCA 2007: 295-304 - [e6]Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch:
Proceedings of the Third International Conference on Computability and Complexity in Analysis, CCA 2006, November 1-5, 2006, University of Florida, Gainesville, USA. Electronic Notes in Theoretical Computer Science 167, Elsevier 2007 [contents] - 2006
- [j31]Klaus Weihrauch, Ning Zhong:
Computing Schrödinger propagators on Type-2 Turing machines. J. Complex. 22(6): 918-935 (2006) - [j30]Klaus Weihrauch, Ning Zhong:
An Algorithm for Computing Fundamental Solutions. SIAM J. Comput. 35(6): 1283-1294 (2006) - [j29]Yongcheng Wu, Klaus Weihrauch:
A computable version of the Daniell-Stone theorem on integration and linear functionals. Theor. Comput. Sci. 359(1-3): 28-42 (2006) - [c47]Klaus Weihrauch, Ning Zhong:
Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? TAMC 2006: 783-792 - [c46]Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch:
Preface. CCA 2006: 1-2 - [c45]Klaus Weihrauch, Ning Zhong:
Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I). CCA 2006: 33-59 - [c44]Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for the Dual of C. CCA 2006: 157-177 - [c43]Tanja Grubba, Klaus Weihrauch:
On Computable Metrization. CCA 2006: 345-364 - 2005
- [j28]Klaus Weihrauch, Ning Zhong:
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. Theor. Comput. Sci. 332(1-3): 337-366 (2005) - [c42]Tanja Grubba, Klaus Weihrauch:
A Computable Version of Dini's Theorem for Topological Spaces. CCA 2005: 117-129 - [c41]Klaus Weihrauch:
Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. CCA 2005: 267-300 - [c40]Klaus Weihrauch:
Computable Analysis. CiE 2005: 530-531 - [c39]Tanja Grubba, Klaus Weihrauch:
A Computable Version of Dini's Theorem for Topological Spaces. ISCIS 2005: 927-936 - [e5]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004. Electronic Notes in Theoretical Computer Science 120, Elsevier 2005 [contents] - [e4]Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch:
CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan. Informatik Berichte 326-7/2005, FernUniversität Hagen, Germany 2005 [contents] - 2004
- [c38]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Preface. CCA 2004: 1- - [c37]Klaus Weihrauch, Ning Zhong:
An Algorithm for Computing Fundamental Solutions. CCA 2004: 201-215 - [c36]Yongcheng Wu, Klaus Weihrauch:
A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals. CCA 2004: 217-230 - 2003
- [j27]Peter Hertling, Klaus Weihrauch:
Random elements in effective topological spaces with measure. Inf. Comput. 181(1): 32-56 (2003) - [j26]Ning Zhong, Klaus Weihrauch:
Computatbility theory of generalized functions. J. ACM 50(4): 469-505 (2003) - [j25]Klaus Weihrauch:
Computational complexity on computable metric spaces. Math. Log. Q. 49(1): 3-21 (2003) - [c35]Robert Rettinger, Klaus Weihrauch:
The computational complexity of some julia sets. STOC 2003: 177-185 - 2002
- [j24]Ker-I Ko, Anil Nerode, Klaus Weihrauch:
Foreword. Theor. Comput. Sci. 284(2): 197 (2002) - [c34]Robert Rettinger, Klaus Weihrauch:
The Computational Complexity of Some Julia Sets. CCA 2002: 154-164 - [c33]Klaus Weihrauch, Ning Zhong:
The Solution Operator of the Korteweg-de Vries Equation is Computable. CCA 2002: 189-201 - [c32]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Preface. CCA 2002: 225-226 - [e3]Vasco Brattka, Matthias Schröder, Klaus Weihrauch:
Computability and Complexity in Analysis, CCA 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002. Electronic Notes in Theoretical Computer Science 66(1), Elsevier 2002 [contents] - [i1]Klaus Weihrauch:
Computational Complexity on Computable Metric Spaces. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j23]Xizhong Zheng, Klaus Weihrauch:
The Arithmetical Hierarchy of Real Numbers. Math. Log. Q. 47(1): 51-65 (2001) - [c31]Klaus Weihrauch, Ning Zhong:
Turing Computability of a Nonlinear Schrödinger Propagator. COCOON 2001: 596-600 - 2000
- [b4]Klaus Weihrauch:
Computable Analysis - An Introduction. Texts in Theoretical Computer Science. An EATCS Series, Springer 2000, ISBN 978-3-540-66817-6, pp. 1-285 - [j22]Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng:
Weakly Computable Real Numbers. J. Complex. 16(4): 676-690 (2000) - [j21]Klaus Weihrauch, Xizhong Zheng:
Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theor. Comput. Sci. 234(1-2): 109-133 (2000) - [c30]Klaus Weihrauch:
On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. CCA 2000: 357-368 - [c29]Klaus Weihrauch, Ning Zhong:
Is the Linear Schrödinger Propagator Turing Computable? CCA 2000: 369-377
1990 – 1999
- 1999
- [j20]Vasco Brattka, Xizhong Zheng, Klaus Weihrauch:
Approaches to Effective Semi-Continuity of Real Functions. Math. Log. Q. 45: 481-496 (1999) - [j19]Vasco Brattka, Klaus Weihrauch:
Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theor. Comput. Sci. 219(1-2): 65-93 (1999) - [j18]Klaus Weihrauch:
Computability on the Probability Measureson the Borel Sets of the Unit Interval. Theor. Comput. Sci. 219(1-2): 421-437 (1999) - [j17]Klaus Weihrauch, Xizhong Zheng:
Effectiveness of the Global Modulus of Continuity on Metric Spaces. Theor. Comput. Sci. 219(1-2): 439-450 (1999) - [c28]Klaus Weihrauch, Ning Zhong:
The Wave Propagator Is Turing Computable. ICALP 1999: 697-707 - [c27]Xizhong Zheng, Klaus Weihrauch:
The Arithmetical Hierarchy of Real Numbers. MFCS 1999: 23-33 - 1998
- [j16]Klaus Weihrauch:
A Refined Model of Computation for Continuous Problems. J. Complex. 14(1): 102-121 (1998) - [c26]Vasco Brattka, Klaus Weihrauch, Xizhong Zheng:
Approaches to Effective Semi-continuity of Real Functions. COCOON 1998: 184-193 - [c25]Peter Hertling, Klaus Weihrauch:
Randomness Spaces. ICALP 1998: 796-807 - [c24]Vasco Brattka, Klaus Weihrauch:
Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. MCU (2) 1998: 215-234 - [c23]Klaus Weihrauch, Xizhong Zheng:
A Finite Hierarchy of the Recursively Enumerable Real Numbers. MFCS 1998: 798-806 - 1997
- [c22]Klaus Weihrauch:
A Foundation for Computable Analysis. Foundations of Computer Science: Potential - Theory - Cognition 1997: 185-199 - [c21]Klaus Weihrauch, Xizhong Zheng:
Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. COCOON 1997: 166-175 - [c20]Klaus Weihrauch, Xizhong Zheng:
Effectiveness of the Global Modulus of Continuity on Metric Spaces. Category Theory and Computer Science 1997: 210-219 - [c19]Klaus Weihrauch:
Computability on the Probability Measures on the Borel Sets of the Unit Interval. ICALP 1997: 166-176 - [c18]Klaus Weihrauch:
A Foundation for Computable Analysis. SOFSEM 1997: 104-121 - 1996
- [c17]Klaus Weihrauch:
Computability on the probability measures on the Borel sets of the unit interval. CCA 1996 - [c16]Klaus Weihrauch, Xizhong Zheng:
Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions. CCA 1996 - [c15]Ker-I Ko, Klaus Weihrauch:
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. CCC 1996: 150-159 - [c14]Klaus Weihrauch:
A Foundation for Computable Analysis. DMTCS 1996: 66-89 - [e2]Ker-I Ko, Norbert Th. Müller, Klaus Weihrauch:
Second Workshop on Computability and Complexity in Analysis, CCA 1996, August 22-23, 1996, Trier, Germany. Technical Report TR 96-44, Unjiversity of Trier 1996 [contents] - 1995
- [j15]Klaus Weihrauch:
A Foundation of Computable Analysis. Bull. EATCS 57 (1995) - 1994
- [c13]Peter Hertling, Klaus Weihrauch:
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG 1994: 237-242 - 1993
- [j14]Klaus Weihrauch:
Computability on Computable Metric Spaces. Theor. Comput. Sci. 113(1): 191-210 (1993) - 1991
- [b3]Bernhard Heinemann, Klaus Weihrauch:
Logik für Informatiker - eine Einführung. Leitfäden und Monographien der Informatik, Teubner 1991, ISBN 978-3-519-02248-0, pp. I-VIII, 1-239 - [j13]Klaus Weihrauch:
On the complexity of online computations of real functions. J. Complex. 7(4): 380-394 (1991) - [j12]Klaus Weihrauch, Christoph Kreitz:
Type 2 Computational Complexity of Functions on Cantor's Space. Theor. Comput. Sci. 82(1): 1-18 (1991) - [c12]Klaus Weihrauch:
A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. Constructivity in Computer Science 1991: 228-246
1980 – 1989
- 1989
- [c11]Klaus Weihrauch:
Constructivity, Computability, and Computational Complexity in Analysis. FCT 1989: 480-493 - 1987
- [b2]Klaus Weihrauch:
Computability. EATCS Monographs on Theoretical Computer Science 9, Springer 1987, ISBN 978-3-642-69967-2, pp. I-X, 1-517 - [j11]Klaus Weihrauch, Christoph Kreitz:
Representations of the real numbers and of the open subsets of the set of real numbers. Ann. Pure Appl. Log. 35: 247-260 (1987) - [j10]Christoph Kreitz, Klaus Weihrauch:
Compactness in constructive analysis revisited. Ann. Pure Appl. Log. 36: 29-38 (1987) - 1985
- [j9]Klaus Weihrauch:
Type 2 Recursion Theory. Theor. Comput. Sci. 38: 17-33 (1985) - [j8]Christoph Kreitz, Klaus Weihrauch:
Theory of Representations. Theor. Comput. Sci. 38: 35-53 (1985) - 1983
- [j7]Klaus Weihrauch, Gisela Schäfer:
Admissible Representations of Effective CPO's. Theor. Comput. Sci. 26: 131-147 (1983) - [c10]Christoph Kreitz, Klaus Weihrauch:
Complexity theory on real numbers and functions. Theoretical Computer Science 1983: 165-174 - 1981
- [j6]Klaus Weihrauch, Ulrich Schreiber:
Embedding Metric Spaces Into CPO's. Theor. Comput. Sci. 16: 5-24 (1981) - [c9]Klaus Weihrauch, Gisela Schäfer:
Admissible Representations of Effective CPO's. MFCS 1981: 544-553 - [c8]Klaus Weihrauch:
Recursion and Complexity Theory on CPO-S. Theoretical Computer Science 1981: 195-202 - 1980
- [j5]Angelika Reiser, Klaus Weihrauch:
Natural Numberings and Generalized Computability. J. Inf. Process. Cybern. 16(1-3): 11-20 (1980)
1970 – 1979
- 1979
- [e1]Klaus Weihrauch:
Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings. Lecture Notes in Computer Science 67, Springer 1979, ISBN 3-540-09118-1 [contents] - 1978
- [j4]Rutger Verbeek, Klaus Weihrauch:
Data Representation and Computational Complexity. Theor. Comput. Sci. 7: 99-116 (1978) - 1977
- [c7]Klaus Weihrauch:
A Genralized Computability Thesis. FCT 1977: 538-542 - [c6]Klaus Weihrauch:
A Generalized Computability Thesis (Abstract). MFCS 1977: 570 - 1976
- [j3]Klaus Weihrauch:
The Computational Complexity of Program Schemata. J. Comput. Syst. Sci. 12(1): 80-107 (1976) - [c5]Rutger Verbeek, Klaus Weihrauch:
The Influence of the Data Presentation on the Computational POwer of Machines. MFCS 1976: 551-558 - 1975
- [j2]Friedrich W. von Henke, G. Rose, Klaus Indermark, Klaus Weihrauch:
On primitive recursive wordfunctions. Computing 15(3): 217-234 (1975) - [j1]Klaus Weihrauch:
Program Schemata with Polynomial Bounded Counters. Inf. Process. Lett. 3(3): 91-96 (1975) - 1974
- [c4]Klaus Weihrauch:
The Compuational Complexity of Program Schemata. ICALP 1974: 326-334 - 1973
- [b1]Tiko Kameda, Klaus Weihrauch:
Einführung in die Codierungstheorie I. Skripten zur Informatik 7, BI-Wissenschaftsverlag 1973, ISBN 978-3-411-00783-7, pp. 1-215 - [c3]G. Rose, Klaus Weihrauch:
A characterization of the classes L1 and R1 of primitive recursive wordfunctions. Automatentheorie und Formale Sprachen 1973: 263-266 - 1972
- [c2]Friedrich W. von Henke, Klaus Weihrauch:
Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen. GI Jahrestagung 1972: 63-71 - [c1]Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch:
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. ICALP 1972: 549-561
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
