Aller au contenu

Martin Beaudry

Professeur associé, Faculté des sciences

FAC. SCIENCES Informatique

Présentation

Sujet de recherche

Complexité (Informatique), Théorie du calcul

Disciplines de recherche

Informatique, Mathématiques fondamentales

Mots-clés

Informatique théorique

Langues parlées et écrites

Allemand, Anglais, Français

Diplômes

(1988). Membership testing in transformation monoids (Doctorat, Ph. D.). McGill University.

(1982). (, Maîtrise - Maîtrise). University of British Columbia.

(1979). (Baccalauréat, Baccalauréat). Université de Montréal.

Publications

Articles de revue

  • Beaudry M, Fernandez J.M, Holzer M. A common algebraic description for probabilistic and quantum computations. Theoretical Computer Science 345 206-234. (Article publié).
  • Ambainis A, Beaudry M, Golovkins M, Kikusts A, Mercer M, Thérien D. Algebraic results on quantum automata. Theory of Computing Systems 39 165-188. (Article publié).
  • Beaudry M. Characterisation of idempotent transformation monoids. Information and Processing Letters 31 163-166. (Article publié).
  • Beaudry M, McKenzie P. Circuits, Matrices and Nonassociative Computation. J. Computer and Systems Science 50 441-455. (Article publié).
  • Beaudry M, Marchand L. Commutative subloop-free loops. Comment. Math. Univ. Carolin. 52 473-484. (Article publié).
  • Beaudry M. Finite idempotent groupoids and regular languages. RAIRO Informatique théorique 32 127-140. (Article publié).
  • Beaudry M, McKenzie P, Péladeau P, Thérien D. Finite monoids: from word to circuit evaluation. SIAM J. Computing 26 138-152. (Article publié).
  • Beaudry M. Languages recognized by finite aperiodic groupoids. Theoretical Computer Science 209 299-317. (Article publié).
  • Beaudry M, Holzer M, Niemann G, Otto F. McNaughton families of languages. Theoretical Computer Science 290 347-394. (Article publié).
  • Beaudry M. Membership testing in commutative transformation semigroups. Information and Computation 79 84-93. (Article publié).
  • Beaudry M. Membership testing in threshold one transformation monoids. Information and Computation 113 1-25. (Article publié).
  • Beaudry M, Holzer M. On the size of inverse semigroups given by generators. Theoretical Computer Science 412 765-772. (Article publié).
  • Beaudry M, McKenzie P, Thérien D. The Membership Problem in Apediodic Transformation Monoids. Journal of the ACM 39 599-616. (Article publié).
  • Beaudry M, Holzer M. The complexity of tensor circuit evaluation. Computational Complexity 16 60-111. (Article publié).

Articles de conférence

  • Beaudry M, Fernandez J.M, Holzer M. A common algebraic description for probabilistic and quantum computations. MFCS 2004. 851-862. (Article publié).
  • Ambainis A, Beaudry M, Golovkins M, Kikusts A, Mercer M, Thérien D. Algebraic results on quantum automata. 21st. STACS. 93-104. (Article publié).
  • Beaudry M, McKenzie P. Circuits, Matrices, and Nonassociative Computation. Seventh Annual Structure in Complexity Theory Conference. 94-106. (Article publié).
  • Beaudry M, McKenzie P, Péladeau P. Circuits with monoidal gates. 10th STACS. 555-565. (Article publié).
  • Beaudry M, Lemieux F. Faithful loops for aperiodic E-ordered monoids. 36th ICALP. (Article publié).
  • Beaudry M, Lemieux F, Thérien D. Finite loops recognize exactly the regular open languages. 24th ICALP. 110-120. (Article publié).
  • Beaudry M, Lemieux F, Thérien D. Groupoids that recognize only regular languages. 32th ICALP. 421-433. (Article publié).
  • Beaudry M. Languages recognized by aperiodic groupoids. 13th. STACS. 113-124. (Article publié).
  • Beaudry M, Holzer M, Niemann G, Otto F. On the relationship between the McNaughton families of languages and the Chomsky hierarchy. Developments in Language Theory, DLT 2001. 340-348. (Article publié).
  • Beaudry M, Lemieux F, Thérien D. Star-free open languages and aperiodic loops. 18th STACS. 87-98. (Article publié).
  • Beaudry M, McKenzie P, Thérien D. Testing membership: beyond permutation groups. 6th STACS. 388-399. (Article publié).
  • Beaudry M. Testing membership in commutative transformation semigroups. 24th. ICALP. 542-549. (Article publié).
  • Beaudry M, Holzer M. The complexity of tensor circuit evaluation. MFCS 2001. 173-185. (Article publié).