The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Denis Thérien: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien
    Circuits and Expressions with NOn-Associative Gates. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:193-203 [Conf]
  2. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
    Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:12-21 [Conf]
  3. Birgit Jenner, Pierre McKenzie, Denis Thérien
    Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:242-254 [Conf]
  4. Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
    Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:190-201 [Conf]
  5. Patricia Bouyer, Antoine Petit, Denis Thérien
    An Algebraic Characterization of Data and Timed Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:248-261 [Conf]
  6. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:196-210 [Conf]
  7. Clemens Lautemann, Thomas Schwentick, Denis Thérien
    Logics For Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:205-216 [Conf]
  8. Clemens Lautemann, Pascal Tesson, Denis Thérien
    An Algebraic Point of View on the Crane Beach Property. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:426-440 [Conf]
  9. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:89-101 [Conf]
  10. Thomas Schwentick, Denis Thérien, Heribert Vollmer
    Partially-Ordered Two-Way Automata: A New Characterization of DA. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:239-250 [Conf]
  11. Denis Thérien, Thomas Wilke
    Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:256-263 [Conf]
  12. Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
    Lower bounds for circuits with MOD_m gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:709-718 [Conf]
  13. Denis Thérien
    Regular Languages, Unambiguous Concatenation and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:49-57 [Conf]
  14. David A. Mix Barrington, Denis Thérien
    Non-Uniform Automata Over Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:163-173 [Conf]
  15. 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]
  16. 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]
  17. Arkadev Chattopadhyay, Denis Thérien
    Locally Commutative Categories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:984-995 [Conf]
  18. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The Many Faces of a Translation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:890-901 [Conf]
  19. Pierre McKenzie, Denis Thérien
    Automata Theory Meets Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:589-602 [Conf]
  20. Jean-François Raymond, Pascal Tesson, Denis Thérien
    An Algebraic Approach to Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:29-40 [Conf]
  21. Howard Straubing, Denis Thérien, Wolfgang Thomas
    regular Languages Defined with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:561-575 [Conf]
  22. Pascal Tesson, Denis Thérien
    Restricted Two-Variable Sentences, Circuits and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:526-538 [Conf]
  23. Denis Thérien
    Languages of Nilpotent and Solvable Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:616-632 [Conf]
  24. Howard Straubing, Denis Thérien
    Weakly Iterated Block Products of Finite Monoids. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:91-104 [Conf]
  25. Denis Thérien
    Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:498-502 [Conf]
  26. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
    The Crane Beach Conjecture. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:187-196 [Conf]
  27. Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
    Modular Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:344-351 [Conf]
  28. Howard Straubing, Denis Thérien
    Finite automata and computational complexity. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:199-233 [Conf]
  29. David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
    Equation Satisfiability and Program Satisfiability for Finite Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:172-181 [Conf]
  30. Cristopher Moore, Pascal Tesson, Denis Thérien
    Satisfiability of Systems of Equations over Finite Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:537-547 [Conf]
  31. 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]
  32. 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]
  33. 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]
  34. Ricard Gavaldà, Denis Thérien
    Learning Expressions over Monoids. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:283-293 [Conf]
  35. Ricard Gavaldà, Denis Thérien
    Algebraic Characterizations of Small Classes of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:331-342 [Conf]
  36. Alexis Maciel, Denis Thérien
    Threshold Circuits for Iterated Multiplication: Using AC0 for Free. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:545-565 [Conf]
  37. Jean-Eric Pin, Howard Straubing, Denis Thérien
    New Results on the Generalized Star-Height Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:458-467 [Conf]
  38. Howard Straubing, Denis Thérien
    Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:551-562 [Conf]
  39. Pascal Tesson, Denis Thérien
    Complete Classifications for the Communication Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:62-73 [Conf]
  40. Denis Thérien, Thomas Wilke
    Nesting Until and Since in Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:455-464 [Conf]
  41. Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
    Languages with Bounded Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:500-511 [Conf]
  42. David A. Mix Barrington, Denis Thérien
    Finite Monoids and the Fine Structure of NC¹ [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:101-109 [Conf]
  43. Michal Koucký, Pavel Pudlák, Denis Thérien
    Bounded-depth circuits: separating wires from gates. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:257-265 [Conf]
  44. Denis Thérien, Thomas Wilke
    Over Words, Two Variables Are as Powerful as One Quantifier Alternation. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:234-240 [Conf]
  45. Pierre McKenzie, Pierre Péladeau, Denis Thérien
    NC¹: The Automata-Theoretic Viewpoint. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:330-359 [Journal]
  46. Pierre McKenzie, Denis Thérien
    Special Issue on Circuit Complexity: Foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:297-300 [Journal]
  47. Denis Thérien
    Circuits Constructed with Mod_q Gates Cannot Compute "And" in Sublinear Size. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:383-388 [Journal]
  48. Pascal Tesson, Denis Thérien
    The Computing Power of Programs over Finite Monoids [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:5, pp:- [Journal]
  49. Pierre Péladeau, Denis Thérien
    On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents") [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:40, pp:- [Journal]
  50. Ondrej Klíma, Pascal Tesson, Denis Thérien
    Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:091, pp:- [Journal]
  51. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Tractable Clones of Polynomials over Semigroups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:059, pp:- [Journal]
  52. David A. Mix Barrington, Howard Straubing, Denis Thérien
    Non-Uniform Automata Over Groups [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:2, pp:109-132 [Journal]
  53. Patricia Bouyer, Antoine Petit, Denis Thérien
    An algebraic approach to data languages and timed languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:182, n:2, pp:137-162 [Journal]
  54. Birgit Jenner, Pierre McKenzie, Denis Thérien
    Logspace and Logtime Leaf Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:21-33 [Journal]
  55. Alexis Maciel, Denis Thérien
    Threshold Circuits of Small Majority-Depth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:146, n:1, pp:55-83 [Journal]
  56. Alexis Maciel, Denis Thérien
    Efficient Threshold Circuits for Power Series. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:152, n:1, pp:62-73 [Journal]
  57. Jean-Eric Pin, Howard Straubing, Denis Thérien
    Some Results on the Generalized Star-Height Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:2, pp:219-250 [Journal]
  58. Howard Straubing, Denis Thérien, Wolfgang Thomas
    Regular Languages Defined with Generalized Quanifiers [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:289-301 [Journal]
  59. Ricard Gavaldà, Pascal Tesson, Denis Thérien
    Learning expressions and programs over monoids. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:2, pp:177-209 [Journal]
  60. Pascal Tesson, Denis Thérien
    Monoids and Computations. [Citation Graph (0, 0)][DBLP]
    IJAC, 2004, v:14, n:5-6, pp:801-816 [Journal]
  61. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The dot-depth and the polynomial hierarchies correspond on the delta levels. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:625-644 [Journal]
  62. Mikael Goldmann, Alexander Russell, Denis Thérien
    An ergodic theorem for read-once non-uniform deterministic finite automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:23-28 [Journal]
  63. Denis Thérien
    Categories Et Langages De Dot-Depth Un. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:4, pp:437-445 [Journal]
  64. Alex Weiss, Denis Thérien
    Varieties of Finite Categories. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:3, pp:357-366 [Journal]
  65. David A. Mix Barrington, Denis Thérien
    Finite monoids and the fine structure of NC1. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:941-952 [Journal]
  66. 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]
  67. Pascal Tesson, Denis Thérien
    The Computing Power of Programs over Finite Monoids. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:247-258 [Journal]
  68. David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
    Regular Languages in NC¹. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:3, pp:478-499 [Journal]
  69. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
    First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:101-127 [Journal]
  70. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
    Nondeterministic NC1 Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:200-212 [Journal]
  71. Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko
    Circuits and Expressions with Nonassociative Gates. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:368-394 [Journal]
  72. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The many faces of a translation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:163-179 [Journal]
  73. 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]
  74. Howard Straubing, Denis Thérien
    Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:1, pp:29-69 [Journal]
  75. Pascal Tesson, Denis Thérien
    Complete Classifications for the Communication Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:2, pp:135-159 [Journal]
  76. Denis Thérien, Thomas Wilke
    Nesting Until and Since in Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:111-131 [Journal]
  77. 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]
  78. Denis Thérien, Thomas Wilke
    Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:777-798 [Journal]
  79. Alexis Maciel, Pierre Péladeau, Denis Thérien
    Programs over semigroups of dot-depth one. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:1, pp:135-148 [Journal]
  80. Pierre Péladeau, Howard Straubing, Denis Thérien
    Finite Semigroup Varieties Defined by Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:325-339 [Journal]
  81. Denis Thérien
    Classification of Finite Monoids: The Language Approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:195-208 [Journal]
  82. Denis Thérien
    Programs over Aperiodic Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:271-280 [Journal]
  83. Pascal Tesson, Denis Thérien
    Logic Meets Algebra: the Case of Regular Languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  84. Howard Straubing, Denis Thérien
    A Note on MODp - MODm Circuits. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:699-706 [Journal]
  85. Ondrej Klíma, Pascal Tesson, Denis Thérien
    Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:3, pp:263-297 [Journal]

  86. An Algebraic Perspective on Boolean Function Learning. [Citation Graph (, )][DBLP]


  87. 06451 Executive Summary -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  88. 06451 Abstracts Collection -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  89. Languages with Bounded Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


Search in 0.121secs, Finished in 0.127secs
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