| 2026 | FOSSACS | Varieties of Quantitative Algebras Presented by 1-Basic Monads. | Jir Admek |
| 2025 | CALCO | Terminal Coalgebras for Finitary Functors. | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2023 | CALCO | Strongly Finitary Monads for Varieties of Quantitative Algebras. | Jir Admek, Matej Dostl, Jir Velebil |
| 2023 | CALCO | On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2022 | LICS | Varieties of Quantitative Algebras and Their Monads. | Jir Admek |
| 2021 | CALCO | Initial Algebras Without Iteration ((Co)algebraic pearls). | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2021 | CALCO | Which Categories Are Varieties? ((Co)algebraic pearls). | Jir Admek, Jir Rosick |
| 2020 | CSL | On Free Completely Iterative Algebras. | Jir Admek |
| 2020 | FOSSACS | On Well-Founded and Recursive Coalgebras. | Jir Admek, Stefan Milius, Lawrence S. Moss |
| 2019 | CALCO | On Terminal Coalgebras Derived from Initial Algebras. | Jir Admek |
| 2017 | CALCO | On Corecursive Algebras for Functors Preserving Coproducts. | Jir Admek, Stefan Milius |
| 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 |
| 2015 | CALCO | Syntactic Monoids in a Category. | Jir Admek, Stefan Milius, Henning Urbat |
| 2015 | LICS | Varieties of Languages in a Category. | Jir Admek, Robert S. R. Myers, Henning Urbat, 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 |
| 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 |
| 2009 | CALCO | Semantics of Higher-Order Recursion Schemes. | Jir Admek, Stefan Milius, Jir Velebil |
| 2009 | FOSSACS | A Description of Iterative Reflections of Monads (Extended Abstract). | Jir Admek, Stefan Milius, Jir Velebil |
| 2008 | ICSE | Perspectives in component-based software engineering. | Jir Admek, Petr Hnetynka |
| 2008 | SEAA | Checking Session-Oriented Interactions between Web Services. | Pavel Parzek, Jir Admek |
| 2007 | MFCS | What Are Iteration Theories? | Jir Admek, Stefan Milius, Jir Velebil |
| 2006 | SNPD | Addressing Unbounded Parallelism in Verification of Software Components. | Jir Admek |
| 2005 | CALCO | Algebra 'cap' Coalgebra = Presheaves. | Jir Admek |
| 2005 | CSL | A Logic of Coequations. | Jir Admek |
| 2004 | APSEC | Partial Bindings of Components - Any Harm?. | Jir Admek, Frantisek Plsil |
| 2003 | OOPSLA | Static analysis of component systems using behavior protocols. | Jir Admek |
| 1985 | MFPS | Cartesian Closed Categories, Quasitopoi and Topological Universes. | Jir Admek, Horst Herrlich |
| 1981 | FCT | Observability and Nerode Equivalence in Concrete C5ategories. | Jir Admek |
| 1979 | FCT | Tree-group automata. | Vera Trnkov, Jir Admek |
| 1977 | FCT | Remarks on Fixed Points of Functors. | Jir Admek, Vclav Koubek |
| 1977 | FCT | Recognizable and Regular Languages in a Category. | Jir Admek, Vera Trnkov |
| 1977 | MFCS | On Languages, Accepted by Machines in the Category of Sets. | Vera Trnkov, Jir Admek |
| 1975 | MFCS | Automata and Categories: Finiteness Contra Minimality. | Jir Admek |