- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j12 |      | Martin Beaudry, Markus Holzer: On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412(8-10): 765-772 (2011) |
| 2009 | ||
| c12 | | Martin Beaudry, François Lemieux: Faithful Loops for Aperiodic E-Ordered Monoids. ICALP (2) 2009: 55-66 |
| 2007 | ||
| j11 | | Martin Beaudry, Markus Holzer: The Complexity of Tensor Circuit Evaluation. Computational Complexity 16(1): 60-111 (2007) |
| 2006 | ||
| j10 | | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien: Algebraic Results on Quantum Automata. Theory Comput. Syst. 39(1): 165-188 (2006) |
| 2005 | ||
| j9 | | Martin Beaudry, José M. Fernandez, Markus Holzer: A common algebraic description for probabilistic and quantum computations, . Theor. Comput. Sci. 345(2-3): 206-234 (2005) |
| c11 | | Martin Beaudry, François Lemieux, Denis Thérien: Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433 |
| 2004 | ||
| c10 | | Martin Beaudry, José M. Fernandez, Markus Holzer: A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS 2004: 851-862 |
| c9 | | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien: Algebraic Results on Quantum Automata. STACS 2004: 93-104 |
| 2003 | ||
| j8 | | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto: McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003) |
| 2001 | ||
| c8 | | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto: On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. Developments in Language Theory 2001: 340-348 |
| c7 | | |
| c6 | | Martin Beaudry, François Lemieux, Denis Thérien: Star-Free Open Languages and Aperiodic Loops. STACS 2001: 87-98 |
| 1998 | ||
| j7 | | Martin Beaudry: Languages Recognized by Finite Aperiodic Groupoids. Theor. Comput. Sci. 209(1-2): 299-317 (1998) |
| 1997 | ||
| j6 | | Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien: Finite Moniods: From Word to Circuit Evaluation. SIAM J. Comput. 26(1): 138-152 (1997) |
| c5 | | Martin Beaudry, François Lemieux, Denis Thérien: Finite Loops Recognize Exactly the Regular Open Languages. ICALP 1997: 110-120 |
| 1996 | ||
| c4 | | |
| 1995 | ||
| j5 | | Martin Beaudry, Pierre McKenzie: Circuits, Matrices, and Nonassociative Computation. J. Comput. Syst. Sci. 50(3): 441-455 (1995) |
| 1994 | ||
| j4 | | Martin Beaudry: Membership Testing in Threshold One Transformation Monoids. Inf. Comput. 113(1): 1-25 (1994) |
| 1992 | ||
| j3 | | Martin Beaudry, Pierre McKenzie, Denis Thérien: The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992) |
| c3 | | Martin Beaudry, Pierre McKenzie: Cicuits, Matrices, and Nonassociative Computation. Structure in Complexity Theory Conference 1992: 94-106 |
| 1989 | ||
| j2 | | Martin Beaudry: Characterization of Idempotent Transformation Monoids. Inf. Process. Lett. 31(3): 163-166 (1989) |
| c2 | | Martin Beaudry, Pierre McKenzie, Denis Thérien: Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399 |
| 1988 | ||
| j1 | | Martin Beaudry: Membership Testing in Commutative Transformation Semigroups. Inf. Comput. 79(1): 84-93 (1988) |
| 1987 | ||
| c1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page