Robert Rettinger

According to our database1, Robert Rettinger authored at least 41 papers between 1993 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Effective Riemann mappings of multiply connected domains and Riemann surfaces.
Mathematical Structures in Computer Science, 2017

2013
Products of effective topological spaces and a uniformly computable Tychonoff Theorem.
Logical Methods in Computer Science, 2013

2012
On computable approximations of Landau's constant
Logical Methods in Computer Science, 2012

Point-Separable Classes of Simple Computable Planar Curves
Logical Methods in Computer Science, 2012

Compactness and the Effectivity of Uniformization.
Proceedings of the How the World Computes, 2012

2010
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009
Topological Complexity of Blowup Problems.
J. UCS, 2009

Computability and Complexity in Analysis.
J. UCS, 2009

Points on Computable Curves of Computable Lengths.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On the Computability of Rectifiable Simple Curve (Extended Abstract).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

Towards the Complexity of Riemann Mappings (Extended Abstract).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Bloch's Constant is Computable.
J. UCS, 2008

Complexity of Blowup Problems: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2008

Lower Bounds on the Continuation of Holomorphic Functions.
Electr. Notes Theor. Comput. Sci., 2008

On the Computability of Blochs Constant.
Electr. Notes Theor. Comput. Sci., 2008

2007
Computable Riemann Surfaces.
Proceedings of the Computation and Logic in the Real World, 2007

2006
A Reference Correction of "Effective Jordan Decomposition".
Theory Comput. Syst., 2006

A hierarchy of Turing degrees of divergence bounded computable real numbers.
J. Complexity, 2006

2005
Closure Properties of Real Number Classes under CBV Functions.
Theory Comput. Syst., 2005

Effective Jordan Decomposition.
Theory Comput. Syst., 2005

h-monotonically computable real numbers.
Math. Log. Q., 2005

A Note On the Turing Degrees of Divergence Bounded Computable Reals.
Electr. Notes Theor. Comput. Sci., 2005

A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions.
Electr. Notes Theor. Comput. Sci., 2005

Solovay Reducibility on D-c.e Real Numbers.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On the Turing Degrees of Divergence Bounded Computable Reals.
Proceedings of the New Computational Paradigms, 2005

A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers.
Proceedings of the CCA 2005, 2005

2004
Weak computability and representation of reals.
Math. Log. Q., 2004

On the Extensions of Solovay-Reducibility..
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
On the hierarchy and extension of monotonically computable real numbers.
J. Complexity, 2003

The computational complexity of some julia sets.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

On the Effective Jordan Decomposability.
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.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Monotonically Computable Real Numbers.
Math. Log. Q., 2002

Effectively Absolute Continuity and Effective Jordan Decomposability.
Electr. Notes Theor. Comput. Sci., 2002

Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Hierarchy of Monotonically Computable Real Numbers.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Weakly Computable Real Numbers and Total Computable Real Functions.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Orakelabhängige Zeithierarchiesätze.
PhD thesis, 2000

1994
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.
Proceedings of the STACS 94, 1994

1993
The Alternation Hierarchy for Sublogarithmic Space is Infinite.
Computational Complexity, 1993


  Loading...