FernUni
Fakultät Mathematik und Informatik
Algorithmen und Komplexität
Team
Robert Rettinger
Inhalt
Navigation
Rubriken
Funktionen
Lehrgebiet
Startseite
Team
Kontakt
Studium
Kursangebot
Prüfungen
Abschlussarbeiten
Forschung
Profil
Veröffentlichungen
aktuelles
FernUni spezial
Virtueller Studienplatz
Suche
Service
Kontakt
A-Z
Impressum/ Datenschutz
Priv.- Doz. Dr. Robert Rettinger
E-Mail:
robert.rettinger
Telefon: +49 2331 987 - 4784
Fax: +49 2331 987 - 339
Sprechzeiten: Donnerstag, 14.00 - 16.00 Uhr
Raum: H 11 3 IZ
Veröffentlichungen
Artikel in Zeitschriften
Robert Rettinger
; Klaus Weihrauch; Ning Zhong:
Topological Complexity of Blowup Problems
, in Journal of Universal Computer Science, Vol 15 (6), pp 1301 - 1316
Robert Rettinger
:
Bloch’s Constant is Computable
, in Journal of Universal Computer Science, 14(6): 896 - 907, 2008
Robert Rettinger
; Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers
, in Journal of Complexity, 22, No. 6, 818 - 826, 2006
Romain Gengler;
Robert Rettinger
; Xizhong Zheng:
Closure Properties of Real Number Classes under CBV Functions
, in Theory of Comnputing Systems, 38, No. 6, 701 - 729, 2005
Robert Rettinger
; Xizhong Zheng:
Effective Jordan Decomposition
, in Theory of Comnputing Systems, 38, No. 2, 189 - 209, 2005
George Barmpalias;
Robert Rettinger
; Xizhong Zheng:
h-Monotonically Computable Real Numbers
, in Mathematical Logic Quarterly, 51, No. 2, 157 - 170, 2005
Robert Rettinger
; Xizhong Zheng:
Weak Computability and Representations of Reals
, in Mathematical Logic Quarterly, 50, No. 4/5, 431 - 442, 2004
Robert Rettinger
; Xizhong Zheng:
On the Hierarchy and Extension of Monotonically Computable Real Numbers
, in Journal of Complexity, 19, 672 - 691, 2003
Burchard von Braunmühl; Romain Gengler;
Robert Rettinger
; Xizhong Zheng:
Monotonically Computable Real Numbers
, in Mathematical Logic Quarterly, 48, No. 3, 459 - 479, 2002
Burchard von Braunmühl; Romain Gengler;
Robert Rettinger
:
The Alternation Hierarchy for Sublogarithmic Space is Infinite
, in Computational Complexity, 3, 207 - 230, 1993
Konferenzbandbeiträge
Robert Rettinger
:
A Local to Global Principle for the Complexity of Riemann Mappings
, in CCA 2010
Robert Rettinger
; Xizhong Zheng:
On the Computability of Rectifiable Simple Plane Curves
, in CCA 2009
Robert Rettinger
; Xizhong Zheng:
Points on Computable Curves of Computable Lengths
, in MFCS 2009
Robert Rettinger
:
Towards the Complexity of (single) Riemann Mappings
, in CCA 2009
Klaus Weihrauch;
Robert Rettinger
; Ning Zhong:
Complexity of Blowup Problems
, in CCA 2008 (ENTCS 221, 219 - 230)
Robert Rettinger
:
Lower Bounds on the Continuation of Holomorphic Functions
, in CCA 2008 (ENTCS 221, 207 - 217)
Robert Rettinger
:
Computable Riemann Surfaces
, in CiE 2007, 638 - 647
Robert Rettinger
:
On the Computability of Blochs Constant
, in CCA 2007 (ENTCS 202, 315 - 222)
Robert Rettinger
; Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers
, in CCA 2005, 199 - 209
Robert Rettinger
; Xizhong Zheng:
On the Turing Degrees of Divergence Bounded Computable Reals
, in CiE 2005 (LNCS 3526, 418 - 428)
Robert Rettinger
; Xizhong Zheng:
Solovay Reducibility on d-c.e. Real Numbers
, in COCOON 2005 (LNCS 3595, 359 - 368)
Robert Rettinger
:
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions
, in RNC 2006 (ENTCS 120, 145 - 157)
Robert Rettinger
; Xizhong Zheng:
A Note On the Turing Degrees of Divergence Bounded Computable Reals
, in CCA 2004 (ENTCS 120, 231 - 237)
Robert Rettinger
; Xizhong Zheng:
On the Extensions of Solovay Reducibility
, in COCOON 2004 (LNCS 3106, 360 - 369)
Robert Rettinger
; Xizhong Zheng; Romain Gengler:
Ershov’s Hierarchy of Real Numbers
, in MFCS 2003 (LNCS 2747, 681 - 690)
Burchard von Braunmühl;
Robert Rettinger
; Xizhong Zheng:
On the Effective Jordan Decomposability
, in STACS 2003 (LNCS 2607, 167 - 178)
Robert Rettinger
; Klaus Weihrauch:
The Computational Complexity of some Julia Sets
, in STOC 2003, 177 - 185
Robert Rettinger
; Xizhong Zheng:
h-Monotonically Computable Real Numbers
, in CCA 2003, 375 - 388
Burchard von Braunmühl;
Robert Rettinger
; Xizhong Zheng:
Computable Real Functions of Bounded Variation and semi-computable Real Numbers
, in COCOON 2002 (LNCS 2387, 47 - 56)
Burchard von Braunmühl;
Robert Rettinger
; Xizhong Zheng:
Effectively Absolute Continuity and Effective Jordan Decomposability
, in CCA 2002 (ENTCS 66, No 1, 1 - 12)
Robert Rettinger
; Xizhong Zheng:
Hierarchy of the Monotonically Computable Real Numbers
, in MFCS 2001 (LNCS 2136, 633 - 644)
Burchard von Braunmühl; Romain Gengler;
Robert Rettinger
; Xizhong Zheng:
Monotonically Computable Real Numbers
, in DMTCS 2001, 187 - 201
Robert Rettinger
;
Rutger Verbeek
:
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
, in FCT 2001, 311 - 322
Burchard von Braunmühl; Romain Gengler;
Robert Rettinger
; Xizhong Zheng:
Weakly Computable Real Numbers and Total Computable Real Functions
, in COCOON 2001 (LNCS 2108, 586 - 595)
Burchard von Braunmühl; Romain Gengler;
Robert Rettinger
:
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite
, in STACS 1994 (LNCS 775, 85 - 96)
Sonstiges
Robert Rettinger
:
Computability and Complexity Aspects of Univariate Complex Analysis
, Habilitationsschrift, Oktober 2007
Robert Rettinger
:
Orakelabhängige Zeithierarchiesätze
, Dissertation, FernUniversität Hagen, Dezember 1999
Robert Rettinger
:
Turingmaschinen mit kleinem Speicher
, Diplomarbeit, Rheinische Friedrich-Wilhelms-Universität Bonn, Dezember 1993
Christoph Winkler
| 12.11.2010
© FernUniversität in Hagen
FernUniversität in Hagen, Fakultät für Mathematik und Informatik, Lehrgebiet Algorithmen und Komplexität, 58084 Hagen, Tel.: +49 2331 987-2823