×
Compute Distance To:
Author ID: therien.denis Recent zbMATH articles by "Thérien, Denis"
Published as: Thérien, Denis; Thérien, D.; Therien, Denis; Therien, D.

Publications by Year

Citations contained in zbMATH Open

80 Publications have been cited 658 times in 397 Documents Cited by Year
Classification of finite monoids: the language approach. Zbl 0471.20055
Therien, Denis
42
1981
Graph congruences and wreath products. Zbl 0559.20042
Thérien, Denis; Weiss, Alex
38
1985
Finite monoids and the fine structure of \(NC^ 1\). Zbl 0667.68068
Barrington, David A. Mix; Thérien, Denis
35
1988
Non-uniform automata over groups. Zbl 0727.68070
Barrington, David A. Mix; Straubing, Howard; Thérien, Denis
34
1990
Partially ordered finite monoids and a theorem of I. Simon. Zbl 0658.20035
Straubing, Howard; Thérien, Denis
33
1988
Locally trivial categories and unambiguous concatenation. Zbl 0645.20046
Pin, Jean-Eric; Straubing, Howard; Thérien, Denis
26
1988
Nondeterministic \(NC^1\) computation. Zbl 0921.68029
Caussinus, Hervé; McKenzie, Pierre; Thérien, Denis; Vollmer, Heribert
26
1998
Algebraic results on quantum automata. Zbl 1101.68029
Ambainis, Andris; Beaudry, Martin; Golovkins, Marats; Kikusts, Arnolds; Mercer, Mark; Therien, Denis
24
2006
Regular languages in \(NC\). Zbl 0757.68057
Mix Barrington, David A.; Compton, Kevin; Straubing, Howard; Thérien, Denis
23
1992
Diamonds are forever: the variety DA. Zbl 1031.20049
Tesson, Pascal; Thérien, Denis
22
2002
Logics for context-free languages. Zbl 1044.68631
Lautemann, Clemens; Schwentick, Thomas; Thérien, Denis
20
1995
Regular languages defined with generalized quantifiers. Zbl 0826.68072
Straubing, Howard; Thérien, Denis; Thomas, Wolfgang
19
1995
Over words, two variables are as powerful as one quantifier alternation: \(\text{FO}^2=\Sigma_2\cap\Pi_2\). Zbl 1027.68614
Thérien, Denis; Wilke, Thomas
18
1998
Logspace and logtime leaf languages. Zbl 0864.68057
Jenner, Birgit; McKenzie, Pierre; Thérien, Denis
16
1996
\(NC^ 1\): The automata-theoretic viewpoint. Zbl 0774.68048
McKenzie, Pierre; Péladeau, Pierre; Thérien, Denis
15
1991
Partially-ordered two-way automata: A new characterization of DA. Zbl 1073.68051
Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
12
2002
Some results on the generalized star-height problem. Zbl 0769.68066
Pin, J. E.; Straubing, H.; Thérien, D.
10
1992
Sur les langages reconnus par des groupes nilpotents. (On the languages recognized by nilpotent groups). Zbl 0638.68073
Péladeau, Pierre; Thérien, Denis
9
1988
Two-sided wreath product of categories. Zbl 0748.18004
Thérien, Denis
9
1991
Finite monoids: From word to circuit evaluation. Zbl 0868.68057
Beaudry, Martin; McKenzie, Pierre; Péladeau, Pierre; Thérien, Denis
9
1997
Logic meets algebra: the case of regular languages. Zbl 1128.03029
Tesson, Pascal; Thérien, Denis
9
2007
An algebraic characterization of data and timed languages. Zbl 1006.68078
Bouyer, Patricia; Petit, Antoine; Thérien, Denis
8
2001
An algebraic approach to data languages and timed languages. Zbl 1028.68080
Bouyer, Patricia; Petit, Antoine; Thérien, Denis
8
2003
Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Zbl 1039.68072
Straubing, Howard; Thérien, Denis
8
2003
Threshold circuits of small majority-depth. Zbl 0916.68060
Maciel, Alexis; Thérien, Denis
8
1998
The membership problem in aperiodic transformation monoids. Zbl 0803.20046
Beaudry, M.; McKenzie, P.; Thérien, D.
8
1992
Dichotomies in the complexity of solving systems of equations over finite semigroups. Zbl 1109.68051
Klima, O.; Tesson, P.; Thérien, D.
8
2007
Regular languages defined with generalized quantifiers. Zbl 0658.68098
Straubing, Howard; Thérien, Denis; Thomas, Wolfgang
6
1988
Catégories et langages de dot-depth un. (Categories and dot-depth one languages). Zbl 0659.68094
Thérien, Denis
6
1988
Varieties of finite categories. Zbl 0608.18002
Weiss, Alex; Therien, Denis
6
1986
Automata theory meets circuit complexity. Zbl 0682.68074
McKenzie, P.; Thérien, D.
6
1989
Circuits and expressions with nonassociative gates. Zbl 0955.68053
Moore, Cristopher; Thérien, Denis; Lemieux, François; Berman, Joshua; Drisko, Arthur
6
2000
Programs over semigroups of dot-depth one. Zbl 0946.68073
Maciel, Alexis; Péladeau, Pierre; Thérien, Denis
6
2000
Finite categories and regular languages. Zbl 0761.68065
Thérien, Denis; Sznajder-Glodowski, Małgorzata
5
1988
Finite semigroup varieties defined by programs. Zbl 0901.68094
Péladeau, Pierre; Straubing, Howard; Thérien, Denis
5
1997
Equation satisfiability and program satisfiability for finite monoids. Zbl 0996.68070
Barrington, David Mix; McKenzie, Pierre; Moore, Chris; Tesson, Pascal; Thérien, Denis
5
2000
Nesting until and since in linear temporal logic. Zbl 1130.03014
Thérien, Denis; Wilke, Thomas
5
2004
Monoids and computations. Zbl 1088.68601
Tesson, Pascal; Thérien, Denis
5
2004
Complete classifications for the communication complexity of regular languages. Zbl 1066.68073
Tesson, Pascal; Thérien, Denis
5
2005
Weakly iterated block products of finite monoids. Zbl 1059.68075
Straubing, Howard; Thérien, Denis
4
2002
Temporal logic and semidirect products: An effective characterization of the until hierarchy. Zbl 1001.03018
Thérien, Denis; Wilke, Thomas
4
2001
Finite loops recognize exactly the regular open languages. Zbl 1401.68213
Beaudry, Martin; Lemieux, François; Thérien, Denis
4
1997
A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits. Zbl 1100.68029
Straubing, Howard; Thérien, Denis
4
2006
Languages with bounded multiparty communication complexity. Zbl 1186.68249
Chattopadhyay, Arkadev; Krebs, Andreas; Koucký, Michal; Szegedy, Mario; Tesson, Pascal; Thérien, Denis
4
2007
Algebraic results on quantum automata. Zbl 1122.68079
Ambainis, Andris; Beaudry, Martin; Golovkins, Marats; Ķikusts, Arnolds; Mercer, Mark; Thérien, Denis
4
2004
Subword counting and nilpotent groups. Zbl 0572.20052
Thérien, Denis
3
1983
Small varieties of finite semigroups and extensions. Zbl 0572.20053
Pin, Jean-Eric; Straubing, Howard; Thérien, Denis
3
1984
Sur les monoides dont tous les groupes sont resolubles. Zbl 0509.20053
Therien, D.
3
1983
Satisfiability of systems of equations over finite monoids. Zbl 0999.68262
Moore, Cristopher; Tesson, Pascal; Thérien, Denis
3
2001
Efficient threshold circuits for power series. Zbl 1009.68061
Maciel, Alexis; Thérien, Denis
3
1999
The computing power of programs over finite monoids. Zbl 1031.68071
Tesson, Pascal; Thérien, Denis
3
2002
An algebraic perspective on Boolean function learning. Zbl 1262.68066
Gavaldà, Ricard; Thérien, Denis
3
2009
Algebraic characterizations of small classes of Boolean functions. Zbl 1035.68049
Gavaldà, Ricard; Thérien, Denis
3
2003
Bridges between algebraic automata theory and complexity theory. Zbl 1169.68434
Tesson, Pascal; Thérien, Denis
3
2006
An algebraic approach to communication complexity. Zbl 0909.68081
Raymond, Jean-François; Tesson, Pascal; Thérien, Denis
3
1998
Circuits constructed with MOD\(_ q\) gates cannot compute “and” in sublinear size. Zbl 0829.68048
Thérien, Denis
3
1994
The bideterministic concatenation product. Zbl 0816.20065
Pin, Jean-Eric; Thérien, Denis
3
1993
On the equation \(x^ t=x^{t+q}\) in categories. Zbl 0641.18002
Thérien, Denis
2
1988
Recognizable languages and congruences. Zbl 0501.20044
Therien, Denis
2
1981
A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages. Zbl 0542.20045
Thérien, Denis
2
1984
Tractable clones of polynomials over semigroups. Zbl 1153.68455
Dalmau, Víctor; Gavaldà, Ricard; Tesson, Pascal; Thérien, Denis
2
2005
Bounded-depth circuits: separating wires from gates (extended abstract). Zbl 1192.68298
Koucký, Michal; Pudlák, Pavel; Thérien, Denis
2
2005
Subtree-counting loops. Zbl 1019.20032
Lemieux, François; Moore, Cristopher; Thérien, Denis
2
2001
Modular quantifiers. Zbl 1244.03119
Straubing, Howard; Thérien, Denis
2
2008
The dot-depth and the polynomial hierarchies correspond on the delta levels. Zbl 1161.68512
Borchert, Bernd; Lange, Klaus-Jörn; Stephan, Frank; Tesson, Pascal; Thérien, Denis
2
2005
Restricted two-variable FO+MOD sentences, circuits and communication complexity. Zbl 1084.03037
Tesson, Pascal; Thérien, Denis
2
2005
Threshold circuits for iterated multiplication: Using AC\(^ 0\) for free. Zbl 0798.68077
Maciel, Alexis; Thérien, Denis
2
1993
Polyabelian loops and Boolean completeness. Zbl 1051.20033
Lemieux, François; Moore, Cristopher; Thérien, Denis
2
2000
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. Zbl 1069.03021
Barrington, David A. Mix; Immerman, Neil; Lautemann, Clemens; Schweikardt, Nicole; Thérien, Denis
2
2005
Non-uniform automata over groups. Zbl 0634.68054
Barrington, David A.; Thérien, Denis
1
1987
The many faces of a translation. Zbl 0973.68155
McKenzie, Pierre; Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
1
2000
Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Zbl 0976.68092
Straubing, Howard; Thérien, Denis
1
2001
Learning read-constant polynomials of constant degree modulo composites. Zbl 1319.68118
Chattopadhyay, Arkadev; Gavaldà, Ricard; Hansen, Kristoffer Arnsfelt; Thérien, Denis
1
2014
Learning expressions and programs over monoids. Zbl 1093.68046
Gavaldà, Ricard; Tesson, Pascal; Thérien, Denis
1
2006
Programs over aperiodic monoids. Zbl 0676.20043
Thérien, Denis
1
1989
The dot-depth and the polynomial hierarchy correspond on the Delta levels. Zbl 1117.68393
Borchert, Bernd; Lange, Klaus-Jörn; Stephan, Frank; Tesson, Pascal; Thérien, Denis
1
2004
Groupoids that recognize only regular languages. Zbl 1082.68582
Beaudry, Martin; Lemieux, François; Thérien, Denis
1
2005
Imre Simon: an exceptional graduate student. Zbl 1097.68580
Thérien, Denis
1
2005
Weakly iterated block products and applications to logic and complexity. Zbl 1234.68275
Straubing, Howard; Tesson, Pascal; Thérien, Denis
1
2010
An ergodic theorem for read-once non-uniform deterministic finite automata. Zbl 0953.68567
Goldmann, M.; Russell, A.; Thérien, D.
1
2000
Learning read-constant polynomials of constant degree modulo composites. Zbl 1319.68118
Chattopadhyay, Arkadev; Gavaldà, Ricard; Hansen, Kristoffer Arnsfelt; Thérien, Denis
1
2014
Weakly iterated block products and applications to logic and complexity. Zbl 1234.68275
Straubing, Howard; Tesson, Pascal; Thérien, Denis
1
2010
An algebraic perspective on Boolean function learning. Zbl 1262.68066
Gavaldà, Ricard; Thérien, Denis
3
2009
Modular quantifiers. Zbl 1244.03119
Straubing, Howard; Thérien, Denis
2
2008
Logic meets algebra: the case of regular languages. Zbl 1128.03029
Tesson, Pascal; Thérien, Denis
9
2007
Dichotomies in the complexity of solving systems of equations over finite semigroups. Zbl 1109.68051
Klima, O.; Tesson, P.; Thérien, D.
8
2007
Languages with bounded multiparty communication complexity. Zbl 1186.68249
Chattopadhyay, Arkadev; Krebs, Andreas; Koucký, Michal; Szegedy, Mario; Tesson, Pascal; Thérien, Denis
4
2007
Algebraic results on quantum automata. Zbl 1101.68029
Ambainis, Andris; Beaudry, Martin; Golovkins, Marats; Kikusts, Arnolds; Mercer, Mark; Therien, Denis
24
2006
A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits. Zbl 1100.68029
Straubing, Howard; Thérien, Denis
4
2006
Bridges between algebraic automata theory and complexity theory. Zbl 1169.68434
Tesson, Pascal; Thérien, Denis
3
2006
Learning expressions and programs over monoids. Zbl 1093.68046
Gavaldà, Ricard; Tesson, Pascal; Thérien, Denis
1
2006
Complete classifications for the communication complexity of regular languages. Zbl 1066.68073
Tesson, Pascal; Thérien, Denis
5
2005
Tractable clones of polynomials over semigroups. Zbl 1153.68455
Dalmau, Víctor; Gavaldà, Ricard; Tesson, Pascal; Thérien, Denis
2
2005
Bounded-depth circuits: separating wires from gates (extended abstract). Zbl 1192.68298
Koucký, Michal; Pudlák, Pavel; Thérien, Denis
2
2005
The dot-depth and the polynomial hierarchies correspond on the delta levels. Zbl 1161.68512
Borchert, Bernd; Lange, Klaus-Jörn; Stephan, Frank; Tesson, Pascal; Thérien, Denis
2
2005
Restricted two-variable FO+MOD sentences, circuits and communication complexity. Zbl 1084.03037
Tesson, Pascal; Thérien, Denis
2
2005
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. Zbl 1069.03021
Barrington, David A. Mix; Immerman, Neil; Lautemann, Clemens; Schweikardt, Nicole; Thérien, Denis
2
2005
Groupoids that recognize only regular languages. Zbl 1082.68582
Beaudry, Martin; Lemieux, François; Thérien, Denis
1
2005
Imre Simon: an exceptional graduate student. Zbl 1097.68580
Thérien, Denis
1
2005
Nesting until and since in linear temporal logic. Zbl 1130.03014
Thérien, Denis; Wilke, Thomas
5
2004
Monoids and computations. Zbl 1088.68601
Tesson, Pascal; Thérien, Denis
5
2004
Algebraic results on quantum automata. Zbl 1122.68079
Ambainis, Andris; Beaudry, Martin; Golovkins, Marats; Ķikusts, Arnolds; Mercer, Mark; Thérien, Denis
4
2004
The dot-depth and the polynomial hierarchy correspond on the Delta levels. Zbl 1117.68393
Borchert, Bernd; Lange, Klaus-Jörn; Stephan, Frank; Tesson, Pascal; Thérien, Denis
1
2004
An algebraic approach to data languages and timed languages. Zbl 1028.68080
Bouyer, Patricia; Petit, Antoine; Thérien, Denis
8
2003
Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Zbl 1039.68072
Straubing, Howard; Thérien, Denis
8
2003
Algebraic characterizations of small classes of Boolean functions. Zbl 1035.68049
Gavaldà, Ricard; Thérien, Denis
3
2003
Diamonds are forever: the variety DA. Zbl 1031.20049
Tesson, Pascal; Thérien, Denis
22
2002
Partially-ordered two-way automata: A new characterization of DA. Zbl 1073.68051
Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
12
2002
Weakly iterated block products of finite monoids. Zbl 1059.68075
Straubing, Howard; Thérien, Denis
4
2002
The computing power of programs over finite monoids. Zbl 1031.68071
Tesson, Pascal; Thérien, Denis
3
2002
An algebraic characterization of data and timed languages. Zbl 1006.68078
Bouyer, Patricia; Petit, Antoine; Thérien, Denis
8
2001
Temporal logic and semidirect products: An effective characterization of the until hierarchy. Zbl 1001.03018
Thérien, Denis; Wilke, Thomas
4
2001
Satisfiability of systems of equations over finite monoids. Zbl 0999.68262
Moore, Cristopher; Tesson, Pascal; Thérien, Denis
3
2001
Subtree-counting loops. Zbl 1019.20032
Lemieux, François; Moore, Cristopher; Thérien, Denis
2
2001
Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Zbl 0976.68092
Straubing, Howard; Thérien, Denis
1
2001
Circuits and expressions with nonassociative gates. Zbl 0955.68053
Moore, Cristopher; Thérien, Denis; Lemieux, François; Berman, Joshua; Drisko, Arthur
6
2000
Programs over semigroups of dot-depth one. Zbl 0946.68073
Maciel, Alexis; Péladeau, Pierre; Thérien, Denis
6
2000
Equation satisfiability and program satisfiability for finite monoids. Zbl 0996.68070
Barrington, David Mix; McKenzie, Pierre; Moore, Chris; Tesson, Pascal; Thérien, Denis
5
2000
Polyabelian loops and Boolean completeness. Zbl 1051.20033
Lemieux, François; Moore, Cristopher; Thérien, Denis
2
2000
The many faces of a translation. Zbl 0973.68155
McKenzie, Pierre; Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
1
2000
An ergodic theorem for read-once non-uniform deterministic finite automata. Zbl 0953.68567
Goldmann, M.; Russell, A.; Thérien, D.
1
2000
Efficient threshold circuits for power series. Zbl 1009.68061
Maciel, Alexis; Thérien, Denis
3
1999
Nondeterministic \(NC^1\) computation. Zbl 0921.68029
Caussinus, Hervé; McKenzie, Pierre; Thérien, Denis; Vollmer, Heribert
26
1998
Over words, two variables are as powerful as one quantifier alternation: \(\text{FO}^2=\Sigma_2\cap\Pi_2\). Zbl 1027.68614
Thérien, Denis; Wilke, Thomas
18
1998
Threshold circuits of small majority-depth. Zbl 0916.68060
Maciel, Alexis; Thérien, Denis
8
1998
An algebraic approach to communication complexity. Zbl 0909.68081
Raymond, Jean-François; Tesson, Pascal; Thérien, Denis
3
1998
Finite monoids: From word to circuit evaluation. Zbl 0868.68057
Beaudry, Martin; McKenzie, Pierre; Péladeau, Pierre; Thérien, Denis
9
1997
Finite semigroup varieties defined by programs. Zbl 0901.68094
Péladeau, Pierre; Straubing, Howard; Thérien, Denis
5
1997
Finite loops recognize exactly the regular open languages. Zbl 1401.68213
Beaudry, Martin; Lemieux, François; Thérien, Denis
4
1997
Logspace and logtime leaf languages. Zbl 0864.68057
Jenner, Birgit; McKenzie, Pierre; Thérien, Denis
16
1996
Logics for context-free languages. Zbl 1044.68631
Lautemann, Clemens; Schwentick, Thomas; Thérien, Denis
20
1995
Regular languages defined with generalized quantifiers. Zbl 0826.68072
Straubing, Howard; Thérien, Denis; Thomas, Wolfgang
19
1995
Circuits constructed with MOD\(_ q\) gates cannot compute “and” in sublinear size. Zbl 0829.68048
Thérien, Denis
3
1994
The bideterministic concatenation product. Zbl 0816.20065
Pin, Jean-Eric; Thérien, Denis
3
1993
Threshold circuits for iterated multiplication: Using AC\(^ 0\) for free. Zbl 0798.68077
Maciel, Alexis; Thérien, Denis
2
1993
Regular languages in \(NC\). Zbl 0757.68057
Mix Barrington, David A.; Compton, Kevin; Straubing, Howard; Thérien, Denis
23
1992
Some results on the generalized star-height problem. Zbl 0769.68066
Pin, J. E.; Straubing, H.; Thérien, D.
10
1992
The membership problem in aperiodic transformation monoids. Zbl 0803.20046
Beaudry, M.; McKenzie, P.; Thérien, D.
8
1992
\(NC^ 1\): The automata-theoretic viewpoint. Zbl 0774.68048
McKenzie, Pierre; Péladeau, Pierre; Thérien, Denis
15
1991
Two-sided wreath product of categories. Zbl 0748.18004
Thérien, Denis
9
1991
Non-uniform automata over groups. Zbl 0727.68070
Barrington, David A. Mix; Straubing, Howard; Thérien, Denis
34
1990
Automata theory meets circuit complexity. Zbl 0682.68074
McKenzie, P.; Thérien, D.
6
1989
Programs over aperiodic monoids. Zbl 0676.20043
Thérien, Denis
1
1989
Finite monoids and the fine structure of \(NC^ 1\). Zbl 0667.68068
Barrington, David A. Mix; Thérien, Denis
35
1988
Partially ordered finite monoids and a theorem of I. Simon. Zbl 0658.20035
Straubing, Howard; Thérien, Denis
33
1988
Locally trivial categories and unambiguous concatenation. Zbl 0645.20046
Pin, Jean-Eric; Straubing, Howard; Thérien, Denis
26
1988
Sur les langages reconnus par des groupes nilpotents. (On the languages recognized by nilpotent groups). Zbl 0638.68073
Péladeau, Pierre; Thérien, Denis
9
1988
Regular languages defined with generalized quantifiers. Zbl 0658.68098
Straubing, Howard; Thérien, Denis; Thomas, Wolfgang
6
1988
Catégories et langages de dot-depth un. (Categories and dot-depth one languages). Zbl 0659.68094
Thérien, Denis
6
1988
Finite categories and regular languages. Zbl 0761.68065
Thérien, Denis; Sznajder-Glodowski, Małgorzata
5
1988
On the equation \(x^ t=x^{t+q}\) in categories. Zbl 0641.18002
Thérien, Denis
2
1988
Non-uniform automata over groups. Zbl 0634.68054
Barrington, David A.; Thérien, Denis
1
1987
Varieties of finite categories. Zbl 0608.18002
Weiss, Alex; Therien, Denis
6
1986
Graph congruences and wreath products. Zbl 0559.20042
Thérien, Denis; Weiss, Alex
38
1985
Small varieties of finite semigroups and extensions. Zbl 0572.20053
Pin, Jean-Eric; Straubing, Howard; Thérien, Denis
3
1984
A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages. Zbl 0542.20045
Thérien, Denis
2
1984
Subword counting and nilpotent groups. Zbl 0572.20052
Thérien, Denis
3
1983
Sur les monoides dont tous les groupes sont resolubles. Zbl 0509.20053
Therien, D.
3
1983
Classification of finite monoids: the language approach. Zbl 0471.20055
Therien, Denis
42
1981
Recognizable languages and congruences. Zbl 0501.20044
Therien, Denis
2
1981
all top 5

Cited by 370 Authors

29 Thérien, Denis
23 Pin, Jean-Eric
18 Krebs, Andreas
16 Straubing, Howard
16 Weil, Pascal
14 Almeida, Jorge
14 Kufleitner, Manfred
13 Vollmer, Heribert
10 McKenzie, Pierre
10 Mix Barrington, David A.
9 Allender, Eric W.
9 Klíma, Ondřej
7 Droste, Manfred
7 Mahajan, Meena
7 Mereghetti, Carlo
7 Palano, Beatrice
7 Qiu, Daowen
7 Steinberg, Benjamin
6 Diekert, Volker
6 Glaßer, Christian
6 Li, Lvzhou
6 Lohrey, Markus
6 Péladeau, Pierre
6 Place, Thomas
6 Schwentick, Thomas
6 Yakaryılmaz, Abuzer
5 Borchert, Bernd
5 Ésik, Zoltán
5 Jones, Peter R.
5 Mandrioli, Dino
5 Margolis, Stuart W.
5 Pradella, Matteo
5 Selivanov, Viktor L’vovich
5 Tesson, Pascal
5 Zheng, Shenggen
4 Behle, Christoph
4 Bianchi, Maria Paola
4 Gavaldà, Ricard
4 Limaye, Nutan
4 Maciel, Alexis
4 Raghavendra Rao, B. V.
4 Sarma M. N., Jayalal
4 Volkov, Mikhail Vladimirovich
4 Zeitoun, Marc
3 Beaudry, Martin
3 Beigel, Richard
3 Birget, Jean-Camille
3 Bojańczyk, Mikołaj
3 Chattopadhyay, Arkadev
3 Costa, Alfredo
3 Escada, Ana P.
3 Fleischer, Lukas
3 Gastin, Paul
3 Gehrke, Mai
3 Gruska, Jozef
3 Hansen, Kristoffer Arnsfelt
3 Héam, Pierre-Cyrille
3 Horváth, Gábor
3 Juhász, Zsófia
3 Lauser, Alexander
3 Masopust, Tomáš
3 Perevoshchikov, Vitaly
3 Reifferscheid, Stephanie
3 Russell, Alexander C.
3 Say, A. C. Cem
3 Schmitz, Heinz
3 Schnoebelen, Philippe
3 Wagner, Klaus W.
3 Wang, Fengming
3 Weiß, Armin
3 Yamakami, Tomoyuki
2 Ada, Anil
2 Arvind, Vikraman
2 Babari, Parvaneh
2 Bodirsky, Manuel
2 Bouyer, Patricia
2 Branco, Mário J. J.
2 Cadilhac, Michaël
2 Caussinus, Hervé
2 Chiari, Michele
2 Corbett, James C.
2 Costa, José Carlos
2 Datta, Samir
2 Demri, Stéphane P.
2 Dima, Cătălin
2 Dück, Stefan
2 Fernau, Henning
2 Figueira, Diego
2 Finkel, Olivier
2 Gainutdinova, Aida
2 Garcia, Pedro
2 Haak, Anselm
2 Higgins, Peter Michael
2 Hirvensalo, Mika
2 Holzer, Markus
2 Jansen, Maurice J.
2 Jeřábek, Emil
2 König, Daniel
2 Koucký, Michal
2 Krötzsch, Markus
...and 270 more Authors
all top 5

Cited in 61 Serials

72 Theoretical Computer Science
32 Information and Computation
22 Theory of Computing Systems
21 Journal of Computer and System Sciences
19 Semigroup Forum
19 International Journal of Algebra and Computation
13 Information Processing Letters
13 Journal of Pure and Applied Algebra
13 RAIRO. Theoretical Informatics and Applications
12 International Journal of Foundations of Computer Science
12 Computational Complexity
8 Logical Methods in Computer Science
6 Journal of Algebra
5 Algebra Universalis
4 RAIRO. Informatique Théorique et Applications
3 Mathematical Systems Theory
3 SIAM Journal on Computing
3 Algorithmica
3 Journal of Logic, Language and Information
2 Bulletin of the Australian Mathematical Society
2 Communications in Algebra
2 Discrete Mathematics
2 Advances in Mathematics
2 Results in Mathematics
2 Transactions of the American Mathematical Society
2 Combinatorica
2 Annals of Pure and Applied Logic
2 MSCS. Mathematical Structures in Computer Science
2 Archive for Mathematical Logic
2 Annals of Mathematics and Artificial Intelligence
2 ACM Transactions on Computational Logic
1 Artificial Intelligence
1 Communications in Mathematical Physics
1 International Journal of Theoretical Physics
1 Israel Journal of Mathematics
1 Periodica Mathematica Hungarica
1 Compositio Mathematica
1 Topology and its Applications
1 Acta Mathematica Hungarica
1 Physica D
1 Publicacions Matemàtiques
1 Forum Mathematicum
1 Distributed Computing
1 Applicable Algebra in Engineering, Communication and Computing
1 Journal of Algebraic Combinatorics
1 Transformation Groups
1 Journal of Automata, Languages and Combinatorics
1 Journal of the ACM
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Journal of Mathematical Logic
1 Fundamenta Informaticae
1 Lobachevskii Journal of Mathematics
1 Natural Computing
1 Quantum Information Processing
1 Journal of Algebra and its Applications
1 Algorithms
1 RAIRO. Theoretical Informatics and Applications
1 Bulletin of Mathematical Sciences
1 Computer Science Review
1 Journal of Logical and Algebraic Methods in Programming

Citations by Year