| 2011 | CiE | Computability of the Radon-Nikodym Derivative. | Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch |
| 2009 | CCA | Computable Separation in Topology, from T_0 to T_3. | Klaus Weihrauch |
| 2007 | TAMC | Absolutely Non-effective Predicates and Functions in Computable Analysis. | Decheng Ding, Klaus Weihrauch, Yongcheng Wu |
| 2006 | TAMC | Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? | Klaus Weihrauch, Ning Zhong |
| 2005 | CCA | A Computable Version of Dini's Theorem for Topological Spaces. | Tanja Grubba, Klaus Weihrauch |
| 2005 | CCA | Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. | Klaus Weihrauch |
| 2005 | CiE | Computable Analysis. | Klaus Weihrauch |
| 2003 | STOC | The computational complexity of some julia sets. | Robert Rettinger, Klaus Weihrauch |
| 2001 | COCOON | Turing Computability of a Nonlinear Schrdinger Propagator. | Klaus Weihrauch, Ning Zhong |
| 2000 | CCA | On Computable Metric Spaces Tietze-Urysohn Extension Is Computable. | Klaus Weihrauch |
| 2000 | CCA | Is the Linear Schrdinger Propagator Turing Computable? | Klaus Weihrauch, Ning Zhong |
| 1999 | ICALP | The Wave Propagator Is Turing Computable. | Klaus Weihrauch, Ning Zhong |
| 1999 | MFCS | The Arithmetical Hierarchy of Real Numbers. | Xizhong Zheng, Klaus Weihrauch |
| 1998 | COCOON | Approaches to Effective Semi-continuity of Real Functions. | Vasco Brattka, Klaus Weihrauch, Xizhong Zheng |
| 1998 | ICALP | Randomness Spaces. | Peter Hertling, Klaus Weihrauch |
| 1998 | MCU | Recursive and Recursively Enumerable Closed Subsets of Euclidean Space. | Vasco Brattka, Klaus Weihrauch |
| 1998 | MFCS | A Finite Hierarchy of the Recursively Enumerable Real Numbers. | Klaus Weihrauch, Xizhong Zheng |
| 1997 | COCOON | Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions. | Klaus Weihrauch, Xizhong Zheng |
| 1997 | ICALP | Computability on the Probability Measures on the Borel Sets of the Unit Interval. | Klaus Weihrauch |
| 1997 | SOFSEM | A Foundation for Computable Analysis. | Klaus Weihrauch |
| 1996 | CCA | Computability on the probability measures on the Borel sets of the unit interval. | Klaus Weihrauch |
| 1996 | CCA | Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions. | Klaus Weihrauch, Xizhong Zheng |
| 1989 | FCT | Constructivity, Computability, and Computational Complexity in Analysis. | Klaus Weihrauch |
| 1981 | MFCS | Admissible Representations of Effective CPO's. | Klaus Weihrauch, Gisela Schfer |
| 1977 | FCT | A Genralized Computability Thesis. | Klaus Weihrauch |
| 1977 | MFCS | A Generalized Computability Thesis (Abstract). | Klaus Weihrauch |
| 1976 | MFCS | The Influence of the Data Presentation on the Computational POwer of Machines. | Rutger Verbeek, Klaus Weihrauch |
| 1974 | ICALP | The Compuational Complexity of Program Schemata. | Klaus Weihrauch |
| 1972 | GI | Klassifizierung von Primitiv-rekursiven Transformationen und Automatentransduktionen. | Friedrich W. von Henke, Klaus Weihrauch |
| 1972 | ICALP | Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. | Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch |