default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Rettinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j16]Robert Rettinger:
Effective Riemann mappings of multiply connected domains and Riemann surfaces. Math. Struct. Comput. Sci. 27(8): 1495-1520 (2017)- 2013
- [j15]Robert Rettinger, Klaus Weihrauch:
Products of effective topological spaces and a uniformly computable Tychonoff Theorem. Log. Methods Comput. Sci. 9(4) (2013) - 2012
- [j14]Xizhong Zheng, Robert Rettinger:
Point-Separable Classes of Simple Computable Planar Curves. Log. Methods Comput. Sci. 8(3) (2012) - [j13]Robert Rettinger:
On computable approximations of Landau's constant. Log. Methods Comput. Sci. 8(4) (2012) - [c26]Robert Rettinger:
Compactness and the Effectivity of Uniformization. CiE 2012: 616-625 - 2010
- [c25]Robert Rettinger:
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract). CCA 2010: 120-129
2000 – 2009
- 2009
- [j12]Vasco Brattka, Pieter Collins, Robert Rettinger:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 15(6): 1143-1144 (2009) - [j11]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Topological Complexity of Blowup Problems. J. Univers. Comput. Sci. 15(6): 1301-1316 (2009) - [c24]Robert Rettinger:
Towards the Complexity of Riemann Mappings (Extended Abstract). CCA 2009 - [c23]Robert Rettinger, Xizhong Zheng:
On the Computability of Rectifiable Simple Curve (Extended Abstract). CCA 2009 - [c22]Robert Rettinger, Xizhong Zheng:
Points on Computable Curves of Computable Lengths. MFCS 2009: 736-743 - 2008
- [j10]Robert Rettinger:
Bloch's Constant is Computable. J. Univers. Comput. Sci. 14(6): 896-907 (2008) - [c21]Robert Rettinger:
Lower Bounds on the Continuation of Holomorphic Functions. CCA 2008: 207-217 - [c20]Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Complexity of Blowup Problems: Extended Abstract. CCA 2008: 219-230 - 2007
- [c19]Robert Rettinger:
Computable Riemann Surfaces. CiE 2007: 638-647 - [c18]Robert Rettinger:
On the Computability of Blochs Constant. CCA 2007: 315-322 - 2006
- [j9]Robert Rettinger, Xizhong Zheng:
A hierarchy of Turing degrees of divergence bounded computable real numbers. J. Complex. 22(6): 818-826 (2006) - [j8]Xizhong Zheng, Robert Rettinger:
A Reference Correction of "Effective Jordan Decomposition". Theory Comput. Syst. 39(2): 385-385 (2006) - 2005
- [j7]Xizhong Zheng, Robert Rettinger, George Barmpalias
:
h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005) - [j6]Xizhong Zheng, Robert Rettinger:
Effective Jordan Decomposition. Theory Comput. Syst. 38(2): 189-209 (2005) - [j5]Xizhong Zheng, Robert Rettinger, Romain Gengler:
Closure Properties of Real Number Classes under CBV Functions. Theory Comput. Syst. 38(6): 701-729 (2005) - [c17]Robert Rettinger, Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. CCA 2005: 199-209 - [c16]Robert Rettinger, Xizhong Zheng:
On the Turing Degrees of Divergence Bounded Computable Reals. CiE 2005: 418-428 - [c15]Robert Rettinger, Xizhong Zheng:
Solovay Reducibility on D-c.e Real Numbers. COCOON 2005: 359-368 - 2004
- [j4]Xizhong Zheng, Robert Rettinger:
Weak computability and representation of reals. Math. Log. Q. 50(4-5): 431-442 (2004) - [c14]Xizhong Zheng, Robert Rettinger:
On the Extensions of Solovay-Reducibility.. COCOON 2004: 360-369 - [c13]Robert Rettinger:
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions. CCA 2004: 145-157 - [c12]Xizhong Zheng, Robert Rettinger:
A Note On the Turing Degrees of Divergence Bounded Computable Reals. CCA 2004: 231-237 - 2003
- [j3]Robert Rettinger, Xizhong Zheng:
On the hierarchy and extension of monotonically computable real numbers. J. Complex. 19(5): 672-691 (2003) - [c11]Xizhong Zheng, Robert Rettinger, Romain Gengler:
Ershov's Hierarchy of Real Numbers. MFCS 2003: 681-690 - [c10]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl:
On the Effective Jordan Decomposability. STACS 2003: 167-178 - [c9]Robert Rettinger, Klaus Weihrauch:
The computational complexity of some julia sets. STOC 2003: 177-185 - 2002
- [j2]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Monotonically Computable Real Numbers. Math. Log. Q. 48(3): 459-479 (2002) - [c8]Robert Rettinger, Xizhong Zheng:
Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers. COCOON 2002: 47-56 - [c7]Robert Rettinger, Klaus Weihrauch:
The Computational Complexity of Some Julia Sets. CCA 2002: 154-164 - [c6]Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl:
Effectively Absolute Continuity and Effective Jordan Decomposability. CCA 2002: 213-224 - 2001
- [c5]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Weakly Computable Real Numbers and Total Computable Real Functions. COCOON 2001: 586-595 - [c4]Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl:
Monotonically Computable Real Numbers. DMTCS 2001: 187-201 - [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 - 2000
- [b1]Robert Rettinger:
Orakelabhängige Zeithierarchiesätze. University of Hagen, Germany, 2000, pp. 1-161
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. Comput. Complex. 3: 207-230 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
