This map shows the geographic impact of Rajesh Parekh'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 Rajesh Parekh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rajesh Parekh more than expected).
This network shows the impact of papers produced by Rajesh Parekh. 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 Rajesh Parekh. The network helps show where Rajesh Parekh may publish in the future.
Co-authorship network of co-authors of Rajesh Parekh
This figure shows the co-authorship network connecting the top 25 collaborators of Rajesh Parekh.
A scholar is included among the top collaborators of Rajesh Parekh 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 Rajesh Parekh. Rajesh Parekh is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ghani, Rayid, Ted E. Senator, Paul S. Bradley, et al.. (2013). Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining.1 indexed citations
Parekh, Rajesh & Vasant Honavar. (1999). Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples. International Conference on Machine Learning. 298–306.3 indexed citations
14.
Parekh, Rajesh, et al.. (1997). A Polynomial Time Incremental Algorithm for Regular Grammar Inference. Iowa State University Digital Repository (Iowa State University).6 indexed citations
15.
Parekh, Rajesh, Jihoon Yang, & Vasant Honavar. (1997). Constructive Neural Network Learning Algorithms for Multi-Category Real-Valued Pattern Classification. Iowa State University Digital Repository (Iowa State University).32 indexed citations
16.
Parekh, Rajesh & Vasant Honavar. (1996). An incremental interactive algorithm for grammar inference. 238–249.12 indexed citations
17.
Parekh, Rajesh, Jihoon Yang, & Vasant Honavar. (1996). Constructive neural network learning algorithms. National Conference on Artificial Intelligence. 1398–1398.
18.
Chen, Chun‐Hsien, Rajesh Parekh, Jihoon Yang, Karthik Balakrishnan, & Vasant Honavar. (1995). Analysis of Decision Boundaries Generated by Constructive Neural Network Learning Algorithms. Iowa State University Digital Repository (Iowa State University).6 indexed citations
19.
Parekh, Rajesh, Jihoon Yang, & Vasant Honavar. (1995). Constructive Neural Network Learning Algorithms for Multi-Category Pattern Classification. Iowa State University Digital Repository (Iowa State University).20 indexed citations
20.
Parekh, Rajesh & Vasant Honavar. (1993). Efficient Learning of Regular Languages Using Teacher-Supplied Positive Samples and Learner-Generated Queries. Iowa State University Digital Repository (Iowa State University).3 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.