Paliath Narendran

144 papers A* 12A 16B 4C 8Journal 61Unranked 41

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Graph-Embedded Rewrite Systems: Combination and Undecidability Results. FroCoS Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2025	B	`conf`	Knowledge Problems vs Unification and Matching: Dichotomy Results. FSCD Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2024	C	`conf`	Converting Rule-Based Access Control Policies: From Complemented Conditions to Deny Rules. SACMAT Josué A. Ruiz, Paliath Narendran, Amir Masoumzadeh, Padmavathi Iyer
2024	C	`conf`	Deciding Knowledge Problems Modulo Classes of Permutative Theories. LOPSTR Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2023	J	`jnl`	Existence and Construction of a Gröbner Basis for a Polynomial Ideal. CoRR Deepak Kapur, Paliath Narendran
2022	—	`conf`	CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek
2022	J	`jnl`	On the Expressive Power of Negated Conditions and Negative Authorizations in Access Control Models. Comput. Secur. Padmavathi Iyer, Amirreza Masoumzadeh, Paliath Narendran
2021	—	`conf`	Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. FroCoS Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek
2021	J	`jnl`	On Problems Dual to Unification: The String-Rewriting Case. CoRR Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran, Andrew Pulver
2021	C	`conf`	Towards a Theory for Semantics and Expressiveness Analysis of Rule-Based Access Control Models. SACMAT Amirreza Masoumzadeh, Paliath Narendran, Padmavathi Iyer
2020	—	`conf`	Algorithmic Problems in Synthesized Cryptosystems (Extended Abstract). UNIF Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek
2020	—	`conf`	An Improved Algorithm for Testing Whether a Special String Rewriting System is Confluent. UNIF Paliath Narendran, Saumya Arora, Yu Zhang
2020	—	`conf`	Some Results on Prefix Grammars. UNIF Paliath Narendran, Ashley Suchy, Yu Zhang
2019	—	`conf`	Asymmetric Unification and Disunification. Description Logic, Theory Combination, and All That Veena Ravishankar, Kimberly A. Cornell, Paliath Narendran
2019	—	`conf`	On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar
2019	J	`jnl`	On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar
2019	—	`conf`	Reviving Basic Narrowing Modulo. FroCos Dohan Kim, Christopher Lynch, Paliath Narendran
2019	A	`conf`	Unification Modulo Lists with Reverse Relation with Certain Word Equations. CADE Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch
2017	J	`jnl`	Asymmetric Unification and Disunification. CoRR Veena Ravishankar, Kimberly A. Gero, Paliath Narendran
2017	J	`jnl`	On Problems Dual to Unification. CoRR Zümrüt Akçam, Daniel S. Hono II, Paliath Narendran
2016	—	`conf`	Lynch-Morawska Systems on Strings. UNIF Daniel S. Hono II, Paliath Narendran, Rafael Veras
2016	J	`jnl`	Lynch-Morawska Systems on Strings. CoRR Daniel S. Hono II, Paliath Narendran, Rafael Veras
2016	—	`conf`	Notes on Lynch-Morawska Systems. UNIF Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam
2016	J	`jnl`	Notes on Lynch-Morawska Systems. CoRR Daniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam
2015	J	`jnl`	On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. Log. Methods Comput. Sci. Andrew M. Marshall, Catherine Meadows, Paliath Narendran
2015	—	`conf`	Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2014	J	`jnl`	Foreword to the special issue on security and rewriting techniques. Inf. Comput. Steve Kremer, Paliath Narendran
2014	—	`conf`	Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2014	J	`jnl`	Obituary Robert McNaughton 1924 - 2014. Bull. EATCS John Corcoran, Paliath Narendran, Wolfgang Thomas
2014	—	`conf`	On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
2014	B	`conf`	On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen
2014	C	`conf`	Theories of Homomorphic Encryption, Unification, and the Finite Variant Property. PPDP Fan Yang, Santiago Escobar, Catherine Meadows, José Meseguer, Paliath Narendran
2014	—	`conf`	Unification Modulo Common List Functions. UNIF Peter Hibbs, Paliath Narendran, Shweta Mehto
2014	J	`jnl`	Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. Log. Methods Comput. Sci. Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch
2013	A	`conf`	Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
2013	—	`conf`	Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2013	A	`conf`	Hierarchical Combination. CADE Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen
2013	—	`conf`	On Forward Closure and the Finite Variant Property. FroCos Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran
2013	—	`conf`	Unication Problems Modulo a Theory of Until. UNIF@RTA/TLCA Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, Paliath Narendran
2012	A	`conf`	Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
2012	A	`conf`	New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. IJCAR Andrew M. Marshall, Paliath Narendran
2012	—	`conf`	Some Notes on Basic Syntactic Mutation. UNIF Kimberly A. Gero, Christopher Bouchard, Paliath Narendran
2012	—	`conf`	The use of types in designing unification algorithms: two case studies. UNIF Serdar Erbatur, Santiago Escobar, Paliath Narendran
2012	C	`conf`	Unification Modulo Chaining. LATA Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch
2012	J	`jnl`	Unification Modulo Homomorphic Encryption. J. Autom. Reason. Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
2012	A	`conf`	Unification Modulo Synchronous Distributivity. IJCAR Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
2011	—	`conf`	Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
2011	C	`conf`	Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
2011	J	`jnl`	String Rewriting and Security Analysis: An Extension of a Result of Book and Otto. J. Autom. Lang. Comb. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2011	—	`conf`	Unification in a Theory of Blind Signatures. TABLEAUX (Workshops, Tutorials, and Short Papers) Serdar Erbatur, Christopher Lynch, Paliath Narendran
2011	J	`jnl`	Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran
2010	A	`conf`	Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
2010	—	`conf`	On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity UNIF Paliath Narendran, Andrew M. Marshall, Bibhu Mahapatra
2010	—	`conf`	Unification modulo a partial theory of exponentiation UNIF Deepak Kapur, Andrew M. Marshall, Paliath Narendran
2009	C	`conf`	On Extended Regular Expressions. LATA Benjamin Carle, Paliath Narendran
2009	—	`conf`	Unification Modulo Homomorphic Encryption. FroCoS Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
2008	A	`conf`	Unification and Matching Modulo Leaf-Permutative Equational Presentations. IJCAR Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran
2008	—	`conf`	Unification modulo Homomorphic Encryption is Decidable. UNIF Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
2007	—	`conf`	Intruders with Caps. RTA Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2005	—	`conf`	A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning Deepak Kapur, Paliath Narendran, Lida Wang
2005	J	`jnl`	Closure properties and decision problems of dag automata. Inf. Process. Lett. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2004	J	`jnl`	Unification Modulo J. Autom. Reason. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2003	B	`conf`	ACID-Unification Is NEXPTIME-Decidable. MFCS Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2003	—	`conf`	An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA Deepak Kapur, Paliath Narendran, Lida Wang
2003	J	`jnl`	Deciding the confluence of ordered term rewrite systems. ACM Trans. Comput. Log. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
2003	A	`conf`	Unification Modulo ACU I Plus Homomorphisms/Distributivity. CADE Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
2002	J	`jnl`	Guest Editorial. Inf. Comput. Paliath Narendran, Michaël Rusinowitch
2001	J	`jnl`	Unification of Concept Terms in Description Logics. J. Symb. Comput. Franz Baader, Paliath Narendran
2000	J	`jnl`	Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages). SIGACT News Paliath Narendran
2000	J	`jnl`	Complexity of Nilpotent Unification and Matching Problems. Inf. Comput. Qing Guo, Paliath Narendran, David A. Wolfram
2000	J	`jnl`	Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
2000	—	`conf`	The Theory of Total Unary RPO Is Decidable. Computational Logic Paliath Narendran, Michaël Rusinowitch
1999	—	`ed.`	Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings RTA Paliath Narendran, Michaël Rusinowitch
1998	A*	`conf`	Decision Problems in Ordered Rewriting. LICS Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
1998	J	`jnl`	Equational Unification, Word Unification, and 2nd-Order Equational Unification. Theor. Comput. Sci. Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
1998	B	`conf`	RPO Constraint Solving Is in NP. CSL Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma
1998	—	`conf`	The Decidability of Simultaneous Rigid RTA Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
1998	—	`conf`	Unification and Matching in Process Algebras. RTA Qing Guo, Paliath Narendran, Sandeep K. Shukla
1998	A	`conf`	Unification of Concept Terms in Description Logics. ECAI Franz Baader, Paliath Narendran
1997	J	`jnl`	On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. Paliath Narendran, Frank Pfenning, Richard Statman
1997	J	`jnl`	Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. J. Autom. Reason. Paliath Narendran, Friedrich Otto
1997	A*	`conf`	The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. ICALP Paliath Narendran, Friedrich Otto
1997	—	`conf`	Unification of Concept Terms in Description Logics. Description Logics Franz Baader, Paliath Narendran
1996	J	`jnl`	Any Ground Associative-Commutative Theory Has a Finite Canonical System. J. Autom. Reason. Paliath Narendran, Michaël Rusinowitch
1996	A*	`conf`	Solving Linear Equations over Polynomial Semirings. LICS Paliath Narendran
1996	J	`jnl`	Unification Modulo ACI + 1 + 0. Fundam. Informaticae Paliath Narendran
1996	A	`conf`	Unification and Matching Modulo Nilpotence. CADE Qing Guo, Paliath Narendran, David A. Wolfram
1995	—	`conf`	Some Independent Results for Equational Unification. RTA Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
1995	C	`conf`	The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation. ISCAS Seth Chaiken, Paliath Narendran
1994	J	`jnl`	Codes Modulo Finite Monadic String-Rewriting Systems. Theor. Comput. Sci. Friedrich Otto, Paliath Narendran
1994	A*	`conf`	Ground Temporal Logic: A Logic for Hardware Verification. CAV David Cyrluk, Paliath Narendran
1993	J	`jnl`	An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. J. ACM Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1993	J	`jnl`	On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
1993	A*	`conf`	On the Unification Problem for Cartesian Closed Categories LICS Paliath Narendran, Frank Pfenning, Richard Statman
1993	A*	`conf`	The Unifiability Problem in Ground AC Theories LICS Paliath Narendran, Michaël Rusinowitch
1992	J	`jnl`	Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reason. Deepak Kapur, Paliath Narendran
1992	A*	`conf`	Double-exponential Complexity of Computing a Complete Set of AC-Unifiers LICS Deepak Kapur, Paliath Narendran
1992	J	`jnl`	Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
1991	A*	`conf`	A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP Klaus Madlener, Paliath Narendran, Friedrich Otto
1991	—	`conf`	Any Gound Associative-Commutative Theory Has a Finite Canonical System. RTA Paliath Narendran, Michaël Rusinowitch
1991	J	`jnl`	Automating Inductionless Induction Using Test Sets. J. Symb. Comput. Deepak Kapur, Paliath Narendran, Hantao Zhang
1991	J	`jnl`	It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
1991	J	`jnl`	Semi-Unification. Theor. Comput. Sci. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
1991	J	`jnl`	Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
1990	J	`jnl`	It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set. Math. Syst. Theory Paliath Narendran
1990	J	`jnl`	On Ground-Confluence of Term Rewriting Systems Inf. Comput. Deepak Kapur, Paliath Narendran, Friedrich Otto
1990	J	`jnl`	Rigid E-Unification: NP-Completeness and Applications to Equational Matings Inf. Comput. Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder
1990	A	`conf`	Some Results on Equational Unification. CADE Paliath Narendran, Friedrich Otto
1989	J	`jnl`	Cancellativity in Finitely Presented Semigroups. J. Symb. Comput. Paliath Narendran, Colm Ó'Dúnlaing
1989	A	`conf`	It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. STACS Paliath Narendran, Jonathan Stillman
1989	J	`jnl`	Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. Theor. Comput. Sci. Paliath Narendran, Friedrich Otto
1988	J	`jnl`	Church-Rosser Thue systems and formal languages. J. ACM Robert McNaughton, Paliath Narendran, Friedrich Otto
1988	J	`jnl`	Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems. Acta Informatica Paliath Narendran, Friedrich Otto
1988	A	`conf`	Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. CADE Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1988	A*	`conf`	Formal Verification of the Sobel Image Processing Chip. DAC Paliath Narendran, Jonathan Stillman
1988	J	`jnl`	Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. Deepak Kapur, David R. Musser, Paliath Narendran
1988	J	`jnl`	Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. Inf. Process. Lett. Paliath Narendran, Friedrich Otto
1988	A*	`conf`	Rigid E-Unification is NP-Complete LICS Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
1988	—	`conf`	Semi-Unification. FSTTCS Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
1987	J	`jnl`	Complexity of Matching Problems. J. Symb. Comput. Dan Benanav, Deepak Kapur, Paliath Narendran
1987	—	`conf`	It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. AAECC Paliath Narendran, Friedrich Otto
1987	J	`jnl`	Matching, unification and complexity. SIGSAM Bull. Deepak Kapur, Paliath Narendran
1987	J	`jnl`	On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica Deepak Kapur, Paliath Narendran, Hantao Zhang
1986	—	`conf`	Complexity of Sufficient-Completeness. FSTTCS Deepak Kapur, Paliath Narendran, Hantao Zhang
1986	A	`conf`	NP-Completeness of the Set Unification and Matching Problems. CADE Deepak Kapur, Paliath Narendran
1986	J	`jnl`	On the Equivalence Problem for Regular Thue Systems. Theor. Comput. Sci. Paliath Narendran
1986	A	`conf`	Proof by Induction Using Test Sets. CADE Deepak Kapur, Paliath Narendran, Hantao Zhang
1986	J	`jnl`	The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. Theor. Comput. Sci. Paliath Narendran, Friedrich Otto
1985	J	`jnl`	A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. Deepak Kapur, Paliath Narendran
1985	—	`conf`	A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 Deepak Kapur, Paliath Narendran, G. Sivakumar
1985	A*	`conf`	An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI Deepak Kapur, Paliath Narendran
1985	—	`conf`	An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran
1985	J	`jnl`	An O(\|T\|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran
1985	J	`jnl`	An equational approach to theorem proving in first-order predicate calculus. ACM SIGSOFT Softw. Eng. Notes Deepak Kapur, Paliath Narendran
1985	J	`jnl`	Complexity Results on the Conjugacy Problem for Monoids. Theor. Comput. Sci. Paliath Narendran, Friedrich Otto
1985	J	`jnl`	Complexity of Certain Decision Problems about Congruential Languages. J. Comput. Syst. Sci. Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek
1985	—	`conf`	Complexity of Matching Problems. RTA Dan Benanav, Deepak Kapur, Paliath Narendran
1985	J	`jnl`	On Recursive Path Ordering. Theor. Comput. Sci. Mukkai S. Krishnamoorthy, Paliath Narendran
1985	A*	`conf`	Reasoning about three dimensional space. ICRA Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran
1985	J	`jnl`	The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton
1985	J	`jnl`	The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. Deepak Kapur, Paliath Narendran
1984	—	`—`	Church-Rosser and related Thue systems. Paliath Narendran
1984	J	`jnl`	The Undecidability of the Preperfectness of Thue Systems. Theor. Comput. Sci. Paliath Narendran, Robert McNaughton
1984	J	`jnl`	The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete Inf. Control. Paliath Narendran, Friedrich Otto, Karl Winklmann