Robert Rettinger

Math. Struct. Comput. Sci., 2017

2013

Products of effective topological spaces and a uniformly computable Tychonoff Theorem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

2012

On computable approximations of Landau's constant

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Point-Separable Classes of Simple Computable Planar Curves

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Compactness and the Effectivity of Uniformization.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

2010

A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

Topological Complexity of Blowup Problems.

[BibT_eX]

[DOI]

Ning Zhong

J. Univers. Comput. Sci., 2009

Computability and Complexity in Analysis.

[BibT_eX]

[DOI]

Vasco Brattka

Pieter Collins

J. Univers. Comput. Sci., 2009

Points on Computable Curves of Computable Lengths.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On the Computability of Rectifiable Simple Curve (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

Towards the Complexity of Riemann Mappings (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

Bloch's Constant is Computable.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

Complexity of Blowup Problems: Extended Abstract.

[BibT_eX]

[DOI]

Ning Zhong

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

Lower Bounds on the Continuation of Holomorphic Functions.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

On the Computability of Blochs Constant.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Computable Riemann Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

A Reference Correction of "Effective Jordan Decomposition".

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

A hierarchy of Turing degrees of divergence bounded computable real numbers.

[BibT_eX]

[DOI]

J. Complex., 2006

2005

Closure Properties of Real Number Classes under CBV Functions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Effective Jordan Decomposition.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

<i>h</i>-monotonically computable real numbers.

[BibT_eX]

[DOI]

George Barmpalias

Math. Log. Q., 2005

Solovay Reducibility on D-c.e Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On the Turing Degrees of Divergence Bounded Computable Reals.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Weak computability and representation of reals.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

A Note On the Turing Degrees of Divergence Bounded Computable Reals.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

On the Extensions of Solovay-Reducibility..

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On the hierarchy and extension of monotonically computable real numbers.

[BibT_eX]

[DOI]

J. Complex., 2003

On the Effective Jordan Decomposability.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Ershov's Hierarchy of Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Monotonically Computable Real Numbers.

[BibT_eX]

[DOI]

Math. Log. Q., 2002

Effectively Absolute Continuity and Effective Jordan Decomposability.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

The Computational Complexity of Some Julia Sets.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Hierarchy of Monotonically Computable Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.

[BibT_eX]

[DOI]

Rutger Verbeek

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Weakly Computable Real Numbers and Total Computable Real Functions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Orakelabhängige Zeithierarchiesätze.

[BibT_eX]

[DOI]

PhD thesis, 2000

1994

The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1993

The Alternation Hierarchy for Sublogarithmic Space is Infinite.

[BibT_eX]

[DOI]