The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paliath Narendran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  81. Unification and Matching Modulo Leaf-Permutative Equational Presentations. [Citation Graph (, )][DBLP]


  82. Cap unification: application to protocol security modulo homomorphic encryption. [Citation Graph (, )][DBLP]


  83. Unification Modulo Homomorphic Encryption. [Citation Graph (, )][DBLP]


  84. On Extended Regular Expressions. [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002