Paliath Narendran

2.7k total citations
72 papers, 743 citations indexed

About

Paliath Narendran is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Paliath Narendran has authored 72 papers receiving a total of 743 indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Artificial Intelligence, 50 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Paliath Narendran's work include Logic, programming, and type systems (39 papers), semigroups and automata theory (37 papers) and Formal Methods in Verification (16 papers). Paliath Narendran is often cited by papers focused on Logic, programming, and type systems (39 papers), semigroups and automata theory (37 papers) and Formal Methods in Verification (16 papers). Paliath Narendran collaborates with scholars based in United States, Germany and France. Paliath Narendran's co-authors include Deepak Kapur, Friedrich Otto, Robert McNaughton, Hantao Zhang, Jean Gallier, Wayne Snyder, Michaël Rusinowitch, David A. Plaisted, Mukkai S. Krishnamoorthy and Colm Ó'Dúnlaing and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Paliath Narendran

64 papers receiving 665 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Paliath Narendran United States 16 612 577 91 88 76 72 743
Volker Diekert Germany 11 372 0.6× 596 1.0× 64 0.7× 135 1.5× 69 0.9× 82 702
Hans Zantema Netherlands 12 487 0.8× 354 0.6× 23 0.3× 46 0.5× 39 0.5× 78 573
J. I. Zucker Canada 12 383 0.6× 400 0.7× 20 0.2× 27 0.3× 67 0.9× 35 519
Ferenc Gécseg Hungary 6 372 0.6× 411 0.7× 77 0.8× 18 0.2× 38 0.5× 26 532
Jacques Sakarovitch France 12 334 0.5× 473 0.8× 110 1.2× 77 0.9× 20 0.3× 45 528
Silvio Ghilardi Italy 19 921 1.5× 711 1.2× 25 0.3× 18 0.2× 114 1.5× 82 1.0k
Matthias Jantzen Germany 11 222 0.4× 311 0.5× 121 1.3× 57 0.6× 32 0.4× 22 400
Leo Bachmair United States 14 632 1.0× 456 0.8× 9 0.1× 29 0.3× 84 1.1× 33 699
Kevin J. Compton United States 13 215 0.4× 259 0.4× 16 0.2× 38 0.4× 46 0.6× 33 393
Pierre-Louis Curien France 18 1.3k 2.1× 947 1.6× 13 0.1× 45 0.5× 131 1.7× 47 1.4k

Countries citing papers authored by Paliath Narendran

Since Specialization
Citations

This map shows the geographic impact of Paliath Narendran's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Paliath Narendran with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paliath Narendran more than expected).

Fields of papers citing papers by Paliath Narendran

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paliath Narendran. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Paliath Narendran. The network helps show where Paliath Narendran may publish in the future.

Co-authorship network of co-authors of Paliath Narendran

This figure shows the co-authorship network connecting the top 25 collaborators of Paliath Narendran. A scholar is included among the top collaborators of Paliath Narendran based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paliath Narendran. Paliath Narendran is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Masoumzadeh, Amirreza, et al.. (2021). On the Expressive Power of Negated Conditions and Negative Authorizations in Access Control Models. Computers & Security. 116. 102586–102586. 2 indexed citations
3.
Janarthanam, Srinivasan, M. Ramalingam, & Paliath Narendran. (2010). Texture analysis on low resolution images using unsupervised segmentation algorithm with multichannel Local Frequency analysis. 260–265. 1 indexed citations
4.
Kapur, Deepak, Paliath Narendran, & Lida Wang. (2003). An E-unification algorithm for analyzing protocols that use modular exponentiation.
5.
Gallier, Jean, Wayne Snyder, Paliath Narendran, & David A. Plaisted. (2003). Rigid E-unification is NP-complete. 218–227. 5 indexed citations
6.
Baader, Franz & Paliath Narendran. (2001). Unification of Concept Terms in Description Logics. Journal of Symbolic Computation. 31(3). 277–305. 6 indexed citations
7.
Narendran, Paliath & Michaël Rusinowitch. (1999). Rewriting Techniques & Applications. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
8.
Kapur, Deepak & Paliath Narendran. (1992). Complexity of unification problems with associative-commutative operators. Journal of Automated Reasoning. 9(2). 261–288. 32 indexed citations
9.
Kapur, Deepak, Paliath Narendran, & Hantao Zhang. (1991). Automating inductionless induction using test sets. Journal of Symbolic Computation. 11(1-2). 83–111. 19 indexed citations
10.
Kapur, Deepak, Paliath Narendran, & Friedrich Otto. (1990). On ground-confluence of term rewriting systems. Information and Computation. 86(1). 14–31. 25 indexed citations
11.
Narendran, Paliath. (1989). SOME REMARKS ON SECOND ORDER UNIFICATION. PRISM (University of Calgary). 2 indexed citations
12.
Narendran, Paliath & Friedrich Otto. (1989). Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Theoretical Computer Science. 68(3). 319–332. 4 indexed citations
13.
Narendran, Paliath & Colm Ó'Dúnlaing. (1989). Cancellativity in finitely presented semigroups. Journal of Symbolic Computation. 7(5). 457–472. 5 indexed citations
14.
Narendran, Paliath & Friedrich Otto. (1988). Preperfectness is undecidable for thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters. 29(3). 125–130. 10 indexed citations
15.
Narendran, Paliath & Friedrich Otto. (1986). The problems of cyclic equality and conjugacy for finite complete rewriting systems. Theoretical Computer Science. 47. 27–38. 9 indexed citations
16.
Kapur, Deepak & Paliath Narendran. (1985). An equational approach to theorem proving in first-order predicate calculus. International Joint Conference on Artificial Intelligence. 1146–1153. 37 indexed citations
17.
Narendran, Paliath & Friedrich Otto. (1985). Complexity results on the conjugacy problem for monoids. Theoretical Computer Science. 35. 227–243. 12 indexed citations
18.
Kapur, Deepak & Paliath Narendran. (1985). A finite thue system with decidable word problem and without equivalent finite canonical system. Theoretical Computer Science. 35. 337–344. 37 indexed citations
19.
Krishnamoorthy, Mukkai S. & Paliath Narendran. (1985). On recursive path ordering. Theoretical Computer Science. 40. 323–328. 15 indexed citations
20.
Narendran, Paliath, et al.. (1984). The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete. Information and Control. 63(1-2). 58–66. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026