 |
Institute for Theoretical Computer Science, Bundeswehr University Munich Werner-Heisenberg-Weg 39 85579 Neubiberg, Germany
|
|
|
Recently submitted |
|
|
R. Hölzl, S. Kleine, F. Stephan
Strong n-conjectures over rings of integers |
||
|
March 2025 | |
|
R. Hölzl, Ng K. M.
The computational content of multidimensional discontinuity |
||
|
|
May 2024 | |
|
R. Hölzl, P. Janicki
Benign approximations and non-speedability |
||
|
|
August 2023 | |
|
|
Journals |
|
|
R. Hölzl, S. Kleine, F. Stephan
Improved lower bounds for strong n-conjectures |
||
|
|
Journal of the Australian Mathematical Society, June 2025 | |
|
D. Belanger, C.T. Chong, R. Hölzl, F. Stephan
Independence and Induction in Reverse Mathematics |
||
|
|
Journal of Symbolic Logic, accepted with minor revisions March 2025 | |
|
J. Franklin, R. Hölzl, A. Melnikov, Ng K. M., D. Turetsky
Computable classifications of continuous, transducer, and regular functions |
||
|
|
Theoretical Computer Science, March 2025 | |
|
P. Hertling, R. Hölzl, P. Janicki
Regainingly approximable numbers and sets |
||
|
|
Journal of Symbolic Logic, January 2024 | |
|
R. Hölzl, C. P. Porter
Degrees of randomized computability |
||
|
|
Bulletin of Symbolic Logic, March 2022 | |
|
R. Hölzl, W. Merkle, J. S. Miller, F. Stephan, Yu L.
Chaitin’s Ω as a Continuous Function |
||
|
|
Journal of Symbolic Logic, March 2020 | |
|
R. Hölzl, C. P. Porter
Rank and randomness |
||
|
|
Journal of Symbolic Logic, December 2019 | |
|
R. Hölzl, S. Jain, F. Stephan
Learning Pattern Languages Over Groups |
||
|
|
Journal version: Theoretical Computer Science, September 2018 | |
|
|
Conference version: Algorithmic Learning Theory, October 2016 | |
|
L. Bienvenu, R. Hölzl, C. P. Porter, P. Shafer
Randomness and semi-measures |
||
|
|
Notre Dame Journal of Formal Logic, June 2017 | |
|
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, 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 Bi-immunity 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
Time-bounded 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 non-monotonic 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 |
|
|
R. Hölzl, P. Janicki, W. Merkle, F. Stephan
Randomness versus superspeedability |
||
|
|
Mathematical Foundations of Computer Science, August 2024 | |
|
R. Hölzl, S. Jain, P. Schlicht, K. Seidel, F. Stephan
Automatic Learning from Repetitive Texts |
||
|
|
Algorithmic Learning Theory, October 2017 | |
|
V. Brattka, R. Hölzl, R. Kuyper
Monte Carlo Computability |
||
|
|
Symposium on Theoretical Aspects of Computer Science, March 2017 | |
|
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 |
|
| Ausgewählte Kapitel der Komplexitätstheorie | ||
|
|
Lecture on selected topics from advanced complexity theory in German, January 2024 | |
| Quantencomputer | ||
|
|
Short lecture on quantum computing in German, December 2024 | |
|
|
Other |
|
| Article reviews | ||
|
MathSciNet Mathematical Reviews | |
|
|
Zentralblatt MATH | |
| Kolmogorov complexity | ||
|
|
Doctoral dissertation, December 2010 | |
| Maß in Polynomialzeit | ||
|
|
Diploma thesis in German, October 2006 | |
Fluent in German, English, French.
Hobbies include photography, mountaineering, cycling, and scuba diving.