Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Robert Rettinger
2010 – today
- 2012
[j21]Xizhong Zheng, Robert Rettinger: Point-Separable Classes of Simple Computable Planar Curves. Logical Methods in Computer Science 8(3) (2012)
[j20]Robert Rettinger: On computable approximations of Landau's constant. Logical Methods in Computer Science 8(4) (2012)
[c18]- 2010
[c17]Robert Rettinger: A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract). CCA 2010: 120-129
2000 – 2009
- 2009
[j19]Vasco Brattka, Pieter Collins, Robert Rettinger: Computability and Complexity in Analysis. J. UCS 15(6): 1143-1144 (2009)
[j18]Robert Rettinger, Klaus Weihrauch, Ning Zhong: Topological Complexity of Blowup Problems. J. UCS 15(6): 1301-1316 (2009)
[c16]
[c15]Robert Rettinger, Xizhong Zheng: On the Computability of Rectifiable Simple Curve (Extended Abstract). CCA 2009
[c14]Robert Rettinger, Xizhong Zheng: Points on Computable Curves of Computable Lengths. MFCS 2009: 736-743- 2008
[j17]Robert Rettinger: On the Computability of Blochs Constant. Electr. Notes Theor. Comput. Sci. 202: 315-322 (2008)
[j16]Robert Rettinger: Lower Bounds on the Continuation of Holomorphic Functions. Electr. Notes Theor. Comput. Sci. 221: 207-217 (2008)
[j15]Robert Rettinger, Klaus Weihrauch, Ning Zhong: Complexity of Blowup Problems: Extended Abstract. Electr. Notes Theor. Comput. Sci. 221: 219-230 (2008)
[j14]- 2007
[c13]- 2006
[j13]Robert Rettinger, Xizhong Zheng: A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complexity 22(6): 818-826 (2006)
[j12]Xizhong Zheng, Robert Rettinger: A Reference Correction of "Effective Jordan Decomposition". Theory Comput. Syst. 39(2): 385-385 (2006)- 2005
[j11]Robert Rettinger: A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions. Electr. Notes Theor. Comput. Sci. 120: 145-157 (2005)
[j10]Xizhong Zheng, Robert Rettinger: A Note On the Turing Degrees of Divergence Bounded Computable Reals. Electr. Notes Theor. Comput. Sci. 120: 231-237 (2005)
[j9]Xizhong Zheng, Robert Rettinger, George Barmpalias: h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005)
[j8]Xizhong Zheng, Robert Rettinger: Effective Jordan Decomposition. Theory Comput. Syst. 38(2): 189-209 (2005)
[j7]Xizhong Zheng, Robert Rettinger, Romain Gengler: Closure Properties of Real Number Classes under CBV Functions. Theory Comput. Syst. 38(6): 701-729 (2005)
[c12]Robert Rettinger, Xizhong Zheng: A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. CCA 2005: 199-209
[c11]Robert Rettinger, Xizhong Zheng: On the Turing Degrees of Divergence Bounded Computable Reals. CiE 2005: 418-428
[c10]- 2004
[j6]Xizhong Zheng, Robert Rettinger: Weak computability and representation of reals. Math. Log. Q. 50(4-5): 431-442 (2004)
[c9]- 2003
[j5]Robert Rettinger, Xizhong Zheng: On the hierarchy and extension of monotonically computable real numbers. J. Complexity 19(5): 672-691 (2003)
[c8]Xizhong Zheng, Robert Rettinger, Romain Gengler: Ershov's Hierarchy of Real Numbers. MFCS 2003: 681-690
[c7]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl: On the Effective Jordan Decomposability. STACS 2003: 167-178
[c6]Robert Rettinger, Klaus Weihrauch: The computational complexity of some julia sets. STOC 2003: 177-185- 2002
[j4]Robert Rettinger, Klaus Weihrauch: The Computational Complexity of Some Julia Sets. Electr. Notes Theor. Comput. Sci. 66(1): 154-164 (2002)
[j3]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl: Effectively Absolute Continuity and Effective Jordan Decomposability. Electr. Notes Theor. Comput. Sci. 66(1): 213-224 (2002)
[j2]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl: Monotonically Computable Real Numbers. Math. Log. Q. 48(3): 459-479 (2002)
[c5]Robert Rettinger, Xizhong Zheng: Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers. COCOON 2002: 47-56- 2001
[c4]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl: Weakly Computable Real Numbers and Total Computable Real Functions. COCOON 2001: 586-595
[c3]Robert Rettinger, Rutger Verbeek: Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. FCT 2001: 311-322
[c2]Robert Rettinger, Xizhong Zheng: Hierarchy of Monotonically Computable Real Numbers. MFCS 2001: 633-644
1990 – 1999
- 1994
[c1]Burchard von Braunmühl, Romain Gengler, Robert Rettinger: The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite. STACS 1994: 85-96- 1993
[j1]Burchard von Braunmühl, Romain Gengler, Robert Rettinger: The Alternation Hierarchy for Sublogarithmic Space is Infinite. Computational Complexity 3: 207-230 (1993)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-05 22:18 CET by the dblp team



