Srikanth Srinivasan
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Discrete Mathematics and Combinatorics top 10%
- Electrical and Electronic Engineering
- Statistics and Probability
- Co-authors
- Nutan LimayeV. ArvindHervé FournierSwastik KoppartyNeeraj KayalMichael SaksRussell ImpagliazzoPrahladh Harsha
- Topics
- Complexity and Algorithms in Graphs (40 papers)Machine Learning and Algorithms (15 papers)Advanced Graph Theory Research (15 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsArtificial Intelligence
- Partner nations
- IndiaUnited StatesFrance
In The Last Decade
Srikanth Srinivasan
40 papers receiving 166 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 165
- Artificial Intelligence 111
- Discrete Mathematics and Combinatorics 19
- Electrical and Electronic Engineering 17
- Statistics and Probability 15
Countries citing papers authored by Srikanth Srinivasan
This map shows the geographic impact of Srikanth Srinivasan'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 Srikanth Srinivasan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Srikanth Srinivasan more than expected).
Fields of papers citing papers by Srikanth Srinivasan
This network shows the impact of papers produced by Srikanth Srinivasan. 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 Srikanth Srinivasan. The network helps show where Srikanth Srinivasan may publish in the future.
Co-authorship network of co-authors of Srikanth Srinivasan
This figure shows the co-authorship network connecting the top 25 collaborators of Srikanth Srinivasan. A scholar is included among the top collaborators of Srikanth Srinivasan 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 Srikanth Srinivasan. Srikanth Srinivasan 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 | 1 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 1 | |
| 7 | 1 | |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 0 | |
| 11 | 2 | |
| 12 | 2 | |
| 13 | Lower bounds for non-commutative skew circuits. | 1 |
| 14 | A Compression Algorithm for AC 0 ( ) circuits using Certifying Polynomials | 2 |
| 15 | 11 | |
| 16 | 21 | |
| 17 | Lower bounds for depth 4 formulas computing iterated matrix multiplication. | 2 |
| 18 | 4 | |
| 19 | Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates | 3 |
| 20 | On the Limits of Sparsification | 1 |
About Srikanth Srinivasan
Srikanth Srinivasan is a scholar working on Computational Theory and Mathematics, Computational Mathematics and Discrete Mathematics and Combinatorics, having authored 52 papers that have together received 189 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (40 papers), Machine Learning and Algorithms (15 papers) and Advanced Graph Theory Research (15 papers). The work is most often cited by research in Computational Theory and Mathematics (165 citations), Discrete Mathematics and Combinatorics (19 citations) and Artificial Intelligence (111 citations). Srikanth Srinivasan has collaborated with scholars based in India, United States and France. Frequent co-authors include Nutan Limaye, V. Arvind, Hervé Fournier, Swastik Kopparty, Neeraj Kayal, Michael Saks, Russell Impagliazzo, Prahladh Harsha, Shachar Lovett and Paul Beame. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and COMBINATORICA.
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.