| 2026 | LICS | A Unified Treatment of the Substitution Tensor for Presheaves, Nominal Sets, Renaming Sets, and so on. | Fabian Lenke, Stefan Milius, Henning Urbat |
| 2026 | STACS | Demystifying Codensity Monads via Duality. | Fabian Lenke, Nico Wittrock, Stefan Milius, Henning Urbat |
| 2025 | CALCO | Terminal Coalgebras for Finitary Functors. | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2025 | ICALP | Algebraic Language Theory with Effects. | Fabian Lenke, Stefan Milius, Henning Urbat, Thorsten Wimann |
| 2025 | LICS | Alternating Nominal Automata with Name Allocation. | Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schrder, Henning Urbat |
| 2024 | FOSSACS | Monoidal Extended Stone Duality. | Fabian Birkmann, Henning Urbat, Stefan Milius |
| 2024 | LICS | Bialgebraic Reasoning on Higher-order Program Equivalence. | Sergey Goncharov, Stefan Milius, Stelios Tsampas, Henning Urbat |
| 2024 | LICS | Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. | Thorsten Wimann, Stefan Milius |
| 2023 | CALCO | Higher-Order Mathematical Operational Semantics (Early Ideas). | Sergey Goncharov, Stefan Milius, Lutz Schrder, Stelios Tsampas, Henning Urbat |
| 2023 | CALCO | On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2023 | ICALP | Nominal Topology for Data Languages. | Fabian Birkmann, Stefan Milius, Henning Urbat |
| 2023 | LICS | Weak Similarity in Higher-Order Mathematical Operational Semantics. | Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schrder |
| 2023 | MFCS | Positive Data Languages. | Florian Frank, Stefan Milius, Henning Urbat |
| 2022 | FSCD | Stateful Structural Operational Semantics. | Sergey Goncharov, Stefan Milius, Lutz Schrder, Stelios Tsampas, Henning Urbat |
| 2022 | LICS | Graded Monads and Behavioural Equivalence Games. | Chase Ford, Stefan Milius, Lutz Schrder, Harsh Beohar, Barbara Knig |
| 2022 | TACAS | Distributed Coalgebraic Partition Refinement. | Fabian Birkmann, Hans-Peter Deifel, Stefan Milius |
| 2021 | CALCO | Initial Algebras Without Iteration ((Co)algebraic pearls). | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2021 | CALCO | Monads on Categories of Relational Structures. | Chase Ford, Stefan Milius, Lutz Schrder |
| 2021 | CONCUR | Nominal Bchi Automata with Name Allocation. | Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schrder |
| 2021 | CONCUR | Explaining Behavioural Inequivalence Generically in Quasilinear Time. | Thorsten Wimann, Stefan Milius, Lutz Schrder |
| 2021 | FOSSACS | Nondeterministic Syntactic Complexity. | Robert S. R. Myers, Stefan Milius, Henning Urbat |
| 2021 | FSCD | Coalgebra Encoding for Efficient Minimization. | Hans-Peter Deifel, Stefan Milius, Thorsten Wimann |
| 2021 | LATA | On Language Varieties Without Boolean Operations. | Fabian Birkmann, Stefan Milius, Henning Urbat |
| 2021 | LICS | Behavioural Preorders via Graded Monads. | Chase Ford, Stefan Milius, Lutz Schrder |
| 2021 | MFCS | A Linear-Time Nominal μ-Calculus with Name Allocation. | Daniel Hausmann, Stefan Milius, Lutz Schrder |
| 2020 | FOSSACS | On Well-Founded and Recursive Coalgebras. | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2019 | CALCO | From Equational Specifications of Algebras with Structure to Varieties of Data Languages (Invited Paper). | Stefan Milius |
| 2019 | CONCUR | Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. | Ulrich Dorsch, Stefan Milius, Lutz Schrder |
| 2019 | FM | Generic Partition Refinement and Weighted Tree Automata. | Hans-Peter Deifel, Stefan Milius, Lutz Schrder, Thorsten Wimann |
| 2019 | FOSSACS | Equational Axiomatization of Algebras with Structure. | Stefan Milius, Henning Urbat |
| 2019 | ICALP | Varieties of Data Languages. | Henning Urbat, Stefan Milius |
| 2017 | CALCO | On Corecursive Algebras for Functors Preserving Coproducts. | Jir Admek, Stefan Milius |
| 2017 | CALCO | Proper Functors and their Rational Fixed Point. | Stefan Milius |
| 2017 | CONCUR | Efficient Coalgebraic Partition Refinement. | Ulrich Dorsch, Stefan Milius, Lutz Schrder, Thorsten Wimann |
| 2017 | FMCAD | Automatic verification of application-tailored OSEK kernels. | Hans-Peter Deifel, Merlin Gttlinger, Stefan Milius, Lutz Schrder, Christian Dietrich, Daniel Lohmann |
| 2017 | FOSSACS | Nominal Automata with Name Binding. | Lutz Schrder, Dexter Kozen, Stefan Milius, Thorsten Wimann |
| 2017 | MFCS | Eilenberg Theorems for Free. | Henning Urbat, Jir Admek, Liang-Ting Chen, Stefan Milius |
| 2016 | FOSSACS | Profinite Monads, Profinite Equations, and Reiterman's Theorem. | Liang-Ting Chen, Jir Admek, Stefan Milius, Henning Urbat |
| 2016 | FOSSACS | A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. | Stefan Milius, Dirk Pattinson, Thorsten Wimann |
| 2016 | ICISS | An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms. | Kristof Teichel, Dieter Sibold, Stefan Milius |
| 2015 | CALCO | Syntactic Monoids in a Category. | Jir Admek, Stefan Milius, Henning Urbat |
| 2015 | CALCO | Generic Trace Semantics and Graded Monads. | Stefan Milius, Dirk Pattinson, Lutz Schrder |
| 2015 | CALCO | Finitary Corecursion for the Infinitary Lambda Calculus. | Stefan Milius, Thorsten Wimann |
| 2015 | LICS | Varieties of Languages in a Category. | Jir Admek, Robert S. R. Myers, Henning Urbat, Stefan Milius |
| 2014 | FMICS | An Open Alternative for SMT-Based Verification of Scade Models. | Henning Basold, Henning Gnther, Michaela Huhn, Stefan Milius |
| 2014 | FOSSACS | Generalized Eilenberg Theorem I: Local Varieties of Languages. | Jir Admek, Stefan Milius, Robert S. R. Myers, Henning Urbat |
| 2012 | FOSSACS | A Coalgebraic Perspective on Minimization and Determinization. | Jir Admek, Filippo Bonchi, Mathias Hlsbusch, Barbara Knig, Stefan Milius, Alexandra Silva |
| 2012 | FOSSACS | Well-Pointed Coalgebras (Extended Abstract). | Jir Admek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa |
| 2012 | LICS | Coproducts of Monads on Set. | Jir Admek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy |
| 2012 | SAFECOMP | On the Formal Verification of Systems of Synchronous Software Components. | Henning Gnther, Stefan Milius, Oliver Mller |
| 2011 | CALCO | From Corecursive Algebras to Corecursive Monads. | Jir Admek, Mahdieh Haddadi, Stefan Milius |
| 2011 | CSL | Power-Set Functors and Saturated Trees. | Jir Admek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa |
| 2011 | FMICS | Formal Safety Analysis in Industrial Practice. | Ilyas Daskaya, Michaela Huhn, Stefan Milius |
| 2010 | FOSSACS | CIA Structures and the Semantics of Recursion. | Stefan Milius, Lawrence S. Moss, Daniel Schwencke |
| 2010 | LICS | A Sound and Complete Calculus for Finite Stream Circuits. | Stefan Milius |
| 2009 | CALCO | Semantics of Higher-Order Recursion Schemes. | Jir Admek, Stefan Milius, Jir Velebil |
| 2009 | CALCO | Complete Iterativity for Algebras with Effects. | Stefan Milius, Thorsten Palm, Daniel Schwencke |
| 2009 | FOSSACS | A Description of Iterative Reflections of Monads (Extended Abstract). | Jir Admek, Stefan Milius, Jir Velebil |
| 2007 | MFCS | What Are Iteration Theories? | Jir Admek, Stefan Milius, Jir Velebil |
| 2005 | CALCO | The Category Theoretic Solution of Recursive Program Schemes. | Stefan Milius, Lawrence S. Moss |