| 2009 |
|---|
| 83 | EE | Benjamin Carle,
Paliath Narendran:
On Extended Regular Expressions.
LATA 2009: 279-289 |
| 2008 |
|---|
| 82 | EE | Thierry Boy de la Tour,
Mnacho Echenim,
Paliath Narendran:
Unification and Matching Modulo Leaf-Permutative Equational Presentations.
IJCAR 2008: 332-347 |
| 2007 |
|---|
| 81 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Intruders with Caps.
RTA 2007: 20-35 |
| 2005 |
|---|
| 80 | EE | Deepak Kapur,
Paliath Narendran,
Lida Wang:
A Unification Algorithm for Analysis of Protocols with Blinded Signatures.
Mechanizing Mathematical Reasoning 2005: 433-451 |
| 79 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Closure properties and decision problems of dag automata.
Inf. Process. Lett. 94(5): 231-240 (2005) |
| 2004 |
|---|
| 78 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACUI Plus Distributivity Axioms.
J. Autom. Reasoning 33(1): 1-28 (2004) |
| 2003 |
|---|
| 77 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACU I Plus Homomorphisms/Distributivity.
CADE 2003: 442-457 |
| 76 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable.
MFCS 2003: 169-178 |
| 75 | EE | Deepak Kapur,
Paliath Narendran,
Lida Wang:
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.
RTA 2003: 165-179 |
| 74 | EE | 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) |
| 2002 |
|---|
| 73 | EE | Paliath Narendran,
Michaël Rusinowitch:
Guest Editorial.
Inf. Comput. 178(2): 345 (2002) |
| 2001 |
|---|
| 72 | | Franz Baader,
Paliath Narendran:
Unification of Concept Terms in Description Logics.
J. Symb. Comput. 31(3): 277-305 (2001) |
| 2000 |
|---|
| 71 | EE | Paliath Narendran,
Michaël Rusinowitch:
The Theory of Total Unary RPO Is Decidable.
Computational Logic 2000: 660-672 |
| 70 | | Qing Guo,
Paliath Narendran,
David A. Wolfram:
Complexity of Nilpotent Unification and Matching Problems.
Inf. Comput. 162(1-2): 3-23 (2000) |
| 69 | EE | 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) |
| 1999 |
|---|
| 68 | | Paliath Narendran,
Michaël Rusinowitch:
Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings
Springer 1999 |
| 1998 |
|---|
| 67 | | Paliath Narendran,
Michaël Rusinowitch,
Rakesh M. Verma:
RPO Constraint Solving Is in NP.
CSL 1998: 385-398 |
| 66 | | Franz Baader,
Paliath Narendran:
Unification of Concept Terms in Description Logics.
ECAI 1998: 331-335 |
| 65 | | Hubert Comon,
Paliath Narendran,
Robert Nieuwenhuis,
Michaël Rusinowitch:
Decision Problems in Ordered Rewriting.
LICS 1998: 276-286 |
| 64 | EE | Anatoli Degtyarev,
Yuri Gurevich,
Paliath Narendran,
Margus Veanes,
Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable.
RTA 1998: 181-195 |
| 63 | EE | Qing Guo,
Paliath Narendran,
Sandeep K. Shukla:
Unification and Matching in Process Algebras.
RTA 1998: 91-105 |
| 62 | EE | 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) |
| 1997 |
|---|
| 61 | EE | Franz Baader,
Paliath Narendran:
Unification of Concept Terms in Description Logics.
Description Logics 1997 |
| 60 | | Paliath Narendran,
Friedrich Otto:
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
ICALP 1997: 638-648 |
| 59 | | Paliath Narendran,
Friedrich Otto:
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
J. Autom. Reasoning 19(1): 87-115 (1997) |
| 58 | | Paliath Narendran,
Frank Pfenning,
Richard Statman:
On the Unification Problem for Cartesian Closed Categories.
J. Symb. Log. 62(2): 636-647 (1997) |
| 1996 |
|---|
| 57 | | Qing Guo,
Paliath Narendran,
David A. Wolfram:
Unification and Matching Modulo Nilpotence.
CADE 1996: 261-274 |
| 56 | | Paliath Narendran:
Solving Linear Equations over Polynomial Semirings.
LICS 1996: 466-472 |
| 55 | | Paliath Narendran:
Unification Modulo ACI + 1 + 0.
Fundam. Inform. 25(1): 49-57 (1996) |
| 54 | | Paliath Narendran,
Michaël Rusinowitch:
Any Ground Associative-Commutative Theory Has a Finite Canonical System.
J. Autom. Reasoning 17(1): 131-143 (1996) |
| 1995 |
|---|
| 53 | | Seth Chaiken,
Paliath Narendran:
The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation.
ISCAS 1995: 1239-1242 |
| 52 | | Friedrich Otto,
Paliath Narendran,
Daniel J. Dougherty:
Some Independent Results for Equational Unification.
RTA 1995: 367-381 |
| 1994 |
|---|
| 51 | | David Cyrluk,
Paliath Narendran:
Ground Temporal Logic: A Logic for Hardware Verification.
CAV 1994: 247-259 |
| 50 | | Friedrich Otto,
Paliath Narendran:
Codes Modulo Finite Monadic String-Rewriting Systems.
Theor. Comput. Sci. 134(1): 175-188 (1994) |
| 1993 |
|---|
| 49 | | Paliath Narendran,
Michaël Rusinowitch:
The Unifiability Problem in Ground AC Theories
LICS 1993: 364-370 |
| 48 | | Paliath Narendran,
Frank Pfenning,
Richard Statman:
On the Unification Problem for Cartesian Closed Categories
LICS 1993: 57-63 |
| 47 | EE | 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) |
| 46 | | Klaus Madlener,
Paliath Narendran,
Friedrich Otto,
Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci. 113(1): 119-165 (1993) |
| 1992 |
|---|
| 45 | | Deepak Kapur,
Paliath Narendran:
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers
LICS 1992: 11-21 |
| 44 | EE | 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) |
| 43 | | Deepak Kapur,
Paliath Narendran:
Complexity of Unification Problems with Associative-Commutative Operators.
J. Autom. Reasoning 9(2): 261-288 (1992) |
| 1991 |
|---|
| 42 | | Klaus Madlener,
Paliath Narendran,
Friedrich Otto:
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
ICALP 1991: 279-290 |
| 41 | | Paliath Narendran,
Michaël Rusinowitch:
Any Gound Associative-Commutative Theory Has a Finite Canonical System.
RTA 1991: 423-434 |
| 40 | | Deepak Kapur,
Paliath Narendran,
Daniel J. Rosenkrantz,
Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity.
Acta Inf. 28(4): 311-350 (1991) |
| 39 | EE | Paliath Narendran,
Colm Ó'Dúnlaing,
Friedrich Otto:
It is undecidable whether a finite special string-rewriting system presents a group.
Discrete Mathematics 98(2): 153-159 (1991) |
| 38 | | Deepak Kapur,
Paliath Narendran,
Hantao Zhang:
Automating Inductionless Induction Using Test Sets.
J. Symb. Comput. 11(1/2): 81-111 (1991) |
| 37 | | Deepak Kapur,
David R. Musser,
Paliath Narendran,
Jonathan Stillman:
Semi-Unification.
Theor. Comput. Sci. 81(2): 169-187 (1991) |
| 1990 |
|---|
| 36 | | Paliath Narendran,
Friedrich Otto:
Some Results on Equational Unification.
CADE 1990: 276-291 |
| 35 | | Deepak Kapur,
Paliath Narendran,
Friedrich Otto:
On Ground-Confluence of Term Rewriting Systems
Inf. Comput. 86(1): 14-31 (1990) |
| 34 | | 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) |
| 33 | | Paliath Narendran:
It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set.
Mathematical Systems Theory 23(4): 245-254 (1990) |
| 1989 |
|---|
| 32 | | Paliath Narendran,
Jonathan Stillman:
It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.
STACS 1989: 348-359 |
| 31 | | Paliath Narendran,
Colm Ó'Dúnlaing:
Cancellativity in Finitely Presented Semigroups.
J. Symb. Comput. 7(5): 457-472 (1989) |
| 30 | | Paliath Narendran,
Friedrich Otto:
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci. 68(3): 319-332 (1989) |
| 1988 |
|---|
| 29 | | 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 |
| 28 | EE | Paliath Narendran,
Jonathan Stillman:
Formal Verification of the Sobel Image Processing Chip.
DAC 1988: 211-217 |
| 27 | | Deepak Kapur,
David R. Musser,
Paliath Narendran,
Jonathan Stillman:
Semi-Unification.
FSTTCS 1988: 435-454 |
| 26 | | Jean H. Gallier,
Wayne Snyder,
Paliath Narendran,
David A. Plaisted:
Rigid E-Unification is NP-Complete
LICS 1988: 218-227 |
| 25 | | Paliath Narendran,
Friedrich Otto:
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.
Acta Inf. 25(5): 573-591 (1988) |
| 24 | | 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) |
| 23 | EE | Robert McNaughton,
Paliath Narendran,
Friedrich Otto:
Church-Rosser Thue systems and formal languages.
J. ACM 35(2): 324-344 (1988) |
| 22 | | 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) |
| 1987 |
|---|
| 21 | | 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 |
| 20 | | Deepak Kapur,
Paliath Narendran,
Hantao Zhang:
On Sufficient-Completeness and Related Properties of Term Rewriting Systems.
Acta Inf. 24(4): 395-415 (1987) |
| 19 | | Dan Benanav,
Deepak Kapur,
Paliath Narendran:
Complexity of Matching Problems.
J. Symb. Comput. 3(1/2): 203-216 (1987) |
| 1986 |
|---|
| 18 | | Deepak Kapur,
Paliath Narendran:
NP-Completeness of the Set Unification and Matching Problems.
CADE 1986: 489-495 |
| 17 | | Deepak Kapur,
Paliath Narendran,
Hantao Zhang:
Proof by Induction Using Test Sets.
CADE 1986: 99-117 |
| 16 | | Deepak Kapur,
Paliath Narendran,
Hantao Zhang:
Complexity of Sufficient-Completeness.
FSTTCS 1986: 426-442 |
| 15 | | Paliath Narendran:
On the Equivalence Problem for Regular Thue Systems.
Theor. Comput. Sci. 44: 237-245 (1986) |
| 14 | | Paliath Narendran,
Friedrich Otto:
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.
Theor. Comput. Sci. 47(3): 27-38 (1986) |
| 1985 |
|---|
| 13 | | Deepak Kapur,
Paliath Narendran:
An Equational Approach to Theorem Proving in First-Order Predicate Calculus.
IJCAI 1985: 1146-1153 |
| 12 | | 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 |
| 11 | | Dan Benanav,
Deepak Kapur,
Paliath Narendran:
Complexity of Matching Problems.
RTA 1985: 417-429 |
| 10 | | Deepak Kapur,
Paliath Narendran,
G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems.
TAPSOFT, Vol.1 1985: 173-187 |
| 9 | | Paliath Narendran,
Colm Ó'Dúnlaing,
Heinrich Rolletschek:
Complexity of Certain Decision Problems about Congruential Languages.
J. Comput. Syst. Sci. 30(3): 343-358 (1985) |
| 8 | | Deepak Kapur,
Paliath Narendran:
The Knuth-Bendix Completion Procedure and Thue Systems.
SIAM J. Comput. 14(4): 1052-1072 (1985) |
| 7 | | 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) |
| 6 | | Paliath Narendran,
Friedrich Otto:
Complexity Results on the Conjugacy Problem for Monoids.
Theor. Comput. Sci. 35: 227-243 (1985) |
| 5 | | 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) |
| 4 | | Deepak Kapur,
Paliath Narendran,
Mukkai S. Krishnamoorthy,
Robert McNaughton:
The Church-Rosser Property and Special Thue Systems.
Theor. Comput. Sci. 39: 123-133 (1985) |
| 3 | | Mukkai S. Krishnamoorthy,
Paliath Narendran:
On Recursive Path Ordering.
Theor. Comput. Sci. 40: 323-328 (1985) |
| 1984 |
|---|
| 2 | | Paliath Narendran,
Friedrich Otto,
Karl Winklmann:
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Information and Control 63(1/2): 58-66 (1984) |
| 1 | | Paliath Narendran,
Robert McNaughton:
The Undecidability of the Preperfectness of Thue Systems.
Theor. Comput. Sci. 31: 165-174 (1984) |
