Faculty of Computer Science Bundeswehr University Munich WernerHeisenbergWeg 39 85579 Neubiberg

Journals 
R. Hölzl, C. P. Porter
Randomness for computable measures and initial segment complexity  
Annals of Pure and Applied Logic, April 2017  
R. Hölzl, S. Jain, F. Stephan
Inductive Inference and Reverse Mathematics  
Journal version: Annals of Pure and Applied Logic, December 2016  
Conference version: Symposium on Theoretical Aspects of Computer Science, March 2015  
R. Hölzl, F. Stephan, Yu L.
On Martin's Pointed Tree Theorem  
Computability, May 2016  
R. Hölzl, P. Shafer
Universality, optimality, and randomness deficiency  
Annals of Pure and Applied Logic, October 2015  
V. Brattka, G. Gherardi, R. Hölzl
Probabilistic Computability and Choice  
Information and Computation, June 2015  
L. Bienvenu, R. Hölzl, C. P. Porter, P. Shafer
Randomness and semimeasures  
Notre Dame Journal of Formal Logic, accepted September 2014  
L. Bienvenu, R. Hölzl, J. S. Miller, A. Nies
Denjoy, Demuth and Density  
Journal version: Journal of Mathematical Logic, June 2014  
Conference version: Symposium on Theoretical Aspects of Computer Science, March 2012  
R. Hölzl, T. Kräling, F. Stephan, Wu G.
Initial Segment Complexities of Randomness Notions  
Journal version: Information and Computation, February 2014  
Conference version: Theoretical Computer Science, September 2010  
L. Bienvenu, A. D. Day, R. Hölzl
From Biimmunity to Absolute Undecidability  
Journal of Symbolic Logic, December 2013  
G. Barmpalias, R. Hölzl, A. E. M. Lewis, W. Merkle
Analogues of Chaitin's Omega in the computably enumerable sets  
Information Processing Letters, January 2013  
R. Hölzl, T. Kräling, W. Merkle
Timebounded Kolmogorov complexity and Solovay functions  
Journal version: Theory of Computing Systems, January 2013  
Conference version: Mathematical Foundations of Computer Science, August 2009  
L. Bienvenu, R. Hölzl, T. Kräling, W. Merkle
Separations of nonmonotonic randomness notions  
Journal version: Journal of Logic and Computation, September 2010  
Conference version: Computability and Complexity in Analysis, August 2009  
Book chapters 
R. Hölzl, D. Raghavan, F. Stephan, Zhang J.
Weakly Represented Families in Reverse Mathematics  
Computability and Complexity, Lecture Notes in Computer Science, January 2017  
V. Brattka, G. Gherardi, R. Hölzl, A. Pauly
The Vitali Covering Theorem in the Weihrauch Lattice  
Computability and Complexity, Lecture Notes in Computer Science, January 2017  
Peer‑reviewed conferences 
V. Brattka, R. Hölzl, R. Kuyper
Monte Carlo Computability  
Symposium on Theoretical Aspects of Computer Science, March 2017  
R. Hölzl, S. Jain, F. Stephan
Learning Pattern Languages Over Groups  
Journal version: Submitted November 2016  
Conference version: Algorithmic Learning Theory, October 2016  
V. Brattka, G. Gherardi, R. Hölzl
Las Vegas Computability and Algorithmic Randomness  
Symposium on Theoretical Aspects of Computer Science, March 2015  
R. Hölzl, W. Merkle
Traceable sets  
Theoretical Computer Science, September 2010  
R. Hölzl, W. Merkle
Generation complexity versus distinction complexity  
Theory and Applications of Models of Computation, April 2008  
Selected talks 
Selected teaching material 
R. Hölzl
Quantencomputer  
Short lecture on quantum computing in German, December 2016  
Other 
R. Hölzl
Kolmogorov complexity  
Doctoral dissertation, December 2010  
R. Hölzl
Maß in Polynomialzeit  
Diploma thesis, October 2006 
Member of the programme committees of Computability, Complexity and Randomness 2015 and 2017.
Member of the organizing committee for Computability in Europe 2009.
Several IT and programming jobs.
Fluent in German, English, French.
Hobbies include photography, mountaineering, snowshoeing and scuba diving.