Travelled to:1 × Australia
1 × Czech Republic
1 × Denmark
1 × Germany
1 × Japan
2 × Italy
3 × France
4 × Spain
4 × United Kingdom
9 × USA
Collaborated with:D.Kapur M.Rusinowitch F.Otto S.Anantharaman A.M.Marshall S.Erbatur Q.Guo C.Meadows B.Carle ∅ D.Cyrluk J.Stillman J.H.Gallier D.A.Plaisted W.Snyder S.Escobar J.Meseguer C.Lynch C.Ringeissen T.B.d.l.Tour M.Echenim L.Wang R.M.Verma S.K.Shukla D.A.Wolfram D.J.Dougherty K.Madlener H.Zhang D.Benanav A.Kandri-Rody G.Sivakumar C.Bouchard H.Comon R.Nieuwenhuis P.Hibbs R.Sasse F.Yang A.Degtyarev Y.Gurevich M.Veanes A.Voronkov S.Raatz Z.Liu S.Santiago
Talks about:unif (20) modulo (8) problem (7) match (6) equat (6) system (5) rewrit (5) finit (5) complet (4) theori (4)
Person: Paliath Narendran
DBLP: Narendran:Paliath
Facilitated 1 volumes:
EdContributed to:
2014
2014
2013
2012
2012201120092008200720032003
2000
1998
19981998
1997199619961995
199419921991199119901988
1988198819861985
19852019Wrote 36 papers:
- FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- PPDP-2014-YangEMMN #encryption #finite #unification
- Theories of Homomorphic Encryption, Unification, and the Finite Variant Property (FY, SE, CM, JM, PN), pp. 123–133.
- CADE-2013-ErbaturEKLLMMNSS #analysis #encryption #paradigm #protocol #symmetry #unification
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (SE, SE, DK, ZL, CL, CM, JM, PN, SS, RS), pp. 231–248.
- CADE-2013-ErbaturKMNR
- Hierarchical Combination (SE, DK, AMM, PN, CR), pp. 249–266.
- IJCAR-2012-AnantharamanELNR #unification
- Unification Modulo Synchronous Distributivity (SA, SE, CL, PN, MR), pp. 14–29.
- IJCAR-2012-MarshallN #algorithm #unification
- New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants (AMM, PN), pp. 408–422.
- LATA-2012-AnantharamanBNR #unification
- Unification Modulo Chaining (SA, CB, PN, MR), pp. 70–82.
- PPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using
- Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.
- LATA-2009-CarleN #on the #regular expression
- On Extended Regular Expressions (BC, PN), pp. 279–289.
- IJCAR-2008-TourEN #equation #unification
- Unification and Matching Modulo Leaf-Permutative Equational Presentations (TBdlT, ME, PN), pp. 332–347.
- RTA-2007-AnantharamanNR
- Intruders with Caps (SA, PN, MR), pp. 20–35.
- CADE-2003-AnantharamanNR #morphism #unification
- Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.
- RTA-2003-KapurNW #algorithm #composition #protocol
- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation (DK, PN, LW), pp. 165–179.
- CL-2000-NarendranR #decidability #formal method
- The Theory of Total Unary RPO Is Decidable (PN, MR), pp. 660–672.
- CSL-1998-NarendranRV #constraints #theorem proving
- RPO Constraint Solving Is in NP (PN, MR, RMV), pp. 385–398.
- LICS-1998-ComonNNR #order #problem
- Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
- RTA-1998-DegtyarevGNVV #decidability
- The Decidability of Simultaneous Rigid E-Unification with One Variable (AD, YG, PN, MV, AV), pp. 181–195.
- RTA-1998-GuoNS #algebra #process #unification
- Unification and Matching in Process Algebras (QG, PN, SKS), pp. 91–105.
- ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word
- The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
- CADE-1996-GuoNW #unification
- Unification and Matching Modulo Nilpotence (QG, PN, DAW), pp. 261–274.
- LICS-1996-Narendran #equation #linear #polynomial
- Solving Linear Equations over Polynomial Semirings (PN), pp. 466–472.
- RTA-1995-OttoND #equation #independence #unification
- Some Independent Results for Equational Unification (FO, PN, DJD), pp. 367–381.
- CAV-1994-CyrlukN #hardware #logic #verification
- Ground Temporal Logic: A Logic for Hardware Verification (DC, PN), pp. 247–259.
- LICS-1992-KapurN #complexity #set
- Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
- ICALP-1991-MadlenerNO #monad #string #term rewriting
- A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
- RTA-1991-NarendranR #canonical #commutative #finite
- Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.
- CADE-1990-NarendranO #equation #unification
- Some Results on Equational Unification (PN, FO), pp. 276–291.
- CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting
- Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
- DAC-1988-NarendranS #image #verification
- Formal Verification of the Sobel Image Processing Chip (PN, JS), pp. 211–217.
- LICS-1988-GallierSNP
- Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
- CADE-1986-KapurN #problem #set #unification
- NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
- CADE-1986-KapurNZ #induction #proving #testing #using
- Proof by Induction Using Test Sets (DK, PN, HZ), pp. 99–117.
- RTA-1985-BenanavKN #complexity #problem
- Complexity of Matching Problems (DB, DK, PN), pp. 417–429.
- RTA-1985-Kandri-RodyKN #algebra #approach #commutative #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- CAAP-1985-KapurNS #order #proving #term rewriting #termination
- A Path Ordering for Proving Termination of Term Rewriting Systems (DK, PN, GS), pp. 173–187.
- CADE-2019-AnantharamanHNR #equation #unification #word
- Unification Modulo Lists with Reverse Relation with Certain Word Equations (SA, PH, PN, MR), pp. 1–17.