| 2024 | MFCS | Logical Characterizations of Weighted Complexity Classes. | Guillermo Badia, Manfred Droste, Carles Noguera, Erik Paul |
| 2019 | MFCS | Aperiodic Weighted Automata and Weighted First-Order Logic. | Manfred Droste, Paul Gastin |
| 2018 | MFCS | A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. | Manfred Droste, Erik Paul |
| 2017 | MFCS | Weighted Operator Precedence Languages. | Manfred Droste, Stefan Dck, Dino Mandrioli, Matteo Pradella |
| 2016 | ICTAC | Weighted Register Automata and Weighted Logic on Data Words. | Parvaneh Babari, Manfred Droste, Vitaly Perevoshchikov |
| 2016 | LATA | A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. | Manfred Droste, Zoltn Flp, Doreen Gtze |
| 2016 | LATA | A Weighted MSO Logic with Storage Behaviour and Its Bchi-Elgot-Trakhtenbrot Theorem. | Heiko Vogler, Manfred Droste, Luisa Herrmann |
| 2015 | CSR | A Logical Characterization of Timed Pushdown Languages. | Manfred Droste, Vitaly Perevoshchikov |
| 2015 | LATA | A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic. | Parvaneh Babari, Manfred Droste |
| 2015 | MFCS | Weighted Automata and Logics on Graphs. | Manfred Droste, Stefan Dck |
| 2014 | ICALP | A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic. | Manfred Droste, Vitaly Perevoshchikov |
| 2014 | LATA | Weighted Automata and Logics for Infinite Nested Words. | Manfred Droste, Stefan Dck |
| 2013 | CSR | Multi-weighted Automata and MSO Logic. | Manfred Droste, Vitaly Perevoshchikov |
| 2013 | DLT | The Chomsky-Schtzenberger Theorem for Quantitative Context-Free Languages. | Manfred Droste, Heiko Vogler |
| 2011 | DLT | A Cascade Decomposition of Weighted Finite Transition Systems. | Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic |
| 2010 | DLT | Kleene and Bchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. | Manfred Droste, Heiko Vogler |
| 2010 | MFCS | Describing Average- and Longtime-Behavior by Weighted MSO Logics. | Manfred Droste, Ingmar Meinecke |
| 2008 | FOSSACS | A Kleene-Schtzenberger Theorem for Weighted Timed Automata. | Manfred Droste, Karin Quaas |
| 2007 | CALCO | Bifinite Chu Spaces. | Manfred Droste, Guo-Qiang Zhang |
| 2006 | DLT | Weighted Automata and Weighted Logics on Infinite Words. | Manfred Droste, George Rahonis |
| 2005 | ICALP | Weighted Automata and Weighted Logics. | Manfred Droste, Paul Gastin |
| 2003 | ICALP | Skew and Infinitary Formal Power Series. | Manfred Droste, Dietrich Kuske |
| 2001 | ICALP | Rational Transformations of Formal Power Series. | Manfred Droste, Guo-Qiang Zhang |
| 1999 | FCT | On Recognizable Languages in Divisibility Monoids. | Manfred Droste, Dietrich Kuske |
| 1997 | ICALP | On Recognizable and Rational Formal Power Series in Partially Commuting Variables. | Manfred Droste, Paul Gastin |
| 1996 | CONCUR | Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. | Manfred Droste, Paul Gastin |
| 1995 | CSL | Languages and Logical Definability in Concurrency Monoids. | Manfred Droste, Dietrich Kuske |
| 1995 | DLT | Trace Languages Definable with Modular Quantifiers. | Manfred Droste, Dietrich Kuske |
| 1995 | STACS | Dependence Orders for Computations of Concurrent Automata. | Felipe Bracho, Manfred Droste, Dietrich Kuske |
| 1994 | ICALP | A KLeene Theorem for Recognizable Languages over Concurrency Monoids. | Manfred Droste |
| 1993 | ICALP | From Domains to Automata with Concurrency. | Felipe Bracho, Manfred Droste |
| 1990 | ICALP | Concurrency, Automata and Domains. | Manfred Droste |
| 1990 | LICS | Universal Domains in the Theory of Denotational Semantics of Programming Languages | Manfred Droste, Rdiger Gbel |
| 1989 | CSL | Effectively Given Information Systems and Domains. | Manfred Droste, Rdiger Gbel |