| 2025 | FSCD | Knowledge Problems vs Unification and Matching: Dichotomy Results. | Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen |
| 2024 | LOPSTR | Deciding Knowledge Problems Modulo Classes of Permutative Theories. | Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen |
| 2024 | SACMAT | Converting Rule-Based Access Control Policies: From Complemented Conditions to Deny Rules. | Josu A. Ruiz, Paliath Narendran, Amir Masoumzadeh, Padmavathi Iyer |
| 2021 | SACMAT | Towards a Theory for Semantics and Expressiveness Analysis of Rule-Based Access Control Models. | Amirreza Masoumzadeh, Paliath Narendran, Padmavathi Iyer |
| 2019 | CADE | Unification Modulo Lists with Reverse Relation with Certain Word Equations. | Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michal Rusinowitch |
| 2014 | FOSSACS | On Asymmetric Unification and the Combination Problem in Disjoint Theories. | Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen |
| 2014 | PPDP | Theories of Homomorphic Encryption, Unification, and the Finite Variant Property. | Fan Yang, Santiago Escobar, Catherine Meadows, Jos Meseguer, Paliath Narendran |
| 2013 | CADE | Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. | Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, Jos Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse |
| 2013 | CADE | Hierarchical Combination. | Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen |
| 2012 | CADE | Unification Modulo Synchronous Distributivity. | Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michal Rusinowitch |
| 2012 | CADE | The use of types in designing unification algorithms: two case studies. | Serdar Erbatur, Santiago Escobar, Paliath Narendran |
| 2012 | CADE | Some Notes on Basic Syntactic Mutation. | Kimberly A. Gero, Christopher Bouchard, Paliath Narendran |
| 2012 | CADE | New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. | Andrew M. Marshall, Paliath Narendran |
| 2012 | ESORICS | Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. | Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, Jos Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse |
| 2012 | LATA | Unification Modulo Chaining. | Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michal Rusinowitch |
| 2011 | PPDP | Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. | Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, Jos Meseguer, Paliath Narendran, Ralf Sasse |
| 2011 | TABLEAUX | Unification in a Theory of Blind Signatures. | Serdar Erbatur, Christopher Lynch, Paliath Narendran |
| 2010 | CCS | Cap unification: application to protocol security modulo homomorphic encryption. | Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michal Rusinowitch |
| 2009 | LATA | On Extended Regular Expressions. | Benjamin Carle, Paliath Narendran |
| 2008 | CADE | Unification and Matching Modulo Leaf-Permutative Equational Presentations. | Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran |
| 2003 | CADE | Unification Modulo ACU I Plus Homomorphisms/Distributivity. | Siva Anantharaman, Paliath Narendran, Michal Rusinowitch |
| 2003 | MFCS | ACID-Unification Is NEXPTIME-Decidable. | Siva Anantharaman, Paliath Narendran, Michal Rusinowitch |
| 1998 | CSL | RPO Constraint Solving Is in NP. | Paliath Narendran, Michal Rusinowitch, Rakesh M. Verma |
| 1998 | ECAI | Unification of Concept Terms in Description Logics. | Franz Baader, Paliath Narendran |
| 1998 | LICS | Decision Problems in Ordered Rewriting. | Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michal Rusinowitch |
| 1997 | ICALP | The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. | Paliath Narendran, Friedrich Otto |
| 1996 | CADE | Unification and Matching Modulo Nilpotence. | Qing Guo, Paliath Narendran, David A. Wolfram |
| 1996 | LICS | Solving Linear Equations over Polynomial Semirings. | Paliath Narendran |
| 1995 | ISCAS | The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation. | Seth Chaiken, Paliath Narendran |
| 1994 | CAV | Ground Temporal Logic: A Logic for Hardware Verification. | David Cyrluk, Paliath Narendran |
| 1993 | LICS | On the Unification Problem for Cartesian Closed Categories | Paliath Narendran, Frank Pfenning, Richard Statman |
| 1993 | LICS | The Unifiability Problem in Ground AC Theories | Paliath Narendran, Michal Rusinowitch |
| 1992 | LICS | Double-exponential Complexity of Computing a Complete Set of AC-Unifiers | Deepak Kapur, Paliath Narendran |
| 1991 | ICALP | A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. | Klaus Madlener, Paliath Narendran, Friedrich Otto |
| 1990 | CADE | Some Results on Equational Unification. | Paliath Narendran, Friedrich Otto |
| 1989 | STACS | It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. | Paliath Narendran, Jonathan Stillman |
| 1988 | CADE | Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. | Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder |
| 1988 | DAC | Formal Verification of the Sobel Image Processing Chip. | Paliath Narendran, Jonathan Stillman |
| 1988 | LICS | Rigid E-Unification is NP-Complete | Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted |
| 1986 | CADE | NP-Completeness of the Set Unification and Matching Problems. | Deepak Kapur, Paliath Narendran |
| 1986 | CADE | Proof by Induction Using Test Sets. | Deepak Kapur, Paliath Narendran, Hantao Zhang |
| 1985 | IJCAI | An Equational Approach to Theorem Proving in First-Order Predicate Calculus. | Deepak Kapur, Paliath Narendran |
| 1985 | ICRA | Reasoning about three dimensional space. | Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran |