| 2024 | CiE | Cellular Automata: Communication Matters. | Martin Kutrib, Andreas Malcher |
| 2024 | DLT | Cellular Automata: From Black-and-White to High Gloss Color. | Martin Kutrib, Andreas Malcher |
| 2024 | DLT | Deterministic Pushdown Automata with Translucent Input Letters. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt |
| 2021 | SOFSEM | Iterated Uniform Finite-State Transducers on Unary Languages. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2020 | CiE | Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2018 | DLT | Reversible Pushdown Transducers. | Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero |
| 2016 | LATA | Reversible Shrinking Two-Pushdown Automata. | Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher |
| 2016 | LATA | Input-Driven Queue Automata with Internal Transductions. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2016 | RC | Boosting Reversible Pushdown Machines by Preprocessing. | Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2015 | MCU | Tinput-Driven Pushdown Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2015 | RC | A Hierarchy of Fast Reversible Turing Machines. | Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher |
| 2014 | DLT | Measuring Communication in Automata Systems - (Invited Paper). | Martin Kutrib, Andreas Malcher |
| 2014 | DLT | Deterministic Set Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2013 | DLT | One-Way Multi-Head Finite Automata with Pebbles But No States. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2012 | DLT | States and Heads Do Count for Unary Multi-head Finite Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2012 | LATIN | Oblivious Two-Way Finite Automata: Decidability and Complexity. | Martin Kutrib, Andreas Malcher, Giovanni Pighizzini |
| 2012 | RC | One-Way Reversible Multi-head Finite Automata. | Martin Kutrib, Andreas Malcher |
| 2010 | DLT | Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. | Henning Bordihn, Martin Kutrib, Andreas Malcher |
| 2010 | LATA | On the Expressive Power of FO[ + ]. | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2010 | LATA | Reversible Pushdown Automata. | Martin Kutrib, Andreas Malcher |
| 2008 | DLT | On the Computational Capacity of Parallel Communicating Finite Automata. | Henning Bordihn, Martin Kutrib, Andreas Malcher |
| 2007 | DLT | Descriptional Complexity of Bounded Context-Free Languages. | Andreas Malcher, Giovanni Pighizzini |
| 2007 | FCT | Real-Time Reversible Iterative Arrays. | Martin Kutrib, Andreas Malcher |
| 2007 | LATA | Fast Reversible Language Recognition Using Cellular Automata. | Martin Kutrib, Andreas Malcher |
| 2006 | DLT | Context-Dependent Nondeterminism for Pushdown Automata. | Martin Kutrib, Andreas Malcher |
| 2006 | MFCS | Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. | Martin Kutrib, Andreas Malcher |
| 2004 | DLT | The Boolean Closure of Linear Context-Free Languages. | Martin Kutrib, Andreas Malcher, Detlef Wotschke |
| 2003 | DLT | Minimizing Finite Automata Is Computationally Hard. | Andreas Malcher |