default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaliath Narendran
Person information
- affiliation: University at Albany, SUNY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c78]Serdar Erbatur
, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Deciding Knowledge Problems Modulo Classes of Permutative Theories. LOPSTR 2024: 47-63- [c77]Josué A. Ruiz, Paliath Narendran, Amir Masoumzadeh, Padmavathi Iyer:
Converting Rule-Based Access Control Policies: From Complemented Conditions to Deny Rules. SACMAT 2024 - 2023
- [i8]Deepak Kapur, Paliath Narendran:
Existence and Construction of a Gröbner Basis for a Polynomial Ideal. CoRR abs/2306.09602 (2023) - 2022
- [j54]Padmavathi Iyer, Amirreza Masoumzadeh, Paliath Narendran:
On the Expressive Power of Negated Conditions and Negative Authorizations in Access Control Models. Comput. Secur. 116: 102586 (2022) - [c76]Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek:
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF 2022: 147-161 - 2021
- [c75]Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek:
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. FroCoS 2021: 253-270 - [c74]Amirreza Masoumzadeh, Paliath Narendran, Padmavathi Iyer:
Towards a Theory for Semantics and Expressiveness Analysis of Rule-Based Access Control Models. SACMAT 2021: 33-43 - [i7]Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran, Andrew Pulver:
On Problems Dual to Unification: The String-Rewriting Case. CoRR abs/2103.00386 (2021) - 2020
- [c73]Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek:
Algorithmic Problems in Synthesized Cryptosystems (Extended Abstract). UNIF 2020: 10:1-10:6 - [c72]Paliath Narendran, Saumya Arora, Yu Zhang:
An Improved Algorithm for Testing Whether a Special String Rewriting System is Confluent. UNIF 2020: 11:1-11:6 - [c71]Paliath Narendran, Ashley Suchy, Yu Zhang:
Some Results on Prefix Grammars. UNIF 2020: 12:1-12:6
2010 – 2019
- 2019
- [c70]Veena Ravishankar, Kimberly A. Cornell, Paliath Narendran:
Asymmetric Unification and Disunification. Description Logic, Theory Combination, and All That 2019: 497-522 - [c69]Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Lists with Reverse Relation with Certain Word Equations. CADE 2019: 1-17 - [c68]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos 2019: 297-312 - [c67]Dohan Kim, Christopher Lynch, Paliath Narendran:
Reviving Basic Narrowing Modulo. FroCos 2019: 313-329 - [i6]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR abs/1907.00227 (2019) - 2017
- [i5]Veena Ravishankar, Kimberly A. Gero, Paliath Narendran:
Asymmetric Unification and Disunification. CoRR abs/1706.05066 (2017) - [i4]Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran:
On Problems Dual to Unification. CoRR abs/1706.05607 (2017) - 2016
- [c66]Daniel S. Hono II, Paliath Narendran, Rafael Veras:
Lynch-Morawska Systems on Strings. UNIF 2016: 19-24 - [c65]Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam:
Notes on Lynch-Morawska Systems. UNIF 2016: 25-30 - [i3]Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam:
Notes on Lynch-Morawska Systems. CoRR abs/1604.06139 (2016) - [i2]Daniel S. Hono II, Paliath Narendran, Rafael Veras:
Lynch-Morawska Systems on Strings. CoRR abs/1604.06509 (2016) - 2015
- [j53]Andrew M. Marshall, Catherine Meadows, Paliath Narendran:
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. Log. Methods Comput. Sci. 11(2) (2015) - [c64]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos 2015: 291-306 - 2014
- [j52]Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch:
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. Log. Methods Comput. Sci. 10(1) (2014) - [j51]John Corcoran, Paliath Narendran, Wolfgang Thomas:
Obituary Robert McNaughton 1924 - 2014. Bull. EATCS 114 (2014) - [j50]Steve Kremer, Paliath Narendran:
Foreword to the special issue on security and rewriting techniques. Inf. Comput. 238: 1 (2014) - [c63]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS 2014: 274-288 - [c62]Fan Yang, Santiago Escobar, Catherine Meadows, José Meseguer, Paliath Narendran:
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property. PPDP 2014: 123-133 - [c61]Peter Hibbs, Paliath Narendran, Shweta Mehto:
Unification Modulo Common List Functions. UNIF 2014: 15-21 - [c60]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF 2014: 33-35 - [c59]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF 2014: 36-40 - 2013
- [c58]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE 2013: 231-248 - [c57]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination. CADE 2013: 249-266 - [c56]Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran:
On Forward Closure and the Finite Variant Property. FroCos 2013: 327-342 - [c55]Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, Paliath Narendran:
Unication Problems Modulo a Theory of Until. UNIF@RTA/TLCA 2013: 22-29 - [c54]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA 2013: 30-34 - 2012
- [j49]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. J. Autom. Reason. 48(2): 135-158 (2012) - [c53]Serdar Erbatur, Santiago Escobar, Paliath Narendran:
The use of types in designing unification algorithms: two case studies. UNIF 2012: 7-16 - [c52]Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Synchronous Distributivity. IJCAR 2012: 14-29 - [c51]Kimberly A. Gero, Christopher Bouchard, Paliath Narendran:
Some Notes on Basic Syntactic Mutation. UNIF 2012: 17-27 - [c50]Andrew M. Marshall, Paliath Narendran:
New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. IJCAR 2012: 408-422 - [c49]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS 2012: 73-90 - [c48]Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Chaining. LATA 2012: 70-82 - 2011
- [j48]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
String Rewriting and Security Analysis: An Extension of a Result of Book and Otto. J. Autom. Lang. Comb. 16(2-4): 75-90 (2011) - [j47]Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran:
Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. 16(2-4): 109-140 (2011) - [c47]Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse:
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP 2011: 65-76 - [c46]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF 2011: 59-64 - [i1]Serdar Erbatur, Christopher Lynch, Paliath Narendran:
Unification in a Theory of Blind Signatures. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 31-44 - 2010
- [c45]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS 2010: 192-203 - [c44]Deepak Kapur, Andrew M. Marshall, Paliath Narendran:
Unification modulo a partial theory of exponentiation. UNIF 2010: 12-23 - [c43]Paliath Narendran, Andrew M. Marshall, Bibhu Mahapatra:
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity. UNIF 2010: 54-63
2000 – 2009
- 2009
- [c42]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. FroCoS 2009: 100-116 - [c41]Benjamin Carle, Paliath Narendran:
On Extended Regular Expressions. LATA 2009: 279-289 - 2008
- [c40]Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran:
Unification and Matching Modulo Leaf-Permutative Equational Presentations. IJCAR 2008: 332-347 - [c39]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification modulo Homomorphic Encryption is Decidable. UNIF 2008: 1-15 - 2007
- [c38]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Intruders with Caps. RTA 2007: 20-35 - 2005
- [j46]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5): 231-240 (2005) - [c37]Deepak Kapur, Paliath Narendran, Lida Wang:
A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning 2005: 433-451 - 2004
- [j45]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo ACUI Plus Distributivity Axioms. J. Autom. Reason. 33(1): 1-28 (2004) - 2003
- [j44]Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch:
Deciding the confluence of ordered term rewrite systems. ACM Trans. Comput. Log. 4(1): 33-55 (2003) - [c36]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo ACU I Plus Homomorphisms/Distributivity. CADE 2003: 442-457 - [c35]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable. MFCS 2003: 169-178 - [c34]Deepak Kapur, Paliath Narendran, Lida Wang:
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA 2003: 165-179 - 2002
- [j43]Paliath Narendran, Michaël Rusinowitch:
Guest Editorial. Inf. Comput. 178(2): 345 (2002) - 2001
- [j42]Franz Baader, Paliath Narendran:
Unification of Concept Terms in Description Logics. J. Symb. Comput. 31(3): 277-305 (2001) - 2000
- [j41]Qing Guo, Paliath Narendran, David A. Wolfram:
Complexity of Nilpotent Unification and Matching Problems. Inf. Comput. 162(1-2): 3-23 (2000) - [j40]Paliath Narendran:
Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages). SIGACT News 31(3): 24-26 (2000) - [j39]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000) - [c33]Paliath Narendran, Michaël Rusinowitch:
The Theory of Total Unary RPO Is Decidable. Computational Logic 2000: 660-672
1990 – 1999
- 1999
- [e1]Paliath Narendran, Michaël Rusinowitch:
Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings. Lecture Notes in Computer Science 1631, Springer 1999, ISBN 3-540-66201-4 [contents] - 1998
- [j38]Friedrich Otto, Paliath Narendran, Daniel J. Dougherty:
Equational Unification, Word Unification, and 2nd-Order Equational Unification. Theor. Comput. Sci. 198(1-2): 1-47 (1998) - [c32]Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma:
RPO Constraint Solving Is in NP. CSL 1998: 385-398 - [c31]Franz Baader, Paliath Narendran:
Unification of Concept Terms in Description Logics. ECAI 1998: 331-335 - [c30]Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch:
Decision Problems in Ordered Rewriting. LICS 1998: 276-286 - [c29]Qing Guo, Paliath Narendran, Sandeep K. Shukla:
Unification and Matching in Process Algebras. RTA 1998: 91-105 - [c28]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 - 1997
- [j37]Paliath Narendran, Friedrich Otto:
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. J. Autom. Reason. 19(1): 87-115 (1997) - [j36]Paliath Narendran, Frank Pfenning, Richard Statman:
On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62(2): 636-647 (1997) - [c27]Franz Baader, Paliath Narendran:
Unification of Concept Terms in Description Logics. Description Logics 1997 - [c26]Paliath Narendran, Friedrich Otto:
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. ICALP 1997: 638-648 - 1996
- [j35]Paliath Narendran:
Unification Modulo ACI + 1 + 0. Fundam. Informaticae 25(1): 49-57 (1996) - [j34]Paliath Narendran, Michaël Rusinowitch:
Any Ground Associative-Commutative Theory Has a Finite Canonical System. J. Autom. Reason. 17(1): 131-143 (1996) - [c25]Qing Guo, Paliath Narendran, David A. Wolfram:
Unification and Matching Modulo Nilpotence. CADE 1996: 261-274 - [c24]Paliath Narendran:
Solving Linear Equations over Polynomial Semirings. LICS 1996: 466-472 - 1995
- [c23]Seth Chaiken, Paliath Narendran:
The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation. ISCAS 1995: 1239-1242 - [c22]Friedrich Otto, Paliath Narendran, Daniel J. Dougherty:
Some Independent Results for Equational Unification. RTA 1995: 367-381 - 1994
- [j33]Friedrich Otto, Paliath Narendran:
Codes Modulo Finite Monadic String-Rewriting Systems. Theor. Comput. Sci. 134(1): 175-188 (1994) - [c21]David Cyrluk, Paliath Narendran:
Ground Temporal Logic: A Logic for Hardware Verification. CAV 1994: 247-259 - 1993
- [j32]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder:
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. J. ACM 40(1): 1-16 (1993) - [j31]Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113(1): 119-165 (1993) - [c20]Paliath Narendran, Frank Pfenning, Richard Statman:
On the Unification Problem for Cartesian Closed Categories. LICS 1993: 57-63 - [c19]Paliath Narendran, Michaël Rusinowitch:
The Unifiability Problem in Ground AC Theories. LICS 1993: 364-370 - 1992
- [j30]Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder:
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39(2): 377-429 (1992) - [j29]Deepak Kapur, Paliath Narendran:
Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reason. 9(2): 261-288 (1992) - [c18]Deepak Kapur, Paliath Narendran:
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers. LICS 1992: 11-21 - 1991
- [j28]Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4): 311-350 (1991) - [j27]Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto:
It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. 98(2): 153-159 (1991) - [j26]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11(1/2): 81-111 (1991) - [j25]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. Theor. Comput. Sci. 81(2): 169-187 (1991) - [c17]Klaus Madlener, Paliath Narendran, Friedrich Otto:
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP 1991: 279-290 - [c16]Paliath Narendran, Michaël Rusinowitch:
Any Gound Associative-Commutative Theory Has a Finite Canonical System. RTA 1991: 423-434 - 1990
- [j24]Deepak Kapur, Paliath Narendran, Friedrich Otto:
On Ground-Confluence of Term Rewriting Systems. Inf. Comput. 86(1): 14-31 (1990) - [j23]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder:
Rigid E-Unification: NP-Completeness and Applications to Equational Matings. Inf. Comput. 87(1/2): 129-195 (1990) - [j22]Paliath Narendran:
It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set. Math. Syst. Theory 23(4): 245-254 (1990) - [c15]Paliath Narendran, Friedrich Otto:
Some Results on Equational Unification. CADE 1990: 276-291
1980 – 1989
- 1989
- [j21]Paliath Narendran, Colm Ó'Dúnlaing:
Cancellativity in Finitely Presented Semigroups. J. Symb. Comput. 7(5): 457-472 (1989) - [j20]Paliath Narendran, Friedrich Otto:
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. Theor. Comput. Sci. 68(3): 319-332 (1989) - [c14]Paliath Narendran, Jonathan Stillman:
It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. STACS 1989: 348-359 - 1988
- [j19]Paliath Narendran, Friedrich Otto:
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems. Acta Informatica 25(5): 573-591 (1988) - [j18]Paliath Narendran, Friedrich Otto:
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. Inf. Process. Lett. 29(3): 125-130 (1988) - [j17]Robert McNaughton, Paliath Narendran, Friedrich Otto:
Church-Rosser Thue systems and formal languages. J. ACM 35(2): 324-344 (1988) - [j16]Deepak Kapur, David R. Musser, Paliath Narendran:
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. 6(1): 19-36 (1988) - [c13]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder:
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. CADE 1988: 182-196 - [c12]Paliath Narendran, Jonathan Stillman:
Formal Verification of the Sobel Image Processing Chip. DAC 1988: 211-217 - [c11]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. FSTTCS 1988: 435-454 - [c10]Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted:
Rigid E-Unification is NP-Complete. LICS 1988: 218-227 - 1987
- [j15]Deepak Kapur, Paliath Narendran, Hantao Zhang:
On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica 24(4): 395-415 (1987) - [j14]Deepak Kapur, Paliath Narendran:
Matching, unification and complexity. SIGSAM Bull. 21(4): 6-9 (1987) - [j13]Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987) - [c9]Paliath Narendran, Friedrich Otto:
It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. AAECC 1987: 341-349 - 1986
- [j12]Paliath Narendran:
On the Equivalence Problem for Regular Thue Systems. Theor. Comput. Sci. 44: 237-245 (1986) - [j11]Paliath Narendran, Friedrich Otto:
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. Theor. Comput. Sci. 47(3): 27-38 (1986) - [c8]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Proof by Induction Using Test Sets. CADE 1986: 99-117 - [c7]Deepak Kapur, Paliath Narendran:
NP-Completeness of the Set Unification and Matching Problems. CADE 1986: 489-495 - [c6]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Complexity of Sufficient-Completeness. FSTTCS 1986: 426-442 - 1985
- [j10]Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek:
Complexity of Certain Decision Problems about Congruential Languages. J. Comput. Syst. Sci. 30(3): 343-358 (1985) - [j9]Deepak Kapur, Paliath Narendran:
The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. 14(4): 1052-1072 (1985) - [j8]Deepak Kapur, Paliath Narendran:
An equational approach to theorem proving in first-order predicate calculus. ACM SIGSOFT Softw. Eng. Notes 10(4): 63-66 (1985) - [j7]Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran:
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. 35: 109-114 (1985) - [j6]Paliath Narendran, Friedrich Otto:
Complexity Results on the Conjugacy Problem for Monoids. Theor. Comput. Sci. 35: 227-243 (1985) - [j5]Deepak Kapur, Paliath Narendran:
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. 35: 337-344 (1985) - [j4]Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton:
The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. 39: 123-133 (1985) - [j3]Mukkai S. Krishnamoorthy, Paliath Narendran:
On Recursive Path Ordering. Theor. Comput. Sci. 40: 323-328 (1985) - [c5]Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran:
Reasoning about three dimensional space. ICRA 1985: 405-410 - [c4]Deepak Kapur, Paliath Narendran:
An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI 1985: 1146-1153 - [c3]Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran:
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA 1985: 345-364 - [c2]Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. RTA 1985: 417-429 - [c1]Deepak Kapur, Paliath Narendran, G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 1985: 173-187 - 1984
- [b1]Paliath Narendran:
Church-Rosser and related Thue systems. Rensselaer Polytechnic Institute, USA, 1984 - [j2]Paliath Narendran, Friedrich Otto, Karl Winklmann:
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete. Inf. Control. 63(1/2): 58-66 (1984) - [j1]Paliath Narendran, Robert McNaughton:
The Undecidability of the Preperfectness of Thue Systems. Theor. Comput. Sci. 31: 165-174 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
