| 2025 | SOFSEM | On Pumping Problems for Unary Regular Languages. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2024 | DLT | The Pumping Lemma for Context-Free Languages is Undecidable. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2024 | MCU | On Switching Finite State Automata. | Joss Chapman, Markus Holzer, Petra Wolf |
| 2023 | RC | Computational Complexity of Reversible Reaction Systems. | Markus Holzer, Christian Rauch |
| 2021 | CSR | On the Computational Complexity of Reaction Systems, Revisited. | Markus Holzer, Christian Rauch |
| 2021 | DLT | The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). | Markus Holzer, Christian Rauch |
| 2021 | FCT | On Minimizing Regular Expressions Without Kleene Star. | Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2021 | MFCS | Optimal Regular Expressions for Palindromes of Given Length. | Hermann Gruber, Markus Holzer |
| 2021 | SBAC-PAD | Opening the Black Box: Performance Estimation during Code Generation for GPUs. | Dominik Ernst, Georg Hager, Matthias Knorr, Gerhard Wellein, Markus Holzer |
| 2019 | CiE | Non-Recursive Trade-Offs Are "Almost Everywhere". | Markus Holzer, Martin Kutrib |
| 2019 | LATA | The Range of State Complexities of Languages Resulting from the Cut Operation. | Markus Holzer, Michal Hospodr |
| 2019 | MFCS | Computational Complexity of Synchronization under Regular Constraints. | Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf |
| 2018 | DLT | Computational Complexity of Decision Problems on Self-verifying Finite Automata. | Markus Holzer, Sebastian Jakobi, Jozef Jirsek Jr. |
| 2018 | DLT | Decidability of Right One-Way Jumping Finite Automata. | Simon Beier, Markus Holzer |
| 2018 | DLT | On Minimal Grammar Problems for Finite Languages. | Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2018 | ECCV | MAM: Transfer Learning for Fully Automatic Video Annotation and Specialized Detector Creation. | Wolfgang Fuhl, Nora Castner, Lin Zhuang, Markus Holzer, Wolfgang Rosenstiel, Enkelejda Kasneci |
| 2018 | FUN | Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms. | Markus Holzer, Jan-Tobias Maurer |
| 2017 | DLT | On Regular Expression Proof Complexity. | Simon Beier, Markus Holzer |
| 2017 | DLT | Operational State Complexity and Decidability of Jumping Finite Automata. | Simon Beier, Markus Holzer, Martin Kutrib |
| 2017 | DLT | On the Mother of All Automata: The Position Automaton. | Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogrio Reis |
| 2017 | RC | Reversible Nondeterministic Finite Automata. | Markus Holzer, Martin Kutrib |
| 2016 | LATA | Reversible Shrinking Two-Pushdown Automata. | Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher |
| 2016 | MICCAI | Unsupervised Identification of Clinically Relevant Clusters in Routine Imaging Data. | Johannes Hofmanninger, Markus Krenn, Markus Holzer, Thomas Schlegl, Helmut Prosch, Georg Langs |
| 2015 | DLT | Minimal Reversible Deterministic Finite Automata. | Markus Holzer, Sebastian Jakobi, Martin Kutrib |
| 2015 | MCU | Tight Bounds for Cut-Operations on Deterministic Finite Automata. | Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe |
| 2014 | DLT | Minimal and Hyper-Minimal Biautomata - (Extended Abstract). | Markus Holzer, Sebastian Jakobi |
| 2014 | LATA | ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. | Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard |
| 2014 | MMM | A Visual Information Retrieval System for Radiology Reports and the Medical Literature. | Dimitrios Markonis, Ren Donner, Markus Holzer, Thomas Schlegl, Sebastian Dungs, Sascha Kriewel, Georg Langs, Henning Mller |
| 2012 | DLT | From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract). | Markus Holzer, Sebastian Jakobi |
| 2012 | DLT | Generalized Derivations with Synchronized Context-Free Grammars. | Markus Holzer, Sebastian Jakobi, Ian McQuillan |
| 2012 | FUN | On Computer Integrated Rationalized Crossword Puzzle Manufacturing. | Jakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke |
| 2012 | FUN | On the Complexity of Rolling Block and Alice Mazes. | Markus Holzer, Sebastian Jakobi |
| 2012 | FUN | Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. | Markus Holzer, Sebastian Jakobi |
| 2011 | DLT | Chop Operations and Expressions: Descriptional Complexity Considerations. | Markus Holzer, Sebastian Jakobi |
| 2011 | DLT | Nodes Connected by Path Languages. | Markus Holzer, Martin Kutrib, Ursula Leiter |
| 2011 | MICCAI | Texture Bags: Anomaly Retrieval in Medical Images Based on Local 3D-Texture Similarity. | Andreas Burner, Rene Donner, Marius Mayerhoefer, Markus Holzer, Franz Kainberger, Georg Langs |
| 2011 | MICCAI | Evaluation of Fast 2D and 3D Medical Image Retrieval Approaches Based on Image Miniatures. | Ren Donner, Sebastian Haas, Andreas Burner, Markus Holzer, Horst Bischof, Georg Langs |
| 2011 | MICCAI | Superpixel-Based Interest Points for Effective Bags of Visual Words Medical Image Retrieval. | Sebastian Haas, Rene Donner, Andreas Burner, Markus Holzer, Georg Langs |
| 2010 | DLT | The Complexity of Regular(-Like) Expressions. | Markus Holzer, Martin Kutrib |
| 2010 | FUN | The Computational Complexity of RaceTrack. | Markus Holzer, Pierre McKenzie |
| 2010 | FUN | The Computational Complexity of the Kakuro Puzzle, Revisited. | Oliver Ruepp, Markus Holzer |
| 2010 | STACS | On Iterated Dominance, Matrix Elimination, and Matched Paths. | Felix Brandt, Felix A. Fischer, Markus Holzer |
| 2009 | DLT | Tight Bounds on the Descriptional Complexity of Regular Expressions. | Hermann Gruber, Markus Holzer |
| 2009 | LATA | Undecidability of Operation Problems for T0L Languages and Subclasses. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2009 | LATA | Descriptional and Computational Complexity of Finite Automata. | Markus Holzer, Martin Kutrib |
| 2008 | DLT | Provably Shorter Regular Expressions from Deterministic Finite Automata. | Hermann Gruber, Markus Holzer |
| 2008 | ICALP | Finite Automata, Digraph Connectivity, and Regular Expression Size. | Hermann Gruber, Markus Holzer |
| 2008 | LATA | Deterministic Input-Reversal and Input-Revolving Finite Automata. | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2008 | LATA | Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. | Henning Bordihn, Markus Holzer |
| 2007 | DLT | Hairpin Finite Automata. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2007 | DLT | Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. | Hermann Gruber, Markus Holzer |
| 2007 | FUN | Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. | Hermann Gruber, Markus Holzer, Oliver Ruepp |
| 2007 | FUN | The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. | Markus Holzer, Oliver Ruepp |
| 2007 | LATA | Computational Complexity of NFA Minimization for Finite and Unary Languages. | Hermann Gruber, Markus Holzer |
| 2007 | MCU | More on the Size of Higman-Haines Sets: Effective Constructions. | Hermann Gruber, Markus Holzer, Martin Kutrib |
| 2007 | STACS | Symmetries and the Complexity of Pure Nash Equilibrium. | Felix Brandt, Felix A. Fischer, Markus Holzer |
| 2006 | DLT | Finding Lower Bounds for Nondeterministic State Complexity Is Hard. | Hermann Gruber, Markus Holzer |
| 2005 | DLT | Revolving-Input Finite Automata. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2005 | DLT | On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. | Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara Knig |
| 2005 | FCT | Shrinking Multi-pushdown Automata. | Markus Holzer, Friedrich Otto |
| 2004 | DLT | On Competence in CD Grammar Systems. | Maurice H. ter Beek, Erzsbet Csuhaj-Varj, Markus Holzer, Gyrgy Vaszil |
| 2004 | DLT | Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2004 | MCU | Register Complexity of LOOP-, WHILE-, and GOTO-Programs. | Markus Holzer, Martin Kutrib |
| 2004 | MFCS | A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). | Martin Beaudry, Jos M. Fernandez, Markus Holzer |
| 2003 | DLT | On Deterministic Finite Automata and Syntactic Monoid Size, Continued. | Markus Holzer, Barbara Knig |
| 2003 | DLT | Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. | Markus Holzer, Martin Kutrib |
| 2003 | ICALP | Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. | Markus Holzer, Martin Kutrib |
| 2002 | DLT | Unary Language Operations and Their Nondeterministic State Complexity. | Markus Holzer, Martin Kutrib |
| 2002 | DLT | On Deterministic Finite Automata and Syntactic Monoid Size. | Markus Holzer, Barbara Knig |
| 2001 | DLT | On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto |
| 2001 | MFCS | The Complexity of Tensor Circuit Evaluation. | Martin Beaudry, Markus Holzer |
| 2000 | MFCS | Alternating and Empty Alternating Auxiliary Stack Automata. | Markus Holzer, Pierre McKenzie |
| 1999 | DLT | Cooperating distributed grammar systems with non-terminating components. | Henning Bordihn, Markus Holzer |
| 1999 | DLT | On fixed and general membership for external and internal contextual languages. | Markus Holzer |
| 1998 | GD | VisA: A Tool for Visualizing and Animating Automata and Formal Languages. | Markus Holzer, Muriel Quenzer |
| 1998 | MCU | The Generative Power of | Henning Fernau, Rudolf Freund, Markus Holzer |
| 1998 | SSPR | Character Recognition with | Henning Fernau, Rudolf Freund, Markus Holzer |
| 1997 | DLT | Bounding resources in Cooperating Distributed Grammar Systems. | Henning Fernau, Markus Holzer, Rudolf Freund |
| 1997 | MFCS | Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. | Markus Holzer |
| 1995 | DLT | On Emptiness and Counting for Alternating Finite Automata. | Markus Holzer |
| 1995 | MFCS | Automata That Take Advice. | Carsten Damm, Markus Holzer |
| 1994 | MFCS | Inductive Counting Below LOGSPACE. | Carsten Damm, Markus Holzer |
| 1993 | DLT | Deterministic OL Languages are of Very Low Complexity: DOL is in AC | Carsten Damm, Markus Holzer, Klaus-Jrn Lange, Peter Rossmanith |
| 1993 | FCT | On the Complexities of Linear LL(1) and LR(1) Grammars. | Markus Holzer, Klaus-Jrn Lange |
| 1992 | MFCS | Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. | Carsten Damm, Markus Holzer, Klaus-Jrn Lange |