Klaus Weihrauch

119 papers A* 6A 1B 8C 32Misc 3Journal 53Unranked 11

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Intersection points of planar curves can be computed. Comput. Klaus Weihrauch
2019	J	`jnl`	Computable planar curves intersect in a computable point. Comput. Klaus Weihrauch
2017	J	`jnl`	Computability on measurable functions. Comput. Klaus Weihrauch
2014	J	`jnl`	Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1]$. Log. Methods Comput. Sci. Klaus Weihrauch, Tahereh Jafarikhah
2014	J	`jnl`	Representations of measurable sets in computable measure theory. Log. Methods Comput. Sci. Klaus Weihrauch, Nazanin Roshandel Tavana
2013	J	`jnl`	Computably regular topological spaces. Log. Methods Comput. Sci. Klaus Weihrauch
2013	J	`jnl`	Products of effective topological spaces and a uniformly computable Tychonoff Theorem. Log. Methods Comput. Sci. Robert Rettinger, Klaus Weihrauch
2013	J	`jnl`	The Riesz Representation Operator on the Dual of J. Univers. Comput. Sci. Tahereh Jafarikhah, Klaus Weihrauch
2012	J	`jnl`	Computability of the Radon-Nikodym Derivative. Comput. Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
2011	C	`conf`	Computability of the Radon-Nikodym Derivative. CiE Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
2011	J	`jnl`	Turing machines on represented sets, a model of computation for Analysis Log. Methods Comput. Sci. Nazanin Tavana, Klaus Weihrauch
2010	J	`jnl`	Computable Separation in Topology, from J. Univers. Comput. Sci. Klaus Weihrauch
2009	J	`jnl`	Absolutely non-computable predicates and functions in analysis. Math. Struct. Comput. Sci. Klaus Weihrauch, Yongcheng Wu, Decheng Ding
2009	C	`conf`	Computable Separation in Topology, from T_0 to T_3. CCA Klaus Weihrauch
2009	J	`jnl`	Elementary Computable Topology. J. Univers. Comput. Sci. Klaus Weihrauch, Tanja Grubba
2009	J	`jnl`	Topological Complexity of Blowup Problems. J. Univers. Comput. Sci. Robert Rettinger, Klaus Weihrauch, Ning Zhong
2008	C	`conf`	Complexity of Blowup Problems: Extended Abstract. CCA Robert Rettinger, Klaus Weihrauch, Ning Zhong
2008	J	`jnl`	Computable Riesz Representation for Locally Compact Hausdorff Spaces. J. Univers. Comput. Sci. Hong Lu, Klaus Weihrauch
2008	J	`jnl`	Connectivity properties of dimension level sets. Math. Log. Q. Jack H. Lutz, Klaus Weihrauch
2008	C	`ed.`	Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007 CCA Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong
2008	J	`jnl`	The Computable Multi-Functions on Multi-represented Sets are Closed under Programming. J. Univers. Comput. Sci. Klaus Weihrauch
2007	C	`conf`	Absolutely Non-effective Predicates and Functions in Computable Analysis. TAMC Decheng Ding, Klaus Weihrauch, Yongcheng Wu
2007	C	`conf`	Computable Riesz Representation for Locally Compact Hausdorff Spaces. CCA Hong Lu, Klaus Weihrauch
2007	J	`jnl`	Computable Riesz representation for the dual of Math. Log. Q. Hong Lu, Klaus Weihrauch
2007	J	`jnl`	Computable analysis of the abstract Cauchy problem in a Banach space and its applications I. Math. Log. Q. Klaus Weihrauch, Ning Zhong
2007	J	`jnl`	Computable metrization. Math. Log. Q. Tanja Grubba, Matthias Schröder, Klaus Weihrauch
2007	C	`conf`	Connectivity Properties of Dimension Level Sets. CCA Jack H. Lutz, Klaus Weihrauch
2007	J	`jnl`	Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. Ker-I Ko, Klaus Weihrauch, Xizhong Zheng
2007	C	`conf`	Effectivity on Continuous Functions in Topological Spaces. CCA Tanja Grubba, Klaus Weihrauch, Yatao Xu
2007	C	`conf`	Preface. CCA Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong
2007	C	`ed.`	Proceedings of the Third International Conference on Computability and Complexity in Analysis, CCA 2006, November 1-5, 2006, University of Florida, Gainesville, USA CCA Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch
2006	J	`jnl`	A computable version of the Daniell-Stone theorem on integration and linear functionals. Theor. Comput. Sci. Yongcheng Wu, Klaus Weihrauch
2006	J	`jnl`	An Algorithm for Computing Fundamental Solutions. SIAM J. Comput. Klaus Weihrauch, Ning Zhong
2006	C	`conf`	Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? TAMC Klaus Weihrauch, Ning Zhong
2006	C	`conf`	Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I). CCA Klaus Weihrauch, Ning Zhong
2006	C	`conf`	Computable Riesz Representation for the Dual of C. CCA Hong Lu, Klaus Weihrauch
2006	J	`jnl`	Computing Schrödinger propagators on Type-2 Turing machines. J. Complex. Klaus Weihrauch, Ning Zhong
2006	C	`conf`	On Computable Metrization. CCA Tanja Grubba, Klaus Weihrauch
2006	C	`conf`	Preface. CCA Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch
2005	C	`conf`	A Computable Version of Dini's Theorem for Topological Spaces. CCA Tanja Grubba, Klaus Weihrauch
2005	—	`conf`	A Computable Version of Dini's Theorem for Topological Spaces. ISCIS Tanja Grubba, Klaus Weihrauch
2005	C	`ed.`	CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan CCA Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch
2005	C	`conf`	Computable Analysis. CiE Klaus Weihrauch
2005	J	`jnl`	Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. Theor. Comput. Sci. Klaus Weihrauch, Ning Zhong
2005	C	`conf`	Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. CCA Klaus Weihrauch
2005	C	`ed.`	Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004 CCA Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
2004	C	`conf`	A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals. CCA Yongcheng Wu, Klaus Weihrauch
2004	C	`conf`	An Algorithm for Computing Fundamental Solutions. CCA Klaus Weihrauch, Ning Zhong
2004	C	`conf`	Preface. CCA Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
2003	J	`jnl`	Computatbility theory of generalized functions. J. ACM Ning Zhong, Klaus Weihrauch
2003	J	`jnl`	Computational complexity on computable metric spaces. Math. Log. Q. Klaus Weihrauch
2003	J	`jnl`	Random elements in effective topological spaces with measure. Inf. Comput. Peter Hertling, Klaus Weihrauch
2003	A*	`conf`	The computational complexity of some julia sets. STOC Robert Rettinger, Klaus Weihrauch
2002	C	`ed.`	Computability and Complexity in Analysis, CCA 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002 CCA Vasco Brattka, Matthias Schröder, Klaus Weihrauch
2002	J	`jnl`	Computational Complexity on Computable Metric Spaces Electron. Colloquium Comput. Complex. Klaus Weihrauch
2002	J	`jnl`	Foreword. Theor. Comput. Sci. Ker-I Ko, Anil Nerode, Klaus Weihrauch
2002	C	`conf`	Preface. CCA Vasco Brattka, Matthias Schröder, Klaus Weihrauch
2002	C	`conf`	The Computational Complexity of Some Julia Sets. CCA Robert Rettinger, Klaus Weihrauch
2002	C	`conf`	The Solution Operator of the Korteweg-de Vries Equation is Computable. CCA Klaus Weihrauch, Ning Zhong
2001	J	`jnl`	The Arithmetical Hierarchy of Real Numbers. Math. Log. Q. Xizhong Zheng, Klaus Weihrauch
2001	Misc	`conf`	Turing Computability of a Nonlinear Schrödinger Propagator. COCOON Klaus Weihrauch, Ning Zhong
2000	J	`jnl`	Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theor. Comput. Sci. Klaus Weihrauch, Xizhong Zheng
2000	—	`book`	Computable Analysis - An Introduction Klaus Weihrauch
2000	C	`conf`	Is the Linear Schrödinger Propagator Turing Computable? CCA Klaus Weihrauch, Ning Zhong
2000	C	`conf`	On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. CCA Klaus Weihrauch
2000	J	`jnl`	Weakly Computable Real Numbers. J. Complex. Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
1999	J	`jnl`	Approaches to Effective Semi-Continuity of Real Functions. Math. Log. Q. Vasco Brattka, Xizhong Zheng, Klaus Weihrauch
1999	J	`jnl`	Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. Theor. Comput. Sci. Vasco Brattka, Klaus Weihrauch
1999	J	`jnl`	Computability on the Probability Measureson the Borel Sets of the Unit Interval. Theor. Comput. Sci. Klaus Weihrauch
1999	J	`jnl`	Effectiveness of the Global Modulus of Continuity on Metric Spaces. Theor. Comput. Sci. Klaus Weihrauch, Xizhong Zheng
1999	B	`conf`	The Arithmetical Hierarchy of Real Numbers. MFCS Xizhong Zheng, Klaus Weihrauch
1999	A*	`conf`	The Wave Propagator Is Turing Computable. ICALP Klaus Weihrauch, Ning Zhong
1998	B	`conf`	A Finite Hierarchy of the Recursively Enumerable Real Numbers. MFCS Klaus Weihrauch, Xizhong Zheng
1998	J	`jnl`	A Refined Model of Computation for Continuous Problems. J. Complex. Klaus Weihrauch
1998	Misc	`conf`	Approaches to Effective Semi-continuity of Real Functions. COCOON Vasco Brattka, Klaus Weihrauch, Xizhong Zheng
1998	A*	`conf`	Randomness Spaces. ICALP Peter Hertling, Klaus Weihrauch
1998	—	`conf`	Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. MCU (2) Vasco Brattka, Klaus Weihrauch
1997	—	`conf`	A Foundation for Computable Analysis. Foundations of Computer Science: Potential - Theory - Cognition Klaus Weihrauch
1997	B	`conf`	A Foundation for Computable Analysis. SOFSEM Klaus Weihrauch
1997	Misc	`conf`	Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. COCOON Klaus Weihrauch, Xizhong Zheng
1997	A*	`conf`	Computability on the Probability Measures on the Borel Sets of the Unit Interval. ICALP Klaus Weihrauch
1997	—	`conf`	Effectiveness of the Global Modulus of Continuity on Metric Spaces. Category Theory and Computer Science Klaus Weihrauch, Xizhong Zheng
1996	—	`conf`	A Foundation for Computable Analysis. DMTCS Klaus Weihrauch
1996	C	`conf`	Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions. CCA Klaus Weihrauch, Xizhong Zheng
1996	C	`conf`	Computability on the probability measures on the Borel sets of the unit interval. CCA Klaus Weihrauch
1996	A	`conf`	On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. CCC Ker-I Ko, Klaus Weihrauch
1996	C	`ed.`	Second Workshop on Computability and Complexity in Analysis, CCA 1996, August 22-23, 1996, Trier, Germany. CCA Ker-I Ko, Norbert Th. Müller, Klaus Weihrauch
1995	J	`jnl`	A Foundation of Computable Analysis. Bull. EATCS Klaus Weihrauch
1994	—	`conf`	Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG Peter Hertling, Klaus Weihrauch
1993	J	`jnl`	Computability on Computable Metric Spaces. Theor. Comput. Sci. Klaus Weihrauch
1991	—	`conf`	A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. Constructivity in Computer Science Klaus Weihrauch
1991	—	`book`	Logik für Informatiker - eine Einführung. Bernhard Heinemann, Klaus Weihrauch
1991	J	`jnl`	On the complexity of online computations of real functions. J. Complex. Klaus Weihrauch
1991	J	`jnl`	Type 2 Computational Complexity of Functions on Cantor's Space. Theor. Comput. Sci. Klaus Weihrauch, Christoph Kreitz
1989	B	`conf`	Constructivity, Computability, and Computational Complexity in Analysis. FCT Klaus Weihrauch
1987	J	`jnl`	Compactness in constructive analysis revisited. Ann. Pure Appl. Log. Christoph Kreitz, Klaus Weihrauch
1987	—	`book`	Computability Klaus Weihrauch
1987	J	`jnl`	Representations of the real numbers and of the open subsets of the set of real numbers. Ann. Pure Appl. Log. Klaus Weihrauch, Christoph Kreitz
1985	J	`jnl`	Theory of Representations. Theor. Comput. Sci. Christoph Kreitz, Klaus Weihrauch
1985	J	`jnl`	Type 2 Recursion Theory. Theor. Comput. Sci. Klaus Weihrauch
1983	J	`jnl`	Admissible Representations of Effective CPO's. Theor. Comput. Sci. Klaus Weihrauch, Gisela Schäfer
1983	—	`conf`	Complexity theory on real numbers and functions. Theoretical Computer Science Christoph Kreitz, Klaus Weihrauch
1981	B	`conf`	Admissible Representations of Effective CPO's. MFCS Klaus Weihrauch, Gisela Schäfer
1981	J	`jnl`	Embedding Metric Spaces Into CPO's. Theor. Comput. Sci. Klaus Weihrauch, Ulrich Schreiber
1981	—	`conf`	Recursion and Complexity Theory on CPO-S. Theoretical Computer Science Klaus Weihrauch
1980	J	`jnl`	Natural Numberings and Generalized Computability. J. Inf. Process. Cybern. Angelika Reiser, Klaus Weihrauch
1979	—	`ed.`	Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings Theoretical Computer Science Klaus Weihrauch
1978	J	`jnl`	Data Representation and Computational Complexity. Theor. Comput. Sci. Rutger Verbeek, Klaus Weihrauch
1977	B	`conf`	A Generalized Computability Thesis (Abstract). MFCS Klaus Weihrauch
1977	B	`conf`	A Genralized Computability Thesis. FCT Klaus Weihrauch
1976	J	`jnl`	The Computational Complexity of Program Schemata. J. Comput. Syst. Sci. Klaus Weihrauch
1976	B	`conf`	The Influence of the Data Presentation on the Computational POwer of Machines. MFCS Rutger Verbeek, Klaus Weihrauch
1975	J	`jnl`	On primitive recursive wordfunctions. Computing Friedrich W. von Henke, G. Rose, Klaus Indermark, Klaus Weihrauch
1975	J	`jnl`	Program Schemata with Polynomial Bounded Counters. Inf. Process. Lett. Klaus Weihrauch
1974	A*	`conf`	The Compuational Complexity of Program Schemata. ICALP Klaus Weihrauch
1973	—	`conf`	A characterization of the classes L1 and R1 of primitive recursive wordfunctions. Automatentheorie und Formale Sprachen G. Rose, Klaus Weihrauch
1973	—	`book`	Einführung in die Codierungstheorie I. Tiko Kameda, Klaus Weihrauch
1972	A*	`conf`	Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. ICALP Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch
1972	—	`conf`	Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen. GI Jahrestagung Friedrich W. von Henke, Klaus Weihrauch