Edit Profile (opens in new tab) Narendran, Paliath Co-Author Distance Author ID: narendran.paliath Published as: Narendran, Paliath; Narendran, P. External Links: MGP Documents Indexed: 96 Publications since 1983, including 1 Additional arXiv Preprint 2 Contributions as Editor Co-Authors: 65 Co-Authors with 95 Joint Publications 1,522 Co-Co-Authors all top 5 Co-Authors 3 single-authored 29 Kapur, Deepak 19 Otto, Friedrich 19 Rusinowitch, Michaël 12 Anantharaman, Siva 9 Lynch, Christopher A. 9 Marshall, Andrew M. 6 Erbatur, Serdar 6 Meadows, Catherine A. 5 McNaughton, Robert 5 Zhang, Hantao 4 Gallier, Jean H. 4 Lin, Hai 4 Ravishankar, Veena 4 Snyder, Wayne 3 Bouchard, Christopher 3 Guo, Qing 3 Krishnamoorthy, Mukkai S. 3 Musser, David R. 3 O’Dunlaing, Colm P. 3 Plaisted, David Alan 3 Raatz, Stan 3 Ringeissen, Christophe 3 Stillman, Jonathan 2 Benanav, Dan 2 Comon, Hubert 2 Degtyarev, Anatoli Ivanovich 2 Dougherty, Daniel J. 2 Gurevich, Yuri 2 Madlener, Klaus E. 2 Nieuwenhuis, Robert 2 Rozek, Brandon 2 Veanes, Margus 2 Wang, Lida 2 Wolfram, David A. 1 Baader, Franz 1 Boy de la Tour, Thierry 1 Carle, Benjamin 1 Chichester, Dalton 1 Corcoran, John 1 Cornell, Kimberly A. 1 Du, Wei 1 Echenim, Mnacho 1 Escobar, Santiago 1 Gero, Kimberly A. 1 Hibbs, Peter 1 Kandri-Rody, Abdelilah 1 Kauffman, Raymond 1 Kim, Dohan 1 Kremer, Steve 1 Liu, Zhiqiang 1 Meseguer Guaita, José 1 Pfenning, Frank 1 Rolletschek, Heinrich 1 Rosenkrantz, Daniel J. 1 Rovira, Luis 1 Santiago, Sonia 1 Sasse, Ralf 1 Shukla, Sandeep Kumar 1 Sivakumar, G. D. 1 Statman, Richard 1 Thomas, Wolfgang 1 Verma, Rakesh M. 1 Voronkov, Andrei 1 Winklmann, Karl 1 Zhang, Louxin all top 5 Serials 14 Theoretical Computer Science 5 Journal of Symbolic Computation 5 Journal of Automated Reasoning 4 Information and Computation 3 Acta Informatica 3 Journal of the Association for Computing Machinery 2 Information Processing Letters 2 Journal of Automata, Languages and Combinatorics 2 Logical Methods in Computer Science 1 Discrete Mathematics 1 Information and Control 1 Journal of Algebra 1 Journal of Computer and System Sciences 1 The Journal of Symbolic Logic 1 Mathematical Systems Theory 1 SIAM Journal on Computing 1 SIGSAM Bulletin 1 Annales Societatis Mathematicae Polonae. Series IV 1 Bulletin of the European Association for Theoretical Computer Science EATCS 1 ACM Transactions on Computational Logic 1 Lecture Notes in Computer Science all top 5 Fields 88 Computer science (68-XX) 46 Mathematical logic and foundations (03-XX) 14 Information and communication theory, circuits (94-XX) 9 Group theory and generalizations (20-XX) 2 General and overarching topics; collections (00-XX) 2 Commutative algebra (13-XX) 1 History and biography (01-XX) 1 General algebraic systems (08-XX) 1 Category theory; homological algebra (18-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 81 Publications have been cited 727 times in 524 Documents Cited by ▼ Year ▼ Church-Rosser Thue systems and formal languages. Zbl 0652.68093 McNaughton, Robert; Narendran, Paliath; Otto, Friedrich 52 1988 On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 41 1987 A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023 Kapur, Deepak; Narendran, Paliath 38 1985 Unification of concept terms in description logics. Zbl 0970.68166 Baader, Franz; Narendran, Paliath 33 2001 The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010 Kapur, Deepak; Narendran, Paliath 25 1985 Complexity of unification problems with associative-commutative operators. Zbl 0781.68076 Kapur, Deepak; Narendran, Paliath 24 1992 Complexity of matching problems. Zbl 0638.68036 Benanav, Dan; Kapur, Deepak; Narendran, Paliath 23 1987 Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029 Kapur, Deepak; Musser, David R.; Narendran, Paliath 23 1988 Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032 Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao 20 1991 Proof by induction using test sets. Zbl 0642.68034 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 17 1986 Theorem proving using equational matings and rigid \(E\)-unification. Zbl 0799.68171 Gallier, Jean; Narendran, Paliath; Raatz, Stan; Snyder, Wayne 17 1992 A path ordering for proving termination of term rewriting systems. Zbl 0567.68026 Kapur, D.; Narendran, P.; Sivakumar, G. 16 1985 On ground-confluence of term rewriting systems. Zbl 0699.68041 Kapur, Deepak; Narendran, Paliath; Otto, Friedrich 16 1990 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 16 1993 NP-completeness of the set unification and matching problems. Zbl 0643.68054 Kapur, Deepak; Narendran, Paliath 15 1986 Complexity of certain decision problems about congruential languages. Zbl 0607.68055 Narendran, Paliath; Ó’Dúnlaing, Colm; Rolletschek, Heinrich 14 1985 On forward closure and the finite variant property. Zbl 1398.68271 Bouchard, Christopher; Gero, Kimberly A.; Lynch, Christopher; Narendran, Paliath 14 2013 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. 13 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 12 1985 On recursive path ordering. Zbl 0602.68031 Krishnamoorthy, M. S.; Narendran, P. 12 1985 Automating inductionless induction using test sets. Zbl 0724.68079 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 12 1991 Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026 Narendran, Paliath; Otto, Friedrich 11 1988 The undecidability of the preperfectness of Thue systems. Zbl 0545.03022 Narendran, Paliath; McNaughton, Robert 11 1984 Closure properties and decision problems of dag automata. Zbl 1182.68099 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 11 2005 Complexity results on the conjugacy problem for monoids. Zbl 0588.03022 Narendran, Paliath; Otto, Friedrich 11 1985 Matching, unification and complexity. Zbl 0626.68036 Kapur, Deepak; Narendran, Paliath 10 1987 The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Zbl 0592.03025 Narendran, Paliath; Otto, Friedrich; Winklmann, Karl 10 1984 Intruders with caps. Zbl 1203.94091 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 10 2007 Any ground associative-commutative theory has a finite canonical system. Zbl 1509.03044 Narendran, Paliath; Rusinowitch, Michaël 10 1991 An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537 Kapur, Deepak; Narendran, Paliath; Wang, Lida 9 2003 On extended regular expressions. Zbl 1234.68202 Carle, Benjamin; Narendran, Paliath 9 2009 Any ground associative-commutative theory has a finite canonical system. Zbl 0878.68076 Narendran, Paliath; Rusinowitch, Michaël 9 1996 Cancellativity in finitely presented semigroups. Zbl 0682.20046 Narendran, Paliath; Ó’Dúnlaing, Colm 8 1989 Special monoids and special Thue systems. Zbl 0618.20039 McNaughton, R.; Narendran, P. 8 1987 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 Rigid E-unification: NP-completeness and applications to equational matings. Zbl 0709.68080 Gallier, Jean; Narendran, Paliath; Plaisted, David; Snyder, Wayne 7 1990 On weakly confluent monadic string-rewriting systems. Zbl 0778.68049 Madlener, K.; Narendran, P.; Otto, F.; Zhang, L. 7 1993 On the unification problem for Cartesian closed categories. Zbl 0882.03044 Narendran, Paliath; Pfenning, Frank; Statman, Richard 6 1997 A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061 Madlener, K.; Narendran, P.; Otto, F. 6 1991 Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025 Narendran, Paliath; Otto, Friedrich 5 1988 Complexity of matching problems. Zbl 0576.68038 Benanav, Dan; Kapur, Deepak; Narendran, Paliath 5 1985 The Church-Rosser property and special Thue systems. Zbl 0586.03028 Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R. 5 1985 Some results on equational unification. Zbl 1509.68122 Narendran, Paliath; Otto, Friedrich 5 1990 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 5 2013 Decision problems in ordered rewriting. Zbl 0945.68520 Comon, H.; Narendran, P.; Nieuwenhuis, R.; Rusinowitch, M. 4 1998 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 Unification over distributive exponentiation (sub)theories. Zbl 1345.68190 Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath 4 2011 Semi-unification. Zbl 0667.68042 Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan 3 1988 RPO constraint solving is in NP. Zbl 0940.68070 Narendran, Paliath; Rusinowitch, Michael; Verma, Rakesh 3 1999 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 It is decidable whether a monadic Thue system is canonical over a regular set. Zbl 0722.68071 Narendran, Paliath 3 1990 Unification modulo homomorphic encryption. Zbl 1242.68096 Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael 3 2012 Hierarchical combination. Zbl 1381.68265 Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe 3 2013 Reviving basic narrowing modulo. Zbl 1435.68371 Kim, Dohan; Lynch, Christopher; Narendran, Paliath 3 2019 Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems. Zbl 07497926 Lin, Hai; Lynch, Christopher; Marshall, Andrew M.; Meadows, Catherine A.; Narendran, Paliath; Ravishankar, Veena; Rozek, Brandon 3 2021 Unification and matching modulo nilpotence. Zbl 1412.68229 Guo, Qing; Narendran, Paliath; Wolfram, D. A. 3 1996 Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time. Zbl 0661.68093 Gallier, Jean; Narendran, Paliath; Plaisted, David; Raatz, Stan; Snyder, Wayne 2 1988 Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Zbl 0677.68050 Narendran, Paliath; Otto, Friedrich 2 1989 Unification modulo homomorphic encryption. Zbl 1193.68231 Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michaël 2 2009 Unification modulo ACUI plus distributivity axioms. Zbl 1063.03006 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 2 2004 Semi-unification. Zbl 0732.68063 Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan 2 1991 Single versus simultaneous equational unification and equational unification for variable-permuting theories. Zbl 0882.68079 Narendran, Paliath; Otto, Friedrich 2 1997 ACID-unification is NEXPTIME-decidable. Zbl 1124.68370 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 2 2003 Unification and matching in hierarchical combinations of syntactic theories. Zbl 1471.68108 Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe 2 2015 On unification modulo one-sided distributivity: algorithms, variants and asymmetry. Zbl 1391.68065 Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath 2 2015 It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair. Zbl 1494.68119 Narendran, Paliath; Stillman, Jonathan 2 1989 The word matching problem is undecidable for finite special string-rewriting systems that are confluent. Zbl 1401.68138 Narendran, Paliath; Otto, Friedrich 2 1997 Asymmetric unification and disunification. Zbl 1444.68088 Ravishankar, Veena; Cornell, Kimberly A.; Narendran, Paliath 2 2019 Unification modulo synchronous distributivity. Zbl 1358.03026 Anantharaman, Siva; Erbatur, Serdar; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael 1 2012 Unification and matching in process algebras. Zbl 0905.68091 Guo, Qing; Narendran, Paliath; Shukla, Sandeep K. 1 1998 Unification modulo ACUI plus homomorphisms/distributivity. Zbl 1278.68246 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 1 2003 The theory of total unary RPO is decidable. Zbl 0983.68175 Narendran, Paliath; Rusinowitch, Michael 1 2000 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 Deciding the confluence of ordered term rewrite systems. Zbl 1365.68298 Comon, Hubert; Narendran, Paliath; Nieuwenhuis, Robert; Rusinowitch, Michael 1 2003 Complexity of nilpotent unification and matching problems. Zbl 1045.68603 Guo, Qing; Narendran, Paliath; Wolfram, D. A. 1 2000 Some independence results for equational unification. Zbl 1503.68146 Otto, Friedrich; Narendran, Paliath; Dougherty, Daniel J. 1 1995 Unification modulo lists with reverse relation with certain word equations. Zbl 07178966 Anantharaman, Siva; Hibbs, Peter; Narendran, Paliath; Rusinowitch, Michael 1 2019 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 Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems. Zbl 07497926 Lin, Hai; Lynch, Christopher; Marshall, Andrew M.; Meadows, Catherine A.; Narendran, Paliath; Ravishankar, Veena; Rozek, Brandon 3 2021 Reviving basic narrowing modulo. Zbl 1435.68371 Kim, Dohan; Lynch, Christopher; Narendran, Paliath 3 2019 Asymmetric unification and disunification. Zbl 1444.68088 Ravishankar, Veena; Cornell, Kimberly A.; Narendran, Paliath 2 2019 Unification modulo lists with reverse relation with certain word equations. Zbl 07178966 Anantharaman, Siva; Hibbs, Peter; Narendran, Paliath; Rusinowitch, Michael 1 2019 Unification and matching in hierarchical combinations of syntactic theories. Zbl 1471.68108 Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe 2 2015 On unification modulo one-sided distributivity: algorithms, variants and asymmetry. Zbl 1391.68065 Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath 2 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 14 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 5 2013 Hierarchical combination. Zbl 1381.68265 Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe 3 2013 Unification modulo homomorphic encryption. Zbl 1242.68096 Anantharaman, Siva; Lin, Hai; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael 3 2012 Unification modulo synchronous distributivity. Zbl 1358.03026 Anantharaman, Siva; Erbatur, Serdar; Lynch, Christopher; Narendran, Paliath; Rusinowitch, Michael 1 2012 Unification over distributive exponentiation (sub)theories. Zbl 1345.68190 Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath 4 2011 On extended regular expressions. Zbl 1234.68202 Carle, Benjamin; Narendran, Paliath 9 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 10 2007 Closure properties and decision problems of dag automata. Zbl 1182.68099 Anantharaman, Siva; Narendran, Paliath; Rusinowitch, Michael 11 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 9 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 Deciding the confluence of ordered term rewrite systems. Zbl 1365.68298 Comon, Hubert; Narendran, Paliath; Nieuwenhuis, Robert; Rusinowitch, Michael 1 2003 Unification of concept terms in description logics. Zbl 0970.68166 Baader, Franz; Narendran, Paliath 33 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 The theory of total unary RPO is decidable. Zbl 0983.68175 Narendran, Paliath; Rusinowitch, Michael 1 2000 Complexity of nilpotent unification and matching problems. Zbl 1045.68603 Guo, Qing; Narendran, Paliath; Wolfram, D. A. 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 6 1997 Single versus simultaneous equational unification and equational unification for variable-permuting theories. Zbl 0882.68079 Narendran, Paliath; Otto, Friedrich 2 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 Any ground associative-commutative theory has a finite canonical system. Zbl 0878.68076 Narendran, Paliath; Rusinowitch, Michaël 9 1996 Unification and matching modulo nilpotence. Zbl 1412.68229 Guo, Qing; Narendran, Paliath; Wolfram, D. A. 3 1996 Some independence results for equational unification. Zbl 1503.68146 Otto, Friedrich; Narendran, Paliath; Dougherty, Daniel J. 1 1995 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 16 1993 On weakly confluent monadic string-rewriting systems. Zbl 0778.68049 Madlener, K.; Narendran, P.; Otto, F.; Zhang, L. 7 1993 Complexity of unification problems with associative-commutative operators. Zbl 0781.68076 Kapur, Deepak; Narendran, Paliath 24 1992 Theorem proving using equational matings and rigid \(E\)-unification. Zbl 0799.68171 Gallier, Jean; Narendran, Paliath; Raatz, Stan; Snyder, Wayne 17 1992 Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032 Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao 20 1991 Automating inductionless induction using test sets. Zbl 0724.68079 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 12 1991 Any ground associative-commutative theory has a finite canonical system. Zbl 1509.03044 Narendran, Paliath; Rusinowitch, Michaël 10 1991 A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061 Madlener, K.; Narendran, P.; Otto, F. 6 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 16 1990 Rigid E-unification: NP-completeness and applications to equational matings. Zbl 0709.68080 Gallier, Jean; Narendran, Paliath; Plaisted, David; Snyder, Wayne 7 1990 Some results on equational unification. Zbl 1509.68122 Narendran, Paliath; Otto, Friedrich 5 1990 It is decidable whether a monadic Thue system is canonical over a regular set. Zbl 0722.68071 Narendran, Paliath 3 1990 Cancellativity in finitely presented semigroups. Zbl 0682.20046 Narendran, Paliath; Ó’Dúnlaing, Colm 8 1989 Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Zbl 0677.68050 Narendran, Paliath; Otto, Friedrich 2 1989 It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair. Zbl 1494.68119 Narendran, Paliath; Stillman, Jonathan 2 1989 Church-Rosser Thue systems and formal languages. Zbl 0652.68093 McNaughton, Robert; Narendran, Paliath; Otto, Friedrich 52 1988 Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029 Kapur, Deepak; Musser, David R.; Narendran, Paliath 23 1988 Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026 Narendran, Paliath; Otto, Friedrich 11 1988 Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025 Narendran, Paliath; Otto, Friedrich 5 1988 Semi-unification. Zbl 0667.68042 Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan 3 1988 Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time. Zbl 0661.68093 Gallier, Jean; Narendran, Paliath; Plaisted, David; Raatz, Stan; Snyder, Wayne 2 1988 On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 41 1987 Complexity of matching problems. Zbl 0638.68036 Benanav, Dan; Kapur, Deepak; Narendran, Paliath 23 1987 Matching, unification and complexity. Zbl 0626.68036 Kapur, Deepak; Narendran, Paliath 10 1987 Special monoids and special Thue systems. Zbl 0618.20039 McNaughton, R.; Narendran, P. 8 1987 Proof by induction using test sets. Zbl 0642.68034 Kapur, Deepak; Narendran, Paliath; Zhang, Hantao 17 1986 NP-completeness of the set unification and matching problems. Zbl 0643.68054 Kapur, Deepak; Narendran, Paliath 15 1986 The problems of cyclic equality and conjugacy for finite complete rewriting systems. Zbl 0619.68033 Narendran, Paliath; Otto, Friedrich 8 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 38 1985 The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010 Kapur, Deepak; Narendran, Paliath 25 1985 A path ordering for proving termination of term rewriting systems. Zbl 0567.68026 Kapur, D.; Narendran, P.; Sivakumar, G. 16 1985 Complexity of certain decision problems about congruential languages. Zbl 0607.68055 Narendran, Paliath; Ó’Dúnlaing, Colm; Rolletschek, Heinrich 14 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. 13 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 12 1985 On recursive path ordering. Zbl 0602.68031 Krishnamoorthy, M. S.; Narendran, P. 12 1985 Complexity results on the conjugacy problem for monoids. Zbl 0588.03022 Narendran, Paliath; Otto, Friedrich 11 1985 Complexity of matching problems. Zbl 0576.68038 Benanav, Dan; Kapur, Deepak; Narendran, Paliath 5 1985 The Church-Rosser property and special Thue systems. Zbl 0586.03028 Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R. 5 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 10 1984 The Knuth Bendix completion procedure and Thue systems. Zbl 0535.68012 Kapur, D.; Narendran, P. 7 1983 all cited Publications top 5 cited Publications all top 5 Cited by 487 Authors 62 Otto, Friedrich 38 Narendran, Paliath 22 Kapur, Deepak 17 Rusinowitch, Michaël 16 Baader, Franz 16 Kutrib, Martin 13 Diekert, Volker 13 Escobar, Santiago 12 Meseguer Guaita, José 9 Fernández, Maribel 9 Madlener, Klaus E. 9 Malcher, Andreas 9 Zhang, Louxin 8 Ayala-Rincón, Mauricio 8 Dershowitz, Nachum 8 Okhotin, Alexander 8 Sobrinho, Daniele Nantes 8 Voronkov, Andrei 7 Holzer, Markus 7 Lynch, Christopher A. 7 Nieuwenhuis, Robert 7 Rybakov, Vladimir Vladimirovich 7 Zhang, Hantao 6 Anantharaman, Siva 6 Bonacina, Maria Paola 6 Chevalier, Yannick 6 Jurdziński, Tomasz 6 Kobayashi, Yuji 6 Mráz, František 6 Reddy, Uday S. 6 Sapiña, Julia 6 Sénizergues, Géraud 6 Winkler, Sarah 5 Bündgen, Reinhard 5 Comon, Hubert 5 Hofbauer, Dieter 5 Jacquemard, Florent 5 Lohrey, Markus 5 Meadows, Catherine A. 5 Snyder, Wayne 4 Alpuente, María 4 de Carvalho-Segundo, Washington 4 Delaune, Stéphanie 4 Giesl, Jürgen 4 Guiraud, Yves 4 Gurevich, Yuri 4 Jouannaud, Jean-Pierre 4 Kirchner, Claude 4 Kirchner, Hélène 4 Kremer, Steve 4 Malbos, Philippe 4 Marshall, Andrew M. 4 Martin, Ursula 4 McNaughton, Robert 4 Middeldorp, Aart 4 Morawska, Barbara 4 Nipkow, Tobias 4 Ogata, Kazuhiro 4 Rubio, Albert 4 Vágvölgyi, Sándor 4 Weidenbach, Christoph 4 Wendlandt, Matthias 3 Aoto, Takahito 3 Avenhaus, Jürgen 3 Bachmair, Leo 3 Backeman, Peter 3 Ballis, Demis 3 Bjørner, Nikolaj S. 3 Borgwardt, Stefan 3 Bouhoula, Adel 3 Bronsard, Francois 3 Ciobâcă, Ştefan 3 Codish, Michael 3 de Moura, Leonardo 3 Degtyarev, Anatoli Ivanovich 3 Durán, Francisco 3 Erbatur, Serdar 3 Freydenberger, Dominik D. 3 Futatsugi, Kokichi 3 Hermann, Miki 3 Hsiang, Jieh 3 Klop, Jan Willem 3 Kounalis, Emmanuel 3 Lin, Hai 3 Malheiro, António 3 Marantidis, Pavlos 3 Nakamura, Masaki 3 Nyberg-Brodda, Carl-Fredrik 3 O’Dunlaing, Colm P. 3 Pichler, Reinhard 3 Ramakrishnan, I. V. 3 Ringeissen, Christophe 3 Rümmer, Philipp 3 Schmidt-Schauß, Manfred 3 Steinbach, Joachim 3 Tison, Sophie 2 Akutsu, Tatsuya 2 Antimirov, Valentin M. 2 Balbiani, Philippe 2 Bauer, Günther ...and 387 more Authors all top 5 Cited in 66 Serials 89 Theoretical Computer Science 34 Journal of Symbolic Computation 29 Information and Computation 26 Journal of Automated Reasoning 15 Information Processing Letters 8 Acta Informatica 8 Mathematical Systems Theory 8 International Journal of Foundations of Computer Science 8 Theory of Computing Systems 7 Applicable Algebra in Engineering, Communication and Computing 6 Journal of Computer and System Sciences 6 MSCS. Mathematical Structures in Computer Science 6 Logical Methods in Computer Science 5 Semigroup Forum 5 International Journal of Algebra and Computation 5 Journal of Logical and Algebraic Methods in Programming 4 RAIRO. Informatique Théorique et Applications 3 Journal of Algebra 3 The Journal of Symbolic Logic 3 Transactions of the American Mathematical Society 3 Machine Learning 3 Annals of Mathematics and Artificial Intelligence 3 RAIRO. Theoretical Informatics and Applications 2 Artificial Intelligence 2 Discrete Applied Mathematics 2 Journal of Pure and Applied Algebra 2 Annals of Pure and Applied Logic 2 Formal Aspects of Computing 2 International Journal of Computer Mathematics 2 Journal of Functional Programming 2 Journal of Automata, Languages and Combinatorics 2 Soft Computing 2 Fundamenta Informaticae 2 The Journal of Logic and Algebraic Programming 2 Theory and Practice of Logic Programming 2 RAIRO. Theoretical Informatics and Applications 2 Journal of Siberian Federal University. Mathematics & Physics 1 Communications in Algebra 1 Discrete Mathematics 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Advances in Mathematics 1 Algebra and Logic 1 Compositio Mathematica 1 Mathematische Zeitschrift 1 Notre Dame Journal of Formal Logic 1 Proceedings of the American Mathematical Society 1 Siberian Mathematical Journal 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 Graph Algorithms and Applications 1 Journal of the ACM 1 Higher-Order and Symbolic Computation 1 Journal of the Australian Mathematical Society 1 Journal of Systems Science and Complexity 1 ACM Transactions on Computational Logic 1 Journal of Applied Logic 1 Iranian Journal of Fuzzy Systems 1 Sibirskie Èlektronnye Matematicheskie Izvestiya 1 Logica Universalis 1 Tbilisi Mathematical Journal 1 Journal of Membrane Computing all top 5 Cited in 17 Fields 467 Computer science (68-XX) 175 Mathematical logic and foundations (03-XX) 65 Group theory and generalizations (20-XX) 23 Information and communication theory, circuits (94-XX) 13 Category theory; homological algebra (18-XX) 9 General algebraic systems (08-XX) 7 Commutative algebra (13-XX) 6 Combinatorics (05-XX) 6 Associative rings and algebras (16-XX) 5 Order, lattices, ordered algebraic structures (06-XX) 2 History and biography (01-XX) 1 Number theory (11-XX) 1 Field theory and polynomials (12-XX) 1 Algebraic geometry (14-XX) 1 Nonassociative rings and algebras (17-XX) 1 Special functions (33-XX) 1 Algebraic topology (55-XX) Citations by Year