Klaus Weihrauch - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 109

2022

Intersection points of planar curves can be computedKlaus Weihrauch. computability, 11(2):113-133, 2022. [doi]

2019

Computable planar curves intersect in a computable pointKlaus Weihrauch. computability, 8(3-4):399-415, 2019. [doi]

2017

Computability on measurable functionsKlaus Weihrauch. computability, 6(1):79-104, 2017. [doi]

2013

C[0; 1] is ComputableTahereh Jafarikhah, Klaus Weihrauch. jucs, 19(6):750-770, 2013. [doi]

Computably regular topological spacesKlaus Weihrauch. lmcs, 9(3), 2013. [doi]

2012

Computability of the Radon-Nikodym DerivativeMathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. computability, 1(1):3-13, 2012. [doi]

2011

Computability of the Radon-Nikodym DerivativeMathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. CiE 2011: 132-141 [doi]

2010

Computable Separation in Topology, from ::::T::::::0:: to ::::T::::::2::Klaus Weihrauch. jucs, 16(18):2733-2753, 2010. [doi]

2009

Topological Complexity of Blowup ProblemsRobert Rettinger, Klaus Weihrauch, Ning Zhong 0002. jucs, 15(6):1301-1316, 2009. [doi]

Absolutely non-computable predicates and functions in analysisKlaus Weihrauch, Yongcheng Wu, Decheng Ding. mscs, 19(1):59-71, 2009. [doi]

Elementary Computable TopologyKlaus Weihrauch, Tanja Grubba. jucs, 15(6):1381-1422, 2009. [doi]

Computable Separation in Topology, from T_0 to T_3Klaus Weihrauch. cca 2009: [doi]

2008

PrefaceRuth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong 0002. ENTCS, 202:1-2, 2008. [doi]

Effectivity on Continuous Functions in Topological SpacesTanja Grubba, Klaus Weihrauch, Yatao Xu. ENTCS, 202:237-254, 2008. [doi]

Computable Riesz Representation for Locally Compact Hausdorff SpacesHong Lu, Klaus Weihrauch. jucs, 14(6):845-860, 2008.

Computable Riesz Representation for Locally Compact Hausdorff SpacesHong Lu, Klaus Weihrauch. ENTCS, 202:3-12, 2008. [doi]

Connectivity properties of dimension level setsJack H. Lutz, Klaus Weihrauch. mlq, 54(5):483-491, 2008. [doi]

Connectivity Properties of Dimension Level SetsJack H. Lutz, Klaus Weihrauch. ENTCS, 202:295-304, 2008. [doi]

Complexity of Blowup Problems: Extended AbstractRobert Rettinger, Klaus Weihrauch, Ning Zhong 0002. ENTCS, 221:219-230, 2008. [doi]

The Computable Multi-Functions on Multi-represented Sets are Closed under ProgrammingKlaus Weihrauch. jucs, 14(6):801-844, 2008.

2007

PrefaceDouglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch. ENTCS, 167:1-2, 2007. [doi]

Absolutely Non-effective Predicates and Functions in Computable AnalysisDecheng Ding, Klaus Weihrauch, Yongcheng Wu. tamc 2007: 595-604 [doi]

On Computable MetrizationTanja Grubba, Klaus Weihrauch. ENTCS, 167:345-364, 2007. [doi]

Computable metrizationTanja Grubba, Matthias Schröder, Klaus Weihrauch. mlq, 53(4-5):381-395, 2007. [doi]

Editorial: Math. Log. Quart. 4-5/2007Ker-I Ko, Klaus Weihrauch, Xizhong Zheng. mlq, 53(4-5):325, 2007. [doi]

Computable Riesz representation for the dual of ::::C:::: [0; 1]Hong Lu, Klaus Weihrauch. mlq, 53(4-5):415-430, 2007. [doi]

Computable Riesz Representation for the Dual of CHong Lu, Klaus Weihrauch. ENTCS, 167:157-177, 2007. [doi]

Computable analysis of the abstract Cauchy problem in a Banach space and its applications IKlaus Weihrauch, Ning Zhong 0002. mlq, 53(4-5):511-531, 2007. [doi]

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)Klaus Weihrauch, Ning Zhong 0002. ENTCS, 167:33-59, 2007. [doi]

2006

2005

PrefaceVasco Brattka, Ludwig Staiger, Klaus Weihrauch. ENTCS, 120:1, 2005. [doi]

A Computable Version of Dini s Theorem for Topological SpacesTanja Grubba, Klaus Weihrauch. iscis 2005: 927-936 [doi]

A Computable Version of Dini s Theorem for Topological SpacesTanja Grubba, Klaus Weihrauch. cca 2005: 117-129

Computable AnalysisKlaus Weihrauch. cie 2005: 530-531 [doi]

Multi-Functions on Multi-Represented Sets are Closed under Flowchart ProgrammingKlaus Weihrauch. cca 2005: 267-300

An Algorithm for Computing Fundamental SolutionsKlaus Weihrauch, Ning Zhong 0002. ENTCS, 120:201-215, 2005. [doi]

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on TuringKlaus Weihrauch, Ning Zhong 0002. TCS, 332(1-3):337-366, 2005. [doi]

A Computable Version of the Daniell-Stone Theorem on Integration and Linear FunctionalsYongcheng Wu, Klaus Weihrauch. ENTCS, 120:217-230, 2005. [doi]

2003

Computatbility theory of generalized functionsNing Zhong 0002, Klaus Weihrauch. JACM, 50(4):469-505, 2003. [doi]

Random elements in effective topological spaces with measurePeter Hertling, Klaus Weihrauch. iandc, 181(1):32-56, 2003. [doi]

The computational complexity of some julia setsRobert Rettinger, Klaus Weihrauch. stoc 2003: 177-185 [doi]

Computational complexity on computable metric spacesKlaus Weihrauch. mlq, 49(1):3-21, 2003. [doi]

2002

PrefaceVasco Brattka, Matthias Schröder, Klaus Weihrauch. ENTCS, 66(1):225-226, 2002. [doi]

ForewordKer-I Ko, Anil Nerode, Klaus Weihrauch. TCS, 284(2):197, 2002. [doi]

The Computational Complexity of Some Julia SetsRobert Rettinger, Klaus Weihrauch. ENTCS, 66(1):154-164, 2002. [doi]

Computational Complexity on Computable Metric SpacesKlaus Weihrauch. eccc, (014), 2002. [doi]

The Solution Operator of the Korteweg-de Vries Equation is ComputableKlaus Weihrauch, Ning Zhong 0002. ENTCS, 66(1):189-201, 2002. [doi]

2001

Turing Computability of a Nonlinear Schrödinger PropagatorKlaus Weihrauch, Ning Zhong 0002. cocoon 2001: 596-600 [doi]

The Arithmetical Hierarchy of Real NumbersXizhong Zheng, Klaus Weihrauch. mlq, 47(1):51-65, 2001. [doi]

2000

Weakly Computable Real NumbersKlaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng. jc, 16(4):676-690, 2000. [doi]

On Computable Metric Spaces Tietze-Urysohn Extension Is ComputableKlaus Weihrauch. cca 2001: 357-368 [doi]

Is the Linear Schrödinger Propagator Turing Computable?Klaus Weihrauch, Ning Zhong 0002. cca 2001: 369-377 [doi]

Computability on continuous, lower semi-continuous and upper semi-continuous real functionsKlaus Weihrauch, Xizhong Zheng. TCS, 234(1-2):109-133, 2000. [doi]

Computable Analysis - An IntroductionKlaus Weihrauch. Texts in Theoretical Computer Science. An EATCS Series, Springer, 2000. [doi]

1999

1998

1997

Computability on the Probability Measures on the Borel Sets of the Unit IntervalKlaus Weihrauch. icalp 1997: 166-176

Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real FunctionsKlaus Weihrauch, Xizhong Zheng. cocoon 1997: 166-175

Effectiveness of the Global Modulus of Continuity on Metric SpacesKlaus Weihrauch, Xizhong Zheng. ctcs 1997: 210-219

A Foundation for Computable AnalysisKlaus Weihrauch. sofsem 1997: 104-121

A Foundation for Computable AnalysisKlaus Weihrauch. BIRTHDAY 1997: 185-199 [doi]

1996

On the Measure of Two-Dimensional Regions with Polynomial-Time computables BoundariesKer-I Ko, Klaus Weihrauch. cocoon 1996: 150-159 [doi]

Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real FunctionsKlaus Weihrauch, Xizhong Zheng. cca 1996: [doi]

Computability on the probability measures on the Borel sets of the unit intervalKlaus Weihrauch. cca 1996: [doi]

A Foundation for Computable AnalysisKlaus Weihrauch. dmtcs 1996: 66-89

1995

A Foundation of Computable AnalysisKlaus Weihrauch. eatcs, 57, 1995.

1994

Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric AlgorithmsPeter Hertling, Klaus Weihrauch. cccg 1994: 237-242

1993

Computability on Computable Metric SpacesKlaus Weihrauch. TCS, 113(1):191-210, 1993.

1991

Logik für Informatiker - eine EinführungBernhard Heinemann, Klaus Weihrauch. Leitfäden und Monographien der Informatik, Teubner, 1991.

Type 2 Computational Complexity of Functions on Cantor s SpaceKlaus Weihrauch, Christoph Kreitz. TCS, 82(1):1-18, 1991.

A Simple and Powerful Approach for Studying Constructivity, Computability, and ComplexityKlaus Weihrauch. constructivity 1992: 228-246

On the complexity of online computations of real functionsKlaus Weihrauch. jc, 7(4):380-394, 1991. [doi]

1989

Constructivity, Computability, and Computational Complexity in AnalysisKlaus Weihrauch. fct 1989: 480-493

1987

Compactness in constructive analysis revisitedChristoph Kreitz, Klaus Weihrauch. APAL, 36:29-38, 1987. [doi]

ComputabilityKlaus Weihrauch. Volume 9 of EATCS Monographs on Theoretical Computer Science, Springer, 1987. [doi]

Representations of the real numbers and of the open subsets of the set of real numbersKlaus Weihrauch, Christoph Kreitz. APAL, 35:247-260, 1987. [doi]

ComputabilityKlaus Weihrauch. Volume 9 of EATCS monographs on theoretical computer science, Springer, 1987. [doi]

1985

Theory of RepresentationsChristoph Kreitz, Klaus Weihrauch. TCS, 38:35-53, 1985.

Type 2 Recursion TheoryKlaus Weihrauch. TCS, 38:17-33, 1985.

1983

Complexity theory on real numbers and functionsChristoph Kreitz, Klaus Weihrauch. tcs 1982: 165-174

Admissible Representations of Effective CPO sKlaus Weihrauch, Gisela Schäfer. TCS, 26:131-147, 1983.

1981

Recursion and Complexity Theory on CPO-SKlaus Weihrauch. tcs 1981: 195-202

Admissible Representations of Effective CPO sKlaus Weihrauch, Gisela Schäfer. mfcs 1981: 544-553

Embedding Metric Spaces Into CPO sKlaus Weihrauch, Ulrich Schreiber. TCS, 16:5-24, 1981.

1980

Natural Numberings and Generalized ComputabilityAngelika Reiser, Klaus Weihrauch. eik, 16(1-3):11-20, 1980.

1978

Data Representation and Computational ComplexityRutger Verbeek, Klaus Weihrauch. TCS, 7:99-116, 1978.

1977

A Generalized Computability ThesisKlaus Weihrauch. fct 1977: 538-542

A Generalized Computability Thesis (Abstract)Klaus Weihrauch. mfcs 1977: 570

Sign in or sign up to see more results.

runs on WebDSL