Denis Thérien

3.5k total citations
64 papers, 934 citations indexed

About

Denis Thérien is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Denis Thérien has authored 64 papers receiving a total of 934 indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 42 papers in Artificial Intelligence and 7 papers in Molecular Biology. Recurrent topics in Denis Thérien's work include semigroups and automata theory (51 papers), Advanced Algebra and Logic (20 papers) and Logic, programming, and type systems (16 papers). Denis Thérien is often cited by papers focused on semigroups and automata theory (51 papers), Advanced Algebra and Logic (20 papers) and Logic, programming, and type systems (16 papers). Denis Thérien collaborates with scholars based in Canada, United States and Germany. Denis Thérien's co-authors include Howard Straubing, David A. Mix Barrington, Pascal Tesson, Pierre McKenzie, Thomas Wilke, Kevin J. Compton, Heribert Vollmer, Jean-Éric Pin, Patricia Bouyer and Antoine Petit and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Denis Thérien

60 papers receiving 847 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Denis Thérien Canada	18	879	653	88	63	50	64	934
Howard Straubing United States	18	1.1k 1.3×	721 1.1×	125 1.4×	108 1.7×	33 0.7×	50	1.2k
Juhani Karhumäki Finland	18	937 1.1×	734 1.1×	373 4.2×	77 1.2×	26 0.5×	122	1.0k
Volker Diekert Germany	11	596 0.7×	372 0.6×	64 0.7×	135 2.1×	12 0.2×	82	702
Zoltán Ésik Hungary	18	1.0k 1.2×	952 1.5×	134 1.5×	34 0.5×	19 0.4×	161	1.2k
Celia Wrathall United States	9	388 0.4×	269 0.4×	33 0.4×	47 0.7×	17 0.3×	19	450
Hans Zantema Netherlands	12	354 0.4×	487 0.7×	23 0.3×	46 0.7×	14 0.3×	78	573
Stefano Varricchio Italy	10	334 0.4×	259 0.4×	73 0.8×	35 0.6×	10 0.2×	46	387
Yechezkel Zalcstein United States	12	373 0.4×	201 0.3×	32 0.4×	128 2.0×	33 0.7×	38	467
Matthias Jantzen Germany	11	311 0.4×	222 0.3×	121 1.4×	57 0.9×	6 0.1×	22	400
Ferenc Gécseg Hungary	6	411 0.5×	372 0.6×	77 0.9×	18 0.3×	9 0.2×	26	532

Countries citing papers authored by Denis Thérien

Since Specialization

Citations

This map shows the geographic impact of Denis Thérien's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Denis Thérien with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Denis Thérien more than expected).

Fields of papers citing papers by Denis Thérien

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Denis Thérien. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Denis Thérien. The network helps show where Denis Thérien may publish in the future.

Co-authorship network of co-authors of Denis Thérien

This figure shows the co-authorship network connecting the top 25 collaborators of Denis Thérien. A scholar is included among the top collaborators of Denis Thérien based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Denis Thérien. Denis Thérien is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Tesson, Pascal & Denis Thérien. (2006). Bridges between Algebraic Automata Theory and Complexity Theory.. Bulletin of the European Association for Theoretical Computer Science. 88. 37–64. 2 indexed citations

Chattopadhyay, Arkadev, Navin Goyal, Pavel Pudlák, & Denis Thérien. (2006). Lower bounds for circuits with MOD_m gates. 41. 709–718. 13 indexed citations

Gavaldà, Ricard, Pascal Tesson, & Denis Thérien. (2005). Learning expressions and programs over monoids. Information and Computation. 204(2). 177–209. 1 indexed citations

McKenzie, Pierre, Thomas Schwentick, Denis Thérien, & Heribert Vollmer. (2005). The many faces of a translation. Journal of Computer and System Sciences. 72(1). 163–179. 1 indexed citations

Barrington, David A. Mix, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, & Denis Thérien. (2004). First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. Journal of Computer and System Sciences. 70(2). 101–127. 11 indexed citations

McKenzie, Pierre, et al.. (2003). Modular temporal logic. 32. 344–351. 5 indexed citations

McKenzie, Pierre, et al.. (2002). Nondeterministic NC/sup 1/ computation. 12–21. 20 indexed citations

McKenzie, Pierre, et al.. (2002). Logspace and logtime leaf languages. 242–254. 9 indexed citations

Thérien, Denis, et al.. (2001). On the Languages Recognized by Nilpotent Groups (a translation of "Sur les Langages Reconnus par des Groupes Nilpotents"). Electronic colloquium on computational complexity. 8.

10.

Lemieux, François, Cristopher Moore, & Denis Thérien. (2000). Polyabelian loops and Boolean completeness. Commentationes Mathematicae Universitatis Carolinae. 41(4). 671–686. 2 indexed citations

11.

Thérien, Denis, et al.. (1999). Efficient Threshold Circuits for Power Series. Information and Computation. 152(1). 62–73. 6 indexed citations

12.

McKenzie, Pierre, et al.. (1998). NondeterministicNC1Computation. Journal of Computer and System Sciences. 57(2). 200–212. 27 indexed citations

13.

Thérien, Denis, et al.. (1998). Threshold Circuits of Small Majority-Depth. Information and Computation. 146(1). 55–83. 21 indexed citations

14.

Jenner, Birgit, Pierre McKenzie, & Denis Thérien. (1996). Logspace and Logtime Leaf Languages. Information and Computation. 129(1). 21–33. 13 indexed citations

15.

Thérien, Denis & François Lemieux. (1996). Finite groupoids and their applications to computational complexity. 180–180. 3 indexed citations

16.

Straubing, Howard, Denis Thérien, & Wolfgang Thomas. (1995). Regular Languages Defined with Generalized Quantifiers. Information and Computation. 118(2). 289–301. 23 indexed citations

17.

Barrington, David A. Mix, Kevin J. Compton, Howard Straubing, & Denis Thérien. (1992). Regular languages in NC1. Journal of Computer and System Sciences. 44(3). 478–499. 53 indexed citations

18.

Straubing, Howard, et al.. (1990). Non-uniform automata over groups. Information and Computation. 89(2). 109–132. 70 indexed citations

19.

Straubing, Howard & Denis Thérien. (1988). Partially ordered finite monoids and a theorem of I. Simon. Journal of Algebra. 119(2). 393–399. 32 indexed citations

20.

Thérien, Denis. (1981). Classification of finite monoids: the language approach. Theoretical Computer Science. 14(2). 195–208. 54 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact