| 2026 | LICS | Layered Automata: A Canonical Model for Automata over Infinite Words. | Antonio Casares, Christof Lding, Igor Walukiewicz |
| 2025 | ICALP | Saturation Problems for Families of Automata. | Len Bohn, Yong Li, Christof Lding, Sven Schewe |
| 2025 | LICS | Minimal History-Deterministic Co-Bchi Automata: Congruences and Passive Learning. | Christof Lding, Igor Walukiewicz |
| 2024 | LICS | Finite-valued Streaming String Transducers. | Emmanuel Filiot, Ismal Jecker, Christof Lding, Anca Muscholl, Gabriele Puppis, Sarah Winter |
| 2023 | STACS | A Regular and Complete Notion of Delay for Streaming String Transducers. | Emmanuel Filiot, Ismal Jecker, Christof Lding, Sarah Winter |
| 2022 | ICALP | Passive Learning of Deterministic Bchi Automata by Combinations of DFAs. | Len Bohn, Christof Lding |
| 2021 | MFCS | Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. | Len Bohn, Christof Lding |
| 2020 | CSL | State Space Reduction For Parity Automata. | Christof Lding, Andreas Tollktter |
| 2020 | ESOP | A First-Order Logic with Frames. | Adithya Murali, Lucas Pea, Christof Lding, P. Madhusudan |
| 2020 | FOSSACS | Ambiguity, Weakness, and Regularity in Probabilistic Bchi Automata. | Christof Lding, Anton Pirogov |
| 2019 | ATVA | New Optimizations and Heuristics for Determinization of Bchi Automata. | Christof Lding, Anton Pirogov |
| 2019 | ICALP | Determinization of Bchi Automata: Unifying the Approaches of Safra and Muller-Schupp. | Christof Lding, Anton Pirogov |
| 2019 | MFCS | New Pumping Technique for 2-Dimensional VASS. | Wojciech Czerwinski, Slawomir Lasota, Christof Lding, Radoslaw Pirkowski |
| 2019 | STACS | Tree Automata with Global Constraints for Infinite Trees. | Patrick Landwehr, Christof Lding |
| 2018 | DLT | Projection for Bchi Tree Automata with Constraints Between Siblings. | Patrick Landwehr, Christof Lding |
| 2018 | DLT | On Finitely Ambiguous Bchi Automata. | Christof Lding, Anton Pirogov |
| 2017 | ALT | Learning MSO-definable hypotheses on strings. | Martin Grohe, Christof Lding, Martin Ritzert |
| 2017 | FCT | Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. | Christof Lding, Christopher Spinrath |
| 2016 | ICALP | On Equivalence and Uniformisation Problems for Finite Transducers. | Emmanuel Filiot, Ismal Jecker, Christof Lding, Sarah Winter |
| 2016 | LICS | Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. | Arnaud Carayol, Christof Lding, Olivier Serre |
| 2016 | MFCS | Transformation Between Regular Expressions and omega-Automata. | Christof Lding, Andreas Tollktter |
| 2016 | MFCS | Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. | Christof Lding, Sarah Winter |
| 2016 | TACAS | Abstract Learning Frameworks for Synthesis. | Christof Lding, P. Madhusudan, Daniel Neider |
| 2015 | CSL | A Unified Approach to Boundedness Properties in MSO. | Lukasz Kaiser, Martin Lang, Simon Leenich, Christof Lding |
| 2014 | CAV | ICE: A Robust Framework for Learning Invariants. | Pranav Garg, Christof Lding, P. Madhusudan, Daniel Neider |
| 2014 | MASS | Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. | Simon Tenbusch, Christof Lding, Frank G. Radmacher, James Gross |
| 2014 | MFCS | Definability and Transformations for Cost Logics and Automatic Structures. | Martin Lang, Christof Lding, Amaldev Manuel |
| 2013 | CAV | Learning Universally Quantified Invariants of Linear Data Structures. | Pranav Garg, Christof Lding, P. Madhusudan, Daniel Neider |
| 2013 | CSL | Deciding the weak definability of Bchi definable tree languages. | Thomas Colcombet, Denis Kuperberg, Christof Lding, Michael Vanden Boom |
| 2013 | DLT | Unambiguous Finite Automata. | Christof Lding |
| 2012 | FOSSACS | Improved Ramsey-Based Bchi Complementation. | Stefan Breuers, Christof Lding, Jrg Olschewski |
| 2012 | MFCS | Regularity Problems for Weak Pushdown ω-Automata and Games. | Christof Lding, Stefan Repke |
| 2011 | CSL | Degrees of Lookahead in Context-free Infinite Games. | Wladimir Fridman, Christof Lding, Martin Zimmermann |
| 2010 | CONCUR | Obliging Games. | Krishnendu Chatterjee, Florian Horn, Christof Lding |
| 2010 | LATA | Equivalence and Inclusion Problem for Strongly Unambiguous Bchi Automata. | Nicolas Bousquet, Christof Lding |
| 2010 | LICS | Regular Cost Functions over Finite Trees. | Thomas Colcombet, Christof Lding |
| 2008 | CSL | The Nesting-Depth of Disjunctive -Calculus for Tree Languages and the Limitedness Problem. | Thomas Colcombet, Christof Lding |
| 2008 | ICALP | The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. | Thomas Colcombet, Christof Lding |
| 2007 | CSL | MSO on the Infinite Binary Tree: Choice and Order. | Arnaud Carayol, Christof Lding |
| 2007 | ICALP | Unranked Tree Automata with Sibling Equalities and Disequalities. | Karianto Wong, Christof Lding |
| 2007 | MFCS | Transition Graphs of Rewriting Systems over Unranked Trees. | Christof Lding, Alex Spelten |
| 2006 | FOSSACS | Propositional Dynamic Logic with Recursive Programs. | Christof Lding, Olivier Serre |
| 2006 | STACS | Regularity Problems for Visibly Pushdown Languages. | Vince Brny, Christof Lding, Olivier Serre |
| 2005 | FCT | Deterministic Automata on Unranked Trees. | Julien Cristau, Christof Lding, Wolfgang Thomas |
| 2004 | PODS | A Characterization of First-Order Topological Properties of Planar Spatial Data. | Michael Benedikt, Christof Lding, Jan Van den Bussche, Thomas Wilke |
| 2004 | STACS | On the Expressiveness of Deterministic Transducers over Infinite Trees. | Thomas Colcombet, Christof Lding |
| 2003 | MFCS | Solving the Sabotage Game Is PSPACE-Hard. | Christof Lding, Philipp Rohde |
| 2002 | FOSSACS | Model-Checking Infinite Systems Generated by Ground Tree Rewriting. | Christof Lding |
| 2002 | STACS | Ground Tree Rewriting Graphs of Bounded Tree Width. | Christof Lding |