The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Beaudry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Beaudry, Pierre McKenzie
    Cicuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:94-106 [Conf]
  2. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:340-348 [Conf]
  3. Martin Beaudry
    Testing Membership in Commutative Transformation Semigroups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:542-549 [Conf]
  4. Martin Beaudry, François Lemieux, Denis Thérien
    Groupoids That Recognize Only Regular Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:421-433 [Conf]
  5. Martin Beaudry, François Lemieux, Denis Thérien
    Finite Loops Recognize Exactly the Regular Open Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:110-120 [Conf]
  6. Martin Beaudry, José M. Fernandez, Markus Holzer
    A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:851-862 [Conf]
  7. Martin Beaudry, Markus Holzer
    The Complexity of Tensor Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:173-185 [Conf]
  8. Martin Beaudry
    Languages Recognized by Finite Aperiodic Groupoids. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:113-124 [Conf]
  9. Martin Beaudry, François Lemieux, Denis Thérien
    Star-Free Open Languages and Aperiodic Loops. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:87-98 [Conf]
  10. Martin Beaudry, Pierre McKenzie, Denis Thérien
    Testing Membership: Beyond Permutation Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:388-399 [Conf]
  11. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
    Algebraic Results on Quantum Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:93-104 [Conf]
  12. Martin Beaudry
    Membership Testing in Commutative Transformation Semigroups [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:79, n:1, pp:84-93 [Journal]
  13. Martin Beaudry
    Membership Testing in Threshold One Transformation Monoids [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:113, n:1, pp:1-25 [Journal]
  14. Martin Beaudry
    Characterization of Idempotent Transformation Monoids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:3, pp:163-166 [Journal]
  15. Martin Beaudry
    Characterization of idempotent transformation monoids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:3, pp:163-166 [Journal]
  16. Martin Beaudry, Pierre McKenzie, Denis Thérien
    The Membership Problem in Aperiodic Transformation Monoids. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:599-616 [Journal]
  17. Martin Beaudry, Pierre McKenzie
    Circuits, Matrices, and Nonassociative Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:441-455 [Journal]
  18. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
    Algebraic Results on Quantum Automata. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:165-188 [Journal]
  19. Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
    Finite Moniods: From Word to Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:138-152 [Journal]
  20. Martin Beaudry
    Languages Recognized by Finite Aperiodic Groupoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:299-317 [Journal]
  21. Martin Beaudry, José M. Fernandez, Markus Holzer
    A common algebraic description for probabilistic and quantum computations, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:206-234 [Journal]
  22. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    McNaughton families of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1581-1628 [Journal]
  23. Martin Beaudry, Markus Holzer
    The Complexity of Tensor Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:1, pp:60-111 [Journal]

  24. Faithful Loops for Aperiodic E-Ordered Monoids. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002