| The computational complexity of some Julia sets R Rettinger, K Weihrauch Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 56 | 2003 |
| A fast algorithm for Julia sets of hyperbolic rational functions R Rettinger Electronic Notes in Theoretical Computer Science 120, 145-157, 2005 | 41 | 2005 |
| The alternation hierarchy for sublogarithmic space is infinite B von Braunmühl, R Gengler, R Rettinger computational complexity 3, 207-230, 1993 | 34 | 1993 |
| Weakly computable real numbers and total computable real functions R Rettinger1, X Zheng, R Gengler, B von Braunmühl Computing and Combinatorics: 7th Annual International Conference, COCOON …, 2001 | 23 | 2001 |
| Weak computability and representation of reals X Zheng, R Rettinger Mathematical Logic Quarterly: Mathematical Logic Quarterly 50 (4‐5), 431-442, 2004 | 20 | 2004 |
| Solovay reducibility on dc. e real numbers R Rettinger, X Zheng International Computing and Combinatorics Conference, 359-368, 2005 | 17 | 2005 |
| Monotonically computable real numbers R Rettinger, X Zheng, R Gengler, B von Braunmühl Mathematical Logic Quarterly: Mathematical Logic Quarterly 48 (3), 459-479, 2002 | 16 | 2002 |
| Monotonically computable real numbers R Rettinger, X Zheng, R Gengler, B von Braunmühl Mathematical Logic Quarterly: Mathematical Logic Quarterly 48 (3), 459-479, 2002 | 16 | 2002 |
| Effective jordan decomposition X Zheng, R Rettinger Theory of Computing Systems 38 (2), 189-209, 2005 | 15 | 2005 |
| Products of effective topological spaces and a uniformly computable Tychonoff Theorem R Rettinger, K Weihrauch Logical Methods in Computer Science 9, 2013 | 12 | 2013 |
| The alternation hierarchy for machines with sublogarithmic space is infinite B von Braunmühl, R Gengler, R Rettinger STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science …, 1994 | 10 | 1994 |
| Compactness and the effectivity of uniformization R Rettinger How the World Computes: Turing Centenary Conference and 8th Conference on …, 2012 | 9 | 2012 |
| On the extensions of Solovay-reducibility X Zheng, R Rettinger Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 9 | 2004 |
| On the hierarchy and extension of monotonically computable real numbers R Rettinger, X Zheng Journal of Complexity 19 (5), 672-691, 2003 | 9 | 2003 |
| Computability and complexity aspects of univariate complex analysis R Rettinger FernUniversität Hagen, 2007 | 8 | 2007 |
| Point-separable classes of simple computable planar curves X Zheng, R Rettinger Logical Methods in Computer Science 8, 2012 | 7* | 2012 |
| Points on computable curves of computable lengths R Rettinger, X Zheng International Symposium on Mathematical Foundations of Computer Science, 736-743, 2009 | 7 | 2009 |
| Topological Complexity of Blowup Problems. R Rettinger, K Weihrauch, N Zhong J. Univers. Comput. Sci. 15 (6), 1301-1316, 2009 | 7 | 2009 |
| Verification of authentication protocols for epistemic goals via SAT compilation KL Su, QL Chen, A Sattar, WY Yue, GF Lv, XZ Zheng Journal of Computer Science and Technology 21 (6), 932-943, 2006 | 7 | 2006 |
| Lower bounds on the continuation of holomorphic functions R Rettinger Electronic Notes in Theoretical Computer Science 221, 207-217, 2008 | 6 | 2008 |
