×

zbMATH — the first resource for mathematics

Narendran, Paliath

Compute Distance To:
Author ID: narendran.paliath Recent zbMATH articles by "Narendran, Paliath"
Published as: Narendran, Paliath; Narendran, P.
External Links: MGP
Documents Indexed: 91 Publications since 1983, including 1 Book

Publications by Year

Citations contained in zbMATH Open

69 Publications have been cited 519 times in 375 Documents Cited by Year
Church-Rosser Thue systems and formal languages. Zbl 0652.68093
McNaughton, Robert; Narendran, Paliath; Otto, Friedrich
43
1988
A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023
Kapur, Deepak; Narendran, Paliath
32
1985
Unification of concept terms in description logics. Zbl 0970.68166
Baader, Franz; Narendran, Paliath
26
2001
On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
23
1987
The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010
Kapur, Deepak; Narendran, Paliath
21
1985
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
18
1992
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
18
1987
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
17
1991
Theorem proving using equational matings and rigid \(E\)-unification. Zbl 0799.68171
Gallier, Jean; Narendran, Paliath; Raatz, Stan; Snyder, Wayne
14
1992
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
14
1988
Complexity of certain decision problems about congruential languages. Zbl 0607.68055
Narendran, Paliath; Ó’Dúnlaing, Colm; Rolletschek, Heinrich
12
1985
The undecidability of the preperfectness of Thue systems. Zbl 0545.03022
Narendran, Paliath; McNaughton, Robert
11
1984
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems. Zbl 0563.03018
Kapur, D.; Krishnamoorthy, M. S.; McNaughton, R.; Narendran, P.
11
1985
A path ordering for proving termination of term rewriting systems. Zbl 0567.68026
Kapur, D.; Narendran, P.; Sivakumar, G.
11
1985
On recursive path ordering. Zbl 0602.68031
Krishnamoorthy, M. S.; Narendran, P.
10
1985
An algorithm for finding canonical sets of ground rewrite rules in polynomial time. Zbl 0779.68050
Gallier, Jean; Narendran, Paliath; Plaisted, David; Raatz, Stan; Snyder, Wayne
10
1993
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
10
1986
Complexity results on the conjugacy problem for monoids. Zbl 0588.03022
Narendran, Paliath; Otto, Friedrich
10
1985
The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Zbl 0592.03025
Narendran, Paliath; Otto, Friedrich; Winklmann, Karl
9
1984
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
9
1991
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
9
1990
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026
Narendran, Paliath; Otto, Friedrich
9
1988
Any ground associative-commutative theory has a finite canonical system. Zbl 0878.68076
Narendran, Paliath; Rusinowitch, Michaël
8
1996
Closure properties and decision problems of dag automata. Zbl 1182.68099
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
8
2005
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
8
2003
Intruders with caps. Zbl 1203.94091
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
8
2007
The problems of cyclic equality and conjugacy for finite complete rewriting systems. Zbl 0619.68033
Narendran, Paliath; Otto, Friedrich
8
1986
The Knuth Bendix completion procedure and Thue systems. Zbl 0535.68012
Kapur, D.; Narendran, P.
7
1983
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Zbl 0944.68103
Degtyarev, A.; Gurevich, Y.; Narendran, P.; Veanes, M.; Voronkov, A.
7
2000
Cancellativity in finitely presented semigroups. Zbl 0682.20046
Narendran, Paliath; Ó’Dúnlaing, Colm
7
1989
On extended regular expressions. Zbl 1234.68202
Carle, Benjamin; Narendran, Paliath
7
2009
Special monoids and special Thue systems. Zbl 0618.20039
McNaughton, R.; Narendran, P.
7
1987
Proof by induction using test sets. Zbl 0642.68034
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
7
1986
Rigid E-unification: NP-completeness and applications to equational matings. Zbl 0709.68080
Gallier, Jean; Narendran, Paliath; Plaisted, David; Snyder, Wayne
6
1990
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
6
1987
On the unification problem for Cartesian closed categories. Zbl 0882.03044
Narendran, Paliath; Pfenning, Frank; Statman, Richard
5
1997
The Church-Rosser property and special Thue systems. Zbl 0586.03028
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R.
5
1985
On weakly confluent monadic string-rewriting systems. Zbl 0778.68049
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L.
5
1993
Decision problems in ordered rewriting. Zbl 0945.68520
Comon, H.; Narendran, P.; Nieuwenhuis, R.; Rusinowitch, M.
4
1998
Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025
Narendran, Paliath; Otto, Friedrich
4
1988
An ideal-theoretical approach to word problems and unification problems over finitely presented commutative algebras. Zbl 0581.68039
Kandri-Rody, Abdelilah; Kapur, Deepak; Narendran, Paliath
4
1985
On forward closure and the finite variant property. Zbl 1398.68271
Bouchard, Christopher; Gero, Kimberly A.; Lynch, Christopher; Narendran, Paliath
4
2013
A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061
Madlener, K.; Narendran, P.; Otto, F.
4
1991
It is undecidable whether a finite special string-rewriting system presents a group. Zbl 0749.20032
Narendran, Paliath; Ó’Dúnlaing, Colm; Otto, Friedrich
4
1991
The decidability of simultaneous rigid \(E\)-unification with one variable. Zbl 0903.03007
Degtyarev, Anatoli; Gurevich, Yuri; Narendran, Paliath; Veanes, Margus; Voronkov, Andrei
3
1998
RPO constraint solving is in NP. Zbl 0940.68070
Narendran, Paliath; Rusinowitch, Michael; Verma, Rakesh
3
1999
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
2
2011
The word matching problem is undecidable for finite special string-rewriting systems that are confluent. Zbl 1401.68138
Narendran, Paliath; Otto, Friedrich
2
1997
Single versus simultaneous equational unification and equational unification for variable-permuting theories. Zbl 0882.68079
Narendran, Paliath; Otto, Friedrich
2
1997
Unification modulo ACUI plus distributivity axioms. Zbl 1063.03006
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
2
2004
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. Zbl 1381.68264
Erbatur, Serdar; Escobar, Santiago; Kapur, Deepak; Liu, Zhiqiang; Lynch, Christopher A.; Meadows, Catherine; Meseguer, José; Narendran, Paliath; Santiago, Sonia; Sasse, Ralf
2
2013
Complexity of matching problems. Zbl 0576.68038
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
2
1985
Unification modulo homomorphic encryption. Zbl 1242.68096
Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael
2
2012
Semi-unification. Zbl 0732.68063
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1991
ACID-unification is NEXPTIME-decidable. Zbl 1124.68370
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
2
2003
Unification modulo homomorphic encryption. Zbl 1193.68231
Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michaël
2
2009
Asymmetric unification and disunification. Zbl 1444.68088
Ravishankar, Veena; Cornell, Kimberly A.; Narendran, Paliath
1
2019
Unification and matching in process algebras. Zbl 0905.68091
Guo, Qing; Narendran, Paliath; Shukla, Sandeep K.
1
1998
On the regular equivalence problem for regular Thue systems. Zbl 0609.68027
Narendran, Paliath
1
1986
Complexity of nilpotent unification and matching problems. Zbl 1045.68603
Guo, Qing; Narendran, Paliath; Wolfram, D. A.
1
2000
On unification modulo one-sided distributivity: algorithms, variants and asymmetry. Zbl 1391.68065
Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath
1
2015
On asymmetric unification and the combination problem in disjoint theories. Zbl 1405.68315
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath; Ringeissen, Christophe
1
2014
Unification modulo ACUI plus homomorphisms/distributivity. Zbl 1278.68246
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
1
2003
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
1
2013
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
1
1988
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Zbl 0677.68050
Narendran, Paliath; Otto, Friedrich
1
1989
It is decidable whether a monadic Thue system is canonical over a regular set. Zbl 0722.68071
Narendran, Paliath
1
1990
The theory of total unary RPO is decidable. Zbl 0983.68175
Narendran, Paliath; Rusinowitch, Michael
1
2000
Complexity of sufficient-completeness. Zbl 0623.68047
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
1
1986
Asymmetric unification and disunification. Zbl 1444.68088
Ravishankar, Veena; Cornell, Kimberly A.; Narendran, Paliath
1
2019
On unification modulo one-sided distributivity: algorithms, variants and asymmetry. Zbl 1391.68065
Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath
1
2015
On asymmetric unification and the combination problem in disjoint theories. Zbl 1405.68315
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath; Ringeissen, Christophe
1
2014
On forward closure and the finite variant property. Zbl 1398.68271
Bouchard, Christopher; Gero, Kimberly A.; Lynch, Christopher; Narendran, Paliath
4
2013
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. Zbl 1381.68264
Erbatur, Serdar; Escobar, Santiago; Kapur, Deepak; Liu, Zhiqiang; Lynch, Christopher A.; Meadows, Catherine; Meseguer, José; Narendran, Paliath; Santiago, Sonia; Sasse, Ralf
2
2013
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
1
2013
Unification modulo homomorphic encryption. Zbl 1242.68096
Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael
2
2012
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
2
2011
On extended regular expressions. Zbl 1234.68202
Carle, Benjamin; Narendran, Paliath
7
2009
Unification modulo homomorphic encryption. Zbl 1193.68231
Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michaël
2
2009
Intruders with caps. Zbl 1203.94091
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
8
2007
Closure properties and decision problems of dag automata. Zbl 1182.68099
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
8
2005
Unification modulo ACUI plus distributivity axioms. Zbl 1063.03006
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
2
2004
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
8
2003
ACID-unification is NEXPTIME-decidable. Zbl 1124.68370
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
2
2003
Unification modulo ACUI plus homomorphisms/distributivity. Zbl 1278.68246
Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael
1
2003
Unification of concept terms in description logics. Zbl 0970.68166
Baader, Franz; Narendran, Paliath
26
2001
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Zbl 0944.68103
Degtyarev, A.; Gurevich, Y.; Narendran, P.; Veanes, M.; Voronkov, A.
7
2000
Complexity of nilpotent unification and matching problems. Zbl 1045.68603
Guo, Qing; Narendran, Paliath; Wolfram, D. A.
1
2000
The theory of total unary RPO is decidable. Zbl 0983.68175
Narendran, Paliath; Rusinowitch, Michael
1
2000
RPO constraint solving is in NP. Zbl 0940.68070
Narendran, Paliath; Rusinowitch, Michael; Verma, Rakesh
3
1999
Decision problems in ordered rewriting. Zbl 0945.68520
Comon, H.; Narendran, P.; Nieuwenhuis, R.; Rusinowitch, M.
4
1998
The decidability of simultaneous rigid \(E\)-unification with one variable. Zbl 0903.03007
Degtyarev, Anatoli; Gurevich, Yuri; Narendran, Paliath; Veanes, Margus; Voronkov, Andrei
3
1998
Unification and matching in process algebras. Zbl 0905.68091
Guo, Qing; Narendran, Paliath; Shukla, Sandeep K.
1
1998
On the unification problem for Cartesian closed categories. Zbl 0882.03044
Narendran, Paliath; Pfenning, Frank; Statman, Richard
5
1997
The word matching problem is undecidable for finite special string-rewriting systems that are confluent. Zbl 1401.68138
Narendran, Paliath; Otto, Friedrich
2
1997
Single versus simultaneous equational unification and equational unification for variable-permuting theories. Zbl 0882.68079
Narendran, Paliath; Otto, Friedrich
2
1997
Any ground associative-commutative theory has a finite canonical system. Zbl 0878.68076
Narendran, Paliath; Rusinowitch, Michaël
8
1996
An algorithm for finding canonical sets of ground rewrite rules in polynomial time. Zbl 0779.68050
Gallier, Jean; Narendran, Paliath; Plaisted, David; Raatz, Stan; Snyder, Wayne
10
1993
On weakly confluent monadic string-rewriting systems. Zbl 0778.68049
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L.
5
1993
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
18
1992
Theorem proving using equational matings and rigid \(E\)-unification. Zbl 0799.68171
Gallier, Jean; Narendran, Paliath; Raatz, Stan; Snyder, Wayne
14
1992
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
17
1991
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
9
1991
A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061
Madlener, K.; Narendran, P.; Otto, F.
4
1991
It is undecidable whether a finite special string-rewriting system presents a group. Zbl 0749.20032
Narendran, Paliath; Ó’Dúnlaing, Colm; Otto, Friedrich
4
1991
Semi-unification. Zbl 0732.68063
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1991
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
9
1990
Rigid E-unification: NP-completeness and applications to equational matings. Zbl 0709.68080
Gallier, Jean; Narendran, Paliath; Plaisted, David; Snyder, Wayne
6
1990
It is decidable whether a monadic Thue system is canonical over a regular set. Zbl 0722.68071
Narendran, Paliath
1
1990
Cancellativity in finitely presented semigroups. Zbl 0682.20046
Narendran, Paliath; Ó’Dúnlaing, Colm
7
1989
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Zbl 0677.68050
Narendran, Paliath; Otto, Friedrich
1
1989
Church-Rosser Thue systems and formal languages. Zbl 0652.68093
McNaughton, Robert; Narendran, Paliath; Otto, Friedrich
43
1988
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
14
1988
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026
Narendran, Paliath; Otto, Friedrich
9
1988
Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025
Narendran, Paliath; Otto, Friedrich
4
1988
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
1
1988
On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
23
1987
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
18
1987
Special monoids and special Thue systems. Zbl 0618.20039
McNaughton, R.; Narendran, P.
7
1987
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
6
1987
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
10
1986
The problems of cyclic equality and conjugacy for finite complete rewriting systems. Zbl 0619.68033
Narendran, Paliath; Otto, Friedrich
8
1986
Proof by induction using test sets. Zbl 0642.68034
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
7
1986
On the regular equivalence problem for regular Thue systems. Zbl 0609.68027
Narendran, Paliath
1
1986
Complexity of sufficient-completeness. Zbl 0623.68047
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
1
1986
A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023
Kapur, Deepak; Narendran, Paliath
32
1985
The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010
Kapur, Deepak; Narendran, Paliath
21
1985
Complexity of certain decision problems about congruential languages. Zbl 0607.68055
Narendran, Paliath; Ó’Dúnlaing, Colm; Rolletschek, Heinrich
12
1985
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems. Zbl 0563.03018
Kapur, D.; Krishnamoorthy, M. S.; McNaughton, R.; Narendran, P.
11
1985
A path ordering for proving termination of term rewriting systems. Zbl 0567.68026
Kapur, D.; Narendran, P.; Sivakumar, G.
11
1985
On recursive path ordering. Zbl 0602.68031
Krishnamoorthy, M. S.; Narendran, P.
10
1985
Complexity results on the conjugacy problem for monoids. Zbl 0588.03022
Narendran, Paliath; Otto, Friedrich
10
1985
The Church-Rosser property and special Thue systems. Zbl 0586.03028
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R.
5
1985
An ideal-theoretical approach to word problems and unification problems over finitely presented commutative algebras. Zbl 0581.68039
Kandri-Rody, Abdelilah; Kapur, Deepak; Narendran, Paliath
4
1985
Complexity of matching problems. Zbl 0576.68038
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
2
1985
The undecidability of the preperfectness of Thue systems. Zbl 0545.03022
Narendran, Paliath; McNaughton, Robert
11
1984
The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Zbl 0592.03025
Narendran, Paliath; Otto, Friedrich; Winklmann, Karl
9
1984
The Knuth Bendix completion procedure and Thue systems. Zbl 0535.68012
Kapur, D.; Narendran, P.
7
1983
all top 5

Cited by 394 Authors

54 Otto, Friedrich
32 Narendran, Paliath
17 Kapur, Deepak
14 Rusinowitch, Michaël
10 Diekert, Volker
10 Kutrib, Martin
9 Baader, Franz
9 Madlener, Klaus E.
9 Meseguer Guaita, José
9 Zhang, Louxin
8 Voronkov, Andrei
7 Fernández, Maribel
7 Okhotin, Alexander
6 Ayala-Rincón, Mauricio
6 Jurdziński, Tomasz
6 Kobayashi, Yuji
6 Sobrinho, Daniele Nantes
6 Zhang, Hantao
5 Anantharaman, Siva
5 Bonacina, Maria Paola
5 Chevalier, Yannick
5 Escobar, Santiago
5 Jacquemard, Florent
5 Lohrey, Markus
5 Malcher, Andreas
5 Mráz, František
4 Comon, Hubert
4 Delaune, Stéphanie
4 Dershowitz, Nachum
4 Giesl, Jürgen
4 Guiraud, Yves
4 Gurevich, Yuri
4 Holzer, Markus
4 Kremer, Steve
4 Lynch, Christopher A.
4 Malbos, Philippe
4 McNaughton, Robert
4 Middeldorp, Aart
4 Morawska, Barbara
4 Nieuwenhuis, Robert
4 Ogata, Kazuhiro
4 Rybakov, Vladimir Vladimirovich
4 Sénizergues, Géraud
4 Vágvölgyi, Sándor
4 Winkler, Sarah
3 Borgwardt, Stefan
3 Bouhoula, Adel
3 Ciobâcă, Ştefan
3 Codish, Michael
3 de Carvalho-Segundo, Washington
3 Degtyarev, Anatoli Ivanovich
3 Freydenberger, Dominik D.
3 Futatsugi, Kokichi
3 Kirchner, Claude
3 Kirchner, Hélène
3 Malheiro, António
3 Marantidis, Pavlos
3 Meadows, Catherine A.
3 Nakamura, Masaki
3 Nipkow, Tobias
3 O’Dunlaing, Colm P.
3 Pichler, Reinhard
3 Reddy, Uday S.
3 Snyder, Wayne
2 Antimirov, Valentin M.
2 Aoto, Takahito
2 Avenhaus, Jürgen
2 Bachmair, Leo
2 Backeman, Peter
2 Bauer, Günther
2 Beckert, Bernhard
2 Binh, Nguyen Thanh
2 Bjørner, Nikolaj S.
2 Book, Ronald Vernon
2 Bronsard, Francois
2 Burckel, Serge
2 Chazarain, Jacques
2 de Moura, Leonardo
2 Durán, Francisco
2 Egly, Uwe
2 Fujiyoshi, Akio
2 Ghorani, Maryam
2 Guo, Qing
2 Hasker, Robert W.
2 Hermann, Miki
2 Hillenbrand, Thomas
2 Hirokawa, Nao
2 Hofbauer, Dieter
2 Hsiang, Jieh
2 Katsura, Masashi
2 Klay, Francis
2 Kolaitis, Phokion G.
2 Korovin, Konstantin
2 Kounalis, Emmanuel
2 Krishnamoorthy, Mukkai S.
2 Kufleitner, Manfred
2 Kuske, Dietrich
2 Lafont, Yves
2 Lescanne, Pierre
2 Lin, Hai
...and 294 more Authors
all top 5

Cited in 58 Serials

86 Theoretical Computer Science
32 Journal of Symbolic Computation
26 Information and Computation
23 Journal of Automated Reasoning
13 Information Processing Letters
8 Mathematical Systems Theory
8 Theory of Computing Systems
7 Acta Informatica
7 International Journal of Foundations of Computer Science
7 Applicable Algebra in Engineering, Communication and Computing
6 Journal of Computer and System Sciences
5 International Journal of Algebra and Computation
4 Semigroup Forum
4 MSCS. Mathematical Structures in Computer Science
4 RAIRO. Informatique Théorique et Applications
3 The Journal of Symbolic Logic
3 Transactions of the American Mathematical Society
3 RAIRO. Theoretical Informatics and Applications
2 Artificial Intelligence
2 Discrete Applied Mathematics
2 Journal of Algebra
2 Journal of Pure and Applied Algebra
2 Annals of Pure and Applied Logic
2 Formal Aspects of Computing
2 Machine Learning
2 International Journal of Computer Mathematics
2 Journal of Functional Programming
2 Annals of Mathematics and Artificial Intelligence
2 Soft Computing
2 The Journal of Logic and Algebraic Programming
2 Logical Methods in Computer Science
2 Journal of Logical and Algebraic Methods in Programming
1 Communications in Algebra
1 Discrete Mathematics
1 Mathematical Proceedings of the Cambridge Philosophical Society
1 Advances in Mathematics
1 Compositio Mathematica
1 Mathematische Zeitschrift
1 Notre Dame Journal of Formal Logic
1 Proceedings of the American Mathematical Society
1 Studia Logica
1 Journal of Computer Science and Technology
1 Cybernetics and Systems Analysis
1 Formal Methods in System Design
1 Applied Categorical Structures
1 Journal of Applied Non-Classical Logics
1 Constraints
1 Journal of Automata, Languages and Combinatorics
1 Journal of the ACM
1 Higher-Order and Symbolic Computation
1 Theory and Practice of Logic Programming
1 ACM Transactions on Computational Logic
1 Journal of Applied Logic
1 Iranian Journal of Fuzzy Systems
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Tbilisi Mathematical Journal
1 RAIRO. Theoretical Informatics and Applications
1 Journal of Siberian Federal University. Mathematics & Physics

Citations by Year