Denis Therien - Publications

McGill University, Montreal, QC, Canada 
Computer Science

41 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2014 Chattopadhyay A, Gavaldà R, Hansen KA, Thérien D. Learning Read-Constant Polynomials of Constant Degree Modulo Composites Theory of Computing Systems. 55: 404-420. DOI: 10.1007/S00224-013-9488-6  0.394
2010 Straubing H, Tesson P, ThÉrien D. Weakly iterated block products and applications to logic and complexity International Journal of Algebra and Computation. 20: 319-341. DOI: 10.1142/S0218196710005686  0.724
2007 Tesson P, Thérien D. Logic Meets Algebra: the Case of Regular Languages Logical Methods in Computer Science. 3. DOI: 10.2168/Lmcs-3(1:4)2007  0.51
2007 Klíma O, Tesson P, Thérien D. Dichotomies in the complexity of solving systems of equations over finite semigroups Theory of Computing Systems. 40: 263-297. DOI: 10.1007/S00224-005-1279-2  0.673
2006 McKenzie P, Schwentick T, Thérien D, Vollmer H. The many faces of a translation Journal of Computer and System Sciences. 72: 163-179. DOI: 10.1016/J.Jcss.2005.08.003  0.303
2006 Gavaldà R, Tesson P, Thérien D. Learning expressions and programs over monoids Information and Computation. 204: 177-209. DOI: 10.1016/J.Ic.2005.09.003  0.683
2006 Ambainis A, Beaudry M, Golovkins M, Kikusts A, Mercer M, Therien D. Algebraic results on quantum automata Theory of Computing Systems. 39: 165-188. DOI: 10.1007/S00224-005-1263-X  0.41
2005 Borchert B, Lange KJ, Stephan F, Tesson P, Thérien D. The dot-depth and the polynomial hierarchies correspond on the delta levels International Journal of Foundations of Computer Science. 16: 625-644. DOI: 10.1142/S0129054105003200  0.688
2005 Barrington DAM, Immerman N, Lautemann C, Schweikardt N, Thérien D. First-order expressibility of languages with neutral letters or: The Crane Beach conjecture Journal of Computer and System Sciences. 70: 101-127. DOI: 10.1016/J.Jcss.2004.07.004  0.471
2005 Tesson P, Thérien D. Complete classifications for the communication complexity of regular languages Theory of Computing Systems. 38: 135-159. DOI: 10.1007/S00224-004-1190-2  0.704
2004 Tesson P, Thérien D. Monoids And Computations International Journal of Algebra and Computation. 14: 801-816. DOI: 10.1142/S0218196704001979  0.694
2004 Thérien D, Wilke T. Nesting Until and Since in Linear Temporal Logic Theory of Computing Systems \/ Mathematical Systems Theory. 37: 111-131. DOI: 10.1007/S00224-003-1109-3  0.447
2003 Bouyer P, Petit A, Thérien D. An algebraic approach to data languages and timed languages Information & Computation. 182: 137-162. DOI: 10.1016/S0890-5401(03)00038-5  0.459
2003 Straubing H, Thérien D. Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables Theory of Computing Systems \/ Mathematical Systems Theory. 36: 29-69. DOI: 10.1007/S00224-002-1035-9  0.477
2002 Thérien D, Wilke T. Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy Siam Journal On Computing. 31: 777-798. DOI: 10.1137/S0097539797322772  0.391
2000 Maciel A, Péladeau P, Thérien D. Programs over semigroups of dot-depth one Theoretical Computer Science. 245: 135-148. DOI: 10.1016/S0304-3975(99)00278-9  0.454
2000 Goldmann M, Russell A, Thérien D. An ergodic theorem for read-once non-uniform deterministic finite automata Information Processing Letters. 73: 23-28. DOI: 10.1016/S0020-0190(99)00162-3  0.381
1998 Maciel A, Thérien D. Threshold circuits of small majority-depth Information & Computation. 146: 55-83. DOI: 10.1006/Inco.1998.2732  0.347
1997 Beaudry M, McKenzie P, Péladeau P, Thérien D. Finite Monoids: From Word to Circuit Evaluation Siam Journal On Computing. 26: 138-152. DOI: 10.1137/S0097539793249530  0.368
1997 Péladeau P, Straubing H, Thérien D. Finite semigroup varieties defined by programs Theoretical Computer Science. 180: 325-339. DOI: 10.1016/S0304-3975(96)00297-6  0.497
1997 Beaudry M, Lemieux F, Therien D. Finite loops recognize exactly the regular open languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1256: 110-120.  0.383
1996 Jenner B, McKenzie P, Thérien D. Logspace and Logtime Leaf Languages Information & Computation. 129: 21-33. DOI: 10.1006/Inco.1996.0071  0.485
1995 Straubing H, Therien D, Thomas W. Regular Languages Defined with Generalized Quantifiers Information and Computation. 118: 289-301. DOI: 10.1006/Inco.1995.1067  0.492
1994 Thérien D. Circuits constructed with MOD q gates cannot compute “AND” in sublinear size Computational Complexity. 4: 383-388. DOI: 10.1007/Bf01263425  0.329
1993 Pin J, Thérien D. The bideterministic concatenation product International Journal of Algebra and Computation. 3: 535-555. DOI: 10.1142/S0218196793000305  0.424
1992 Beaudry M, McKenzie P, Thérien D. The Membership Problem in Aperiodic Transformation Monoids Journal of the Acm (Jacm). 39: 599-616. DOI: 10.1145/146637.146661  0.405
1992 Pin JE, Straubing H, Thérien D. Some results on the generalized star-height problem Information & Computation. 101: 219-250. DOI: 10.1016/0890-5401(92)90063-L  0.396
1992 Mix Barrington DA, Compton K, Straubing H, Thérien D. Regular languages in NC1 Journal of Computer and System Sciences. 44: 478-499. DOI: 10.1016/0022-0000(92)90014-A  0.46
1991 Thérien D. Two-sided wreath product of categories Journal of Pure and Applied Algebra. 74: 307-315. DOI: 10.1016/0022-4049(91)90119-M  0.422
1991 McKenzie P, Péladeau P, Therien D. NC1: The automata-theoretic viewpoint Computational Complexity. 1: 330-359. DOI: 10.1007/Bf01212963  0.513
1990 Mix-Barrington DA, Straubing H, Thérien D. Non-uniform automata over groups Information & Computation. 89: 109-132. DOI: 10.1016/0890-5401(90)90007-5  0.462
1989 Therien D. Programs over aperiodic monoids Theoretical Computer Science. 64: 271-280. DOI: 10.1016/0304-3975(89)90051-0  0.378
1988 Thérien D, Sznajder-Głodowski M. Finite categories and regular languages Banach Center Publications. 21: 395-402. DOI: 10.4064/-21-1-395-402  0.464
1988 Barrington DAM, Thérien D. Finite monoids and the fine structure of NC 1 Journal of the Acm. 35: 941-952. DOI: 10.1145/48014.63138  0.421
1988 Pin J, Straubing H, Thérien D. Locally trivial categories and unambiguous concatenation Journal of Pure and Applied Algebra. 52: 297-311. DOI: 10.1016/0022-4049(88)90097-7  0.478
1988 Straubing H, Thérien D. Partially ordered finite monoids and a theorem of I. Simon Journal of Algebra. 119: 393-399. DOI: 10.1016/0021-8693(88)90067-1  0.444
1986 Weiss A, Thérien D. Varieties of finite categories Theoretical Informatics and Applications. 20: 357-366. DOI: 10.1051/Ita/1986200303571  0.323
1984 Pin JE, Straubing H, Therien D. Small Varieties of Finite Semigroups and Extensions Journal of the Australian Mathematical Society. 37: 269-281. DOI: 10.1017/S1446788700022084  0.472
1984 Thérien D. A language theoretic interpretation of the schutzenberger representations with applications to certain varieties of languages Semigroup Forum. 28: 235-248. DOI: 10.1007/Bf02572486  0.431
1981 Thérien D. Classification of finite monoids: the language approach Theoretical Computer Science. 14: 195-208. DOI: 10.1016/0304-3975(81)90057-8  0.49
1981 Thérien D. Recognizable languages and congruences Semigroup Forum. 23: 371-373. DOI: 10.1007/Bf02676660  0.418
Show low-probability matches.