Dr. rer. nat. Rupert Hölzl

Bureau 6A35
LIAFA
175 rue du Chevaleret
75013 Paris
France

r@hoelzl.fr Email, MSN, Google Talk & Video

Publications and talks

   Journals   
R. Hölzl, T. Kräling, W. Merkle
Time-bounded Kolmogorov complexity and Solovay functions
Theory of Computing Systems (accepted)
L. Bienvenu, R. Hölzl, T. Kräling, W. Merkle
Separations of non-monotonic randomness notions
Journal of Logic and Computation, September 2010
   Peer-reviewed Conferences   
L. Bienvenu, R. Hölzl, J. S. Miller, A. Nies
The Denjoy alternative for computable functions
Symposium on Theoretical Aspects of Computer Science, 2012
R. Hölzl, T. Kräling, F. Stephan, Wu G.
Initial Segment Complexities of Randomness Notions
World Computer Congress: Theoretical Computer Science, 2010
R. Hölzl, W. Merkle
Traceable sets
World Computer Congress: Theoretical Computer Science, 2010
R. Hölzl, T. Kräling, W. Merkle
Time-bounded Kolmogorov complexity and Solovay functions
Mathematical Foundations of Computer Science, 2009
L. Bienvenu, R. Hölzl, T. Kräling, W. Merkle
Separations of Non-monotonic Randomness Notions
Computability and Complexity in Analysis, 2009
R. Hölzl, W. Merkle
Generation complexity versus distinction complexity
Theory and Applications of Models of Computation, 2008
   Technical reports   
L. Bienvenu, R. Hölzl, J. S. Miller, A. Nies
The Denjoy alternative for computable functions
HAL, 2011
   Invited Talks   
R. Hölzl
The Denjoy alternative for computable functions
Twelfth Asian Logic Conference, Wellington, 2011 / University of Heidelberg, 2012
R. Hölzl
The Denjoy alternative is incomparable with Martin-Löf randomness
Analysis and Randomness in Auckland, 2011
R. Hölzl
Traceable sets
Talk for a general mathematics audience at the University of Wellington, 2010
   Selected contributed talks   
R. Hölzl
The Denjoy alternative for computable functions
Symposium on Theoretical Aspects of Computer Science, 2012
   Other   
R. Hölzl
Kolmogorov complexity
Doctoral dissertation, 2010
R. Hölzl
Maß in Polynomialzeit
Diploma thesis, 2006

Short CV

2011-2Postdoctoral researcher at the Laboratoire d'Informatique Algorithmique: Fondements et Applications, funded by a Feodor Lynen Research Fellowship by the Alexander von Humboldt Foundation.
2010Dissertation in mathematics at the University of Heidelberg.
2007-10Doctoral student with Priv.-Doz. Dr. Wolfgang Merkle at the University of Heidelberg, funded by the German Research Foundation.
2007Diplom in mathematics at the University of Heidelberg.
2001-7Scholarship by the German National Academic Foundation.
2004-5Sojourn at the École Normale Supérieure, rue d'Ulm, in Paris.
2003Vordiplom in physics at the University of Heidelberg.

Teaching assistantships in Computability and Complexity Theory, Randomized Algorithms, Mathematics for Biologists.

Member of the Organizing Committee for Computability in Europe 2009.

Several IT and programming jobs.

Photography



Place mouse cursor over images and cycle mouse wheel to scroll.