Neeraj Kayal
- Computational Theory and Mathematics top 1%
- Artificial Intelligence top 5%
- Algebra and Number Theory top 10%
- Information Systems top 10%
- Computer Networks and Communications top 10%
- Co-authors
- Nitin SaxenaManindra AgrawalRamprasad SaptharishiAnkit GuptaPritish KamathShubhangi SarafJames S. WalkerMartin Dyer
- Topics
- Complexity and Algorithms in Graphs (25 papers)Polynomial and algebraic computation (18 papers)Coding theory and cryptography (15 papers)
- Partner nations
- IndiaUnited StatesUnited Kingdom
In The Last Decade
Neeraj Kayal
37 papers receiving 619 citations
Peers
Comparison fields: 5 of 53
- Computational Theory and Mathematics 487
- Artificial Intelligence 446
- Algebra and Number Theory 91
- Information Systems 89
- Computer Networks and Communications 65
Countries citing papers authored by Neeraj Kayal
This map shows the geographic impact of Neeraj Kayal'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 Neeraj Kayal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neeraj Kayal more than expected).
Fields of papers citing papers by Neeraj Kayal
This network shows the impact of papers produced by Neeraj Kayal. 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 Neeraj Kayal. The network helps show where Neeraj Kayal may publish in the future.
Co-authorship network of co-authors of Neeraj Kayal
This figure shows the co-authorship network connecting the top 25 collaborators of Neeraj Kayal. A scholar is included among the top collaborators of Neeraj Kayal 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 Neeraj Kayal. Neeraj Kayal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 0 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | Lower Bounds for Sums of Products of Low arity Polynomials. | 2 |
| 7 | 15 | |
| 8 | A super-polynomial lower bound for regular arithmetic formulas. | 3 |
| 9 | An exponential lower bound for the sum of powers of bounded degree polynomials. | 27 |
| 10 | An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin. | 4 |
| 11 | Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. | 1 |
| 12 | Partial Derivatives in Arithmetic Complexity and Beyond (Foundations and Trends(R) in Theoretical Computer Science) | 4 |
| 13 | 9 | |
| 14 | 11 | |
| 15 | Algorithms for Arithmetic Circuits. | 2 |
| 16 | Blackbox Polynomial Identity Testing for Depth 3 Circuits. | 2 |
| 17 | 41 | |
| 18 | Derandomizing some number-theoretic and algebraic algorithms | 6 |
| 19 | 1 | |
| 20 | 32 |
About Neeraj Kayal
Neeraj Kayal is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory and Artificial Intelligence, having authored 44 papers that have together received 710 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Polynomial and algebraic computation (18 papers) and Coding theory and cryptography (15 papers). The work is most often cited by research in Computational Theory and Mathematics (487 citations), Computational Mathematics (16 citations) and Algebra and Number Theory (91 citations). Neeraj Kayal has collaborated with scholars based in India, United States and United Kingdom. Frequent co-authors include Nitin Saxena, Manindra Agrawal, Ramprasad Saptharishi, Ankit Gupta, Pritish Kamath, Shubhangi Saraf, James S. Walker, Martin Dyer, Nutan Limaye and Srikanth Srinivasan. Their work appears in journals such as Journal of the ACM, Annals of Mathematics and SIAM Journal on Computing.
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.