Anil Nerode

5.5k total citations
115 papers, 2.1k citations indexed

About

Anil Nerode is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Anil Nerode has authored 115 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Computational Theory and Mathematics, 55 papers in Artificial Intelligence and 14 papers in Computer Networks and Communications. Recurrent topics in Anil Nerode's work include Logic, Reasoning, and Knowledge (46 papers), Logic, programming, and type systems (31 papers) and Computability, Logic, AI Algorithms (24 papers). Anil Nerode is often cited by papers focused on Logic, Reasoning, and Knowledge (46 papers), Logic, programming, and type systems (31 papers) and Computability, Logic, AI Algorithms (24 papers). Anil Nerode collaborates with scholars based in United States, Australia and New Zealand. Anil Nerode's co-authors include Panos J. Antsaklis, G. Metakides, Anders P. Ravn, Hans Rischel, V. S. Subrahmanian, Jeffrey B. Remmel, Richard A. Shore, Bakhadyr Khoussainov, J.M. Davoren and Raymond T. Ng and has published in prestigious journals such as IEEE Transactions on Automatic Control, Proceedings of the IEEE and IEEE Transactions on Smart Grid.

In The Last Decade

Anil Nerode

104 papers receiving 1.8k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Anil Nerode United States	23	1.2k	929	363	226	183	115	2.1k
Deepak Kapur United States	26	1.3k 1.1×	1.1k 1.2×	114 0.3×	166 0.7×	204 1.1×	135	2.1k
Toshimitsu Ushio Japan	21	805 0.7×	204 0.2×	370 1.0×	53 0.2×	879 4.8×	260	2.0k
Komei Fukuda Switzerland	17	743 0.6×	235 0.3×	243 0.7×	102 0.5×	197 1.1×	63	1.7k
W. W. Bledsoe United States	17	402 0.3×	864 0.9×	40 0.1×	69 0.3×	172 0.9×	40	1.3k
J. Scott Provan United States	18	618 0.5×	178 0.2×	43 0.1×	251 1.1×	361 2.0×	45	1.5k
N. S. Mendelsohn Canada	17	436 0.4×	237 0.3×	148 0.4×	211 0.9×	85 0.5×	81	1.1k
Juris Hartmanis United States	15	871 0.7×	588 0.6×	57 0.2×	24 0.1×	171 0.9×	34	1.3k
Raphaël M. Jungers Belgium	19	463 0.4×	179 0.2×	839 2.3×	105 0.5×	300 1.6×	174	1.4k
Kenneth Bacławski United States	19	192 0.2×	637 0.7×	77 0.2×	260 1.2×	178 1.0×	70	1.4k
George S. Lueker United States	18	1.4k 1.2×	526 0.6×	20 0.1×	163 0.7×	863 4.7×	41	2.6k

Countries citing papers authored by Anil Nerode

Since Specialization

Citations

This map shows the geographic impact of Anil Nerode'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 Anil Nerode with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anil Nerode more than expected).

Fields of papers citing papers by Anil Nerode

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anil Nerode. 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 Anil Nerode. The network helps show where Anil Nerode may publish in the future.

Co-authorship network of co-authors of Anil Nerode

This figure shows the co-authorship network connecting the top 25 collaborators of Anil Nerode. A scholar is included among the top collaborators of Anil Nerode 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 Anil Nerode. Anil Nerode is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Artëmov, Sergei & Anil Nerode. (2013). Logical foundations of computer science : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013, proceedings. DIAL (Catholic University of Leuven). 2 indexed citations

Khoussainov, Bakhadyr & Anil Nerode. (2008). Open Questions in the Theory of Automatic Structures.. Bulletin of the European Association for Theoretical Computer Science. 94. 181–204. 18 indexed citations

Artëmov, Sergei & Anil Nerode. (2007). Logical foundations of computer science : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations

Nerode, Anil, et al.. (2006). On the Provision of Safety Assurance via Safety Kernels for Modern Weapon Systems. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School). 3 indexed citations

Ganguli, Suman & Anil Nerode. (2004). Effective completeness theorems for modal logic. Annals of Pure and Applied Logic. 128(1-3). 141–195. 4 indexed citations

Nerode, Anil, et al.. (1996). Computing minimal models by partial instantiation. Theoretical Computer Science. 155(1). 157–177. 7 indexed citations

Artëmov, Sergei & Anil Nerode. (1994). Proceedings of the Third International Symposium on Logical Foundations of Computer Science. 3 indexed citations

Marek, Victor W., Anil Nerode, & Jeffrey B. Remmel. (1994). A context for belief revision: forward chaining-normal nonmonotomic rule systems. Annals of Pure and Applied Logic. 67(1-3). 269–323. 7 indexed citations

Marek, Victor W., Anil Nerode, & Jeffrey B. Remmel. (1994). The Stable Models of a Predicate Logic Program. The Journal of Logic Programming. 21(3). 129–154. 3 indexed citations

10.

Kohn, Wolf & Anil Nerode. (1993). Autonomous control of hybrid systems with declarative controllers. 3–22. 1 indexed citations

11.

Nerode, Anil & Wolf Kohn. (1993). Hybrid systems and constraint logic programming. International Conference on Logic Programming. 60(3). 18–24. 3 indexed citations

12.

Marek, W., et al.. (1992). How complicated is the set of stable models of a recursive logic program?. Annals of Pure and Applied Logic. 56(1-3). 119–135. 18 indexed citations

13.

Pereira, Luı́s Moniz & Anil Nerode. (1991). Logic programming and non-monotonic reasoning : proceedings of the second international workshop. MIT Press eBooks. 11 indexed citations

14.

Nerode, Anil, Jeffrey B. Remmel, & Andre Scedrov. (1989). Polynomially graded logic. 375–385. 2 indexed citations

15.

Nerode, Anil & Jeffrey B. Remmel. (1989). Complexity-theoretic algebra II: Boolean algebras. Annals of Pure and Applied Logic. 44(1-2). 71–99. 9 indexed citations

16.

Metakides, G. & Anil Nerode. (1979). Effective content of field theory. Annals of Mathematical Logic. 17(3). 289–320. 78 indexed citations

17.

Metakides, G. & Anil Nerode. (1977). Recursively enumerable vector spaces. Annals of Mathematical Logic. 11(2). 147–171. 77 indexed citations

18.

Nerode, Anil. (1959). Composita, equations, and freely generated algebras. Transactions of the American Mathematical Society. 91(1). 139–151. 3 indexed citations

19.

Nerode, Anil. (1959). Review: Daniel Lacombe, Extension de la Notion de Fonction Recursive aux Fonctions d'une ou Plusieurs Variables Reelles; Daniel Lacombe, Remarques sur les Operateurs Recursifs et sur les Fonctions Recursives. Journal of Symbolic Logic. 24(1). 53–53. 4 indexed citations

20.

Nerode, Anil. (1958). Linear automaton transformations. Proceedings of the American Mathematical Society. 9(4). 541–544. 196 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