| 2026 | KSEM | Large Language Model-Based Data Querying and Analysis for Manufacturing Industry. | Rahulan Radhakrishnan, Sadeer Beden, Zuha Shahid, Cinzia Giannetti, Arnold Beckmann |
| 2024 | MFCS | On Complexity of Confluence and Church-Rosser Proofs. | Arnold Beckmann, Georg Moser |
| 2022 | KES | Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. | Kayal Lakshmanan, Eugenio Borghini, Arnold Beckmann, Cameron Pleydell-Pearce, Cinzia Giannetti |
| 2017 | WoLLIC | Total Search Problems in Bounded Arithmetic and Improved Witnessing. | Arnold Beckmann, Jean-Jos Razafindrakoto |
| 2015 | LICS | Hyper Natural Deduction. | Arnold Beckmann, Norbert Preining |
| 2013 | MFCS | Parity Games and Propositional Proofs. | Arnold Beckmann, Pavel Pudlk, Neil Thapen |
| 2009 | WoLLIC | A Characterisation of Definable NP Search Problems in Peano Arithmetic. | Arnold Beckmann |
| 2008 | LICS | On the Computational Complexity of Cut-Reduction. | Klaus Aehlig, Arnold Beckmann |
| 2007 | CSL | Propositional Logic for Circuit Classes. | Klaus Aehlig, Arnold Beckmann |
| 2007 | CSL | Proofs, Programs and Abstract Complexity. | Arnold Beckmann |
| 2002 | CSL | Resolution Refutations and Propositional Proofs with Height-Restrictions. | Arnold Beckmann |
| 2002 | LPAR | A Note on Universal Measures for Weak Implicit Computational Complexity. | Arnold Beckmann |