| 2008 |
|---|
| 30 | EE | Robert Rettinger:
On the Computability of Blochs Constant.
Electr. Notes Theor. Comput. Sci. 202: 315-322 (2008) |
| 29 | EE | Robert Rettinger:
Lower Bounds on the Continuation of Holomorphic Functions.
Electr. Notes Theor. Comput. Sci. 221: 207-217 (2008) |
| 28 | EE | Robert Rettinger,
Klaus Weihrauch,
Ning Zhong:
Complexity of Blowup Problems: Extended Abstract.
Electr. Notes Theor. Comput. Sci. 221: 219-230 (2008) |
| 27 | | Robert Rettinger:
Bloch's Constant is Computable.
J. UCS 14(6): 896-907 (2008) |
| 2007 |
|---|
| 26 | EE | Robert Rettinger:
Computable Riemann Surfaces.
CiE 2007: 638-647 |
| 2006 |
|---|
| 25 | EE | Robert Rettinger,
Xizhong Zheng:
A hierarchy of Turing degrees of divergence bounded computable real numbers.
J. Complexity 22(6): 818-826 (2006) |
| 24 | EE | Xizhong Zheng,
Robert Rettinger:
A Reference Correction of "Effective Jordan Decomposition".
Theory Comput. Syst. 39(2): 385-385 (2006) |
| 2005 |
|---|
| 23 | | Robert Rettinger,
Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers.
CCA 2005: 199-209 |
| 22 | EE | Robert Rettinger,
Xizhong Zheng:
Solovay Reducibility on D-c.e Real Numbers.
COCOON 2005: 359-368 |
| 21 | EE | Robert Rettinger,
Xizhong Zheng:
On the Turing Degrees of Divergence Bounded Computable Reals.
CiE 2005: 418-428 |
| 20 | EE | Robert Rettinger:
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions.
Electr. Notes Theor. Comput. Sci. 120: 145-157 (2005) |
| 19 | EE | Xizhong Zheng,
Robert Rettinger:
A Note On the Turing Degrees of Divergence Bounded Computable Reals.
Electr. Notes Theor. Comput. Sci. 120: 231-237 (2005) |
| 18 | EE | Xizhong Zheng,
Robert Rettinger,
George Barmpalias:
h-monotonically computable real numbers.
Math. Log. Q. 51(2): 157-170 (2005) |
| 17 | EE | Xizhong Zheng,
Robert Rettinger:
Effective Jordan Decomposition.
Theory Comput. Syst. 38(2): 189-209 (2005) |
| 16 | EE | Xizhong Zheng,
Robert Rettinger,
Romain Gengler:
Closure Properties of Real Number Classes under CBV Functions.
Theory Comput. Syst. 38(6): 701-729 (2005) |
| 2004 |
|---|
| 15 | EE | Xizhong Zheng,
Robert Rettinger:
On the Extensions of Solovay-Reducibility..
COCOON 2004: 360-369 |
| 14 | EE | Xizhong Zheng,
Robert Rettinger:
Weak computability and representation of reals.
Math. Log. Q. 50(4-5): 431-442 (2004) |
| 2003 |
|---|
| 13 | EE | Xizhong Zheng,
Robert Rettinger,
Romain Gengler:
Ershov's Hierarchy of Real Numbers.
MFCS 2003: 681-690 |
| 12 | EE | Xizhong Zheng,
Robert Rettinger,
Burchard von Braunmühl:
On the Effective Jordan Decomposability.
STACS 2003: 167-178 |
| 11 | EE | Robert Rettinger,
Klaus Weihrauch:
The computational complexity of some julia sets.
STOC 2003: 177-185 |
| 10 | EE | Robert Rettinger,
Xizhong Zheng:
On the hierarchy and extension of monotonically computable real numbers.
J. Complexity 19(5): 672-691 (2003) |
| 2002 |
|---|
| 9 | EE | Robert Rettinger,
Xizhong Zheng:
Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers.
COCOON 2002: 47-56 |
| 8 | EE | Xizhong Zheng,
Robert Rettinger,
Burchard von Braunmühl:
Effectively Absolute Continuity and Effective Jordan Decomposability.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 7 | EE | Robert Rettinger,
Klaus Weihrauch:
The Computational Complexity of Some Julia Sets.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 6 | EE | Robert Rettinger,
Xizhong Zheng,
Romain Gengler,
Burchard von Braunmühl:
Monotonically Computable Real Numbers.
Math. Log. Q. 48(3): 459-479 (2002) |
| 2001 |
|---|
| 5 | EE | Robert Rettinger,
Xizhong Zheng,
Romain Gengler,
Burchard von Braunmühl:
Weakly Computable Real Numbers and Total Computable Real Functions.
COCOON 2001: 586-595 |
| 4 | EE | Robert Rettinger,
Rutger Verbeek:
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.
FCT 2001: 311-322 |
| 3 | EE | Robert Rettinger,
Xizhong Zheng:
Hierarchy of Monotonically Computable Real Numbers.
MFCS 2001: 633-644 |
| 1994 |
|---|
| 2 | | Burchard von Braunmühl,
Romain Gengler,
Robert Rettinger:
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.
STACS 1994: 85-96 |
| 1993 |
|---|
| 1 | | Burchard von Braunmühl,
Romain Gengler,
Robert Rettinger:
The Alternation Hierarchy for Sublogarithmic Space is Infinite.
Computational Complexity 3: 207-230 (1993) |
