| 2009 | ICALP | Faithful Loops for Aperiodic E-Ordered Monoids. | Martin Beaudry, Franois Lemieux |
| 2005 | ICALP | Groupoids That Recognize Only Regular Languages. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 2004 | MFCS | A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). | Martin Beaudry, Jos M. Fernandez, Markus Holzer |
| 2004 | STACS | Algebraic Results on Quantum Automata. | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thrien |
| 2001 | DLT | On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto |
| 2001 | MFCS | The Complexity of Tensor Circuit Evaluation. | Martin Beaudry, Markus Holzer |
| 2001 | STACS | Star-Free Open Languages and Aperiodic Loops. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 1997 | ICALP | Finite Loops Recognize Exactly the Regular Open Languages. | Martin Beaudry, Franois Lemieux, Denis Thrien |
| 1996 | STACS | Languages Recognized by Finite Aperiodic Groupoids. | Martin Beaudry |
| 1989 | STACS | Testing Membership: Beyond Permutation Groups (Extended Abstract). | Martin Beaudry, Pierre McKenzie, Denis Thrien |
| 1987 | ICALP | Testing Membership in Commutative Transformation Semigroups. | Martin Beaudry |