Martin Beaudry

	2009
24		Martin Beaudry, François Lemieux: Faithful Loops for Aperiodic E-Ordered Monoids. ICALP (2) 2009: 55-66
	2007
23		Martin Beaudry, Markus Holzer: The Complexity of Tensor Circuit Evaluation. Computational Complexity 16(1): 60-111 (2007)
	2006
22		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
21		Martin Beaudry, François Lemieux, Denis Thérien: Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433
20		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)
	2004
19		Martin Beaudry, José M. Fernandez, Markus Holzer: A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS 2004: 851-862
18		Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien: Algebraic Results on Quantum Automata. STACS 2004: 93-104
	2003
17		Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto: McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003)
	2001
16		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
15		Martin Beaudry, Markus Holzer: The Complexity of Tensor Circuit Evaluation. MFCS 2001: 173-185
14		Martin Beaudry, François Lemieux, Denis Thérien: Star-Free Open Languages and Aperiodic Loops. STACS 2001: 87-98
	1998
13		Martin Beaudry: Languages Recognized by Finite Aperiodic Groupoids. Theor. Comput. Sci. 209(1-2): 299-317 (1998)
	1997
12		Martin Beaudry, François Lemieux, Denis Thérien: Finite Loops Recognize Exactly the Regular Open Languages. ICALP 1997: 110-120
11		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)
	1996
10		Martin Beaudry: Languages Recognized by Finite Aperiodic Groupoids. STACS 1996: 113-124
	1995
9		Martin Beaudry, Pierre McKenzie: Circuits, Matrices, and Nonassociative Computation. J. Comput. Syst. Sci. 50(3): 441-455 (1995)
	1994
8		Martin Beaudry: Membership Testing in Threshold One Transformation Monoids Inf. Comput. 113(1): 1-25 (1994)
	1992
7		Martin Beaudry, Pierre McKenzie: Cicuits, Matrices, and Nonassociative Computation. Structure in Complexity Theory Conference 1992: 94-106
6		Martin Beaudry, Pierre McKenzie, Denis Thérien: The Membership Problem in Aperiodic Transformation Monoids. J. ACM 39(3): 599-616 (1992)
	1989
5		Martin Beaudry, Pierre McKenzie, Denis Thérien: Testing Membership: Beyond Permutation Groups (Extended Abstract). STACS 1989: 388-399
4		Martin Beaudry: Characterization of Idempotent Transformation Monoids. Inf. Process. Lett. 31(3): 163-166 (1989)
3		Martin Beaudry: Characterization of idempotent transformation monoids. Inf. Process. Lett. 32(3): 163-166 (1989)
	1988
2		Martin Beaudry: Membership Testing in Commutative Transformation Semigroups Inf. Comput. 79(1): 84-93 (1988)
	1987
1		Martin Beaudry: Testing Membership in Commutative Transformation Semigroups. ICALP 1987: 542-549

Coauthor Index

1	Andris Ambainis	[18] [22]
2	José M. Fernandez	[19] [20]
3	Marats Golovkins	[18] [22]
4	Markus Holzer	[15] [16] [17] [19] [20] [23]
5	Arnolds Kikusts	[18] [22]
6	François Lemieux	[12] [14] [21] [24]
7	Pierre McKenzie	[5] [6] [7] [9] [11]
8	Mark Mercer	[18] [22]
9	Gundula Niemann	[16] [17]
10	Friedrich Otto	[16] [17]
11	Pierre Péladeau	[11]
12	Denis Thérien	[5] [6] [11] [12] [14] [18] [21] [22]