| 2011 | CSR | Learning Read-Constant Polynomials of Constant Degree Modulo Composites. | Arkadev Chattopadhyay, Ricard Gavald, Kristoffer Arnsfelt Hansen, Denis Thrien |
| 2009 | ALT | An Algebraic Perspective on Boolean Function Learning. | Ricard Gavald, Denis Thrien |
| 2007 | STACS | Languages with Bounded Multiparty Communication Complexity. | Arkadev Chattopadhyay, Andreas Krebs, Michal Kouck, Mario Szegedy, Pascal Tesson, Denis Thrien |
| 2006 | CSL | An Algebraic Point of View on the Crane Beach Property. | Clemens Lautemann, Pascal Tesson, Denis Thrien |
| 2006 | FOCS | Lower bounds for circuits with MOD_m gates. | Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlk, Denis Thrien |
| 2005 | CP | Tractable Clones of Polynomials over Semigroups. | Vctor Dalmau, Ricard Gavald, Pascal Tesson, Denis Thrien |
| 2005 | ICALP | Groupoids That Recognize Only Regular Languages. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 2005 | ICALP | Restricted Two-Variable Sentences, Circuits and Communication Complexity. | Pascal Tesson, Denis Thrien |
| 2005 | STOC | Bounded-depth circuits: separating wires from gates. | Michal Kouck, Pavel Pudlk, Denis Thrien |
| 2004 | DLT | The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. | Bernd Borchert, Klaus-Jrn Lange, Frank Stephan, Pascal Tesson, Denis Thrien |
| 2004 | STACS | Algebraic Results on Quantum Automata. | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thrien |
| 2003 | ICALP | Locally Commutative Categories. | Arkadev Chattopadhyay, Denis Thrien |
| 2003 | STACS | Algebraic Characterizations of Small Classes of Boolean Functions. | Ricard Gavald, Denis Thrien |
| 2003 | STACS | Complete Classifications for the Communication Complexity of Regular Languages. | Pascal Tesson, Denis Thrien |
| 2002 | LATIN | Weakly Iterated Block Products of Finite Monoids. | Howard Straubing, Denis Thrien |
| 2002 | STACS | Nesting Until and Since in Linear Temporal Logic. | Denis Thrien, Thomas Wilke |
| 2001 | CONCUR | An Algebraic Characterization of Data and Timed Languages. | Patricia Bouyer, Antoine Petit, Denis Thrien |
| 2001 | DLT | Partially-Ordered Two-Way Automata: A New Characterization of DA. | Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2001 | LICS | The Crane Beach Conjecture. | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thrien |
| 2001 | MFCS | Satisfiability of Systems of Equations over Finite Monoids. | Cristopher Moore, Pascal Tesson, Denis Thrien |
| 2001 | STACS | Star-Free Open Languages and Aperiodic Loops. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 2001 | STACS | Learning Expressions over Monoids. | Ricard Gavald, Denis Thrien |
| 2001 | STACS | Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. | Howard Straubing, Denis Thrien |
| 2000 | ICALP | The Many Faces of a Translation. | Pierre McKenzie, Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2000 | MFCS | Equation Satisfiability and Program Satisfiability for Finite Monoids. | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thrien |
| 1999 | LICS | Modular Temporal Logic. | Augustin Baziramwabo, Pierre McKenzie, Denis Thrien |
| 1998 | ICALP | An Algebraic Approach to Communication Complexity. | Jean-Franois Raymond, Pascal Tesson, Denis Thrien |
| 1998 | STOC | Over Words, Two Variables Are as Powerful as One Quantifier Alternation. | Denis Thrien, Thomas Wilke |
| 1997 | ICALP | Finite Loops Recognize Exactly the Regular Open Languages. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 1996 | FOCS | Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. | Denis Thrien, Thomas Wilke |
| 1994 | CSL | Logics For Context-Free Languages. | Clemens Lautemann, Thomas Schwentick, Denis Thrien |
| 1993 | STACS | Threshold Circuits for Iterated Multiplication: Using AC0 for Free. | Alexis Maciel, Denis Thrien |
| 1992 | LATIN | Circuits Constructed with | Denis Thrien |
| 1989 | ICALP | Automata Theory Meets Circuit Complexity. | Pierre McKenzie, Denis Thrien |
| 1989 | STACS | Testing Membership: Beyond Permutation Groups (Extended Abstract). | Martin Beaudry, Pierre McKenzie, Denis Thrien |
| 1989 | STACS | New Results on the Generalized Star-Height Problem. | Jean-Eric Pin, Howard Straubing, Denis Thrien |
| 1988 | ICALP | regular Languages Defined with Generalized Quantifiers. | Howard Straubing, Denis Thrien, Wolfgang Thomas |
| 1987 | ICALP | Non-Uniform Automata Over Groups. | David A. Mix Barrington, Denis Thrien |
| 1987 | STOC | Finite Monoids and the Fine Structure of NC¹ | David A. Mix Barrington, Denis Thrien |
| 1979 | ICALP | Languages of Nilpotent and Solvable Groups (Extended Abstract). | Denis Thrien |