Faculty of Computer Science Universität der Bundeswehr München WernerHeisenbergWeg 39 85577 Neubiberg

Journals 
Book chapters 
R. Hölzl, D. Raghavan, F. Stephan, Zhang J.
Weakly Represented Families in Reverse Mathematics  
Rod Downey Festschrift, Lecture Notes in Computer Science, accepted July 2016  
V. Brattka, G. Gherardi, R. Hölzl, A. Pauly
The Vitali Covering Theorem in the Weihrauch Lattice  
Rod Downey Festschrift, Lecture Notes in Computer Science, accepted July 2016  
Peer‑reviewed conferences 
R. Hölzl, S. Jain, F. Stephan
Learning Pattern Languages Over Groups  
Algorithmic Learning Theory, accepted June 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 
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.