Jaikumar Radhakrishnan

2.4k total citations
70 papers, 986 citations indexed

About

Jaikumar Radhakrishnan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Jaikumar Radhakrishnan has authored 70 papers receiving a total of 986 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computational Theory and Mathematics, 36 papers in Artificial Intelligence and 25 papers in Computer Networks and Communications. Recurrent topics in Jaikumar Radhakrishnan's work include Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (10 papers). Jaikumar Radhakrishnan is often cited by papers focused on Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (10 papers). Jaikumar Radhakrishnan collaborates with scholars based in India, United States and Italy. Jaikumar Radhakrishnan's co-authors include Amnon Ta‐Shma, Magnús M. Halldórsson, Aravind Srinivasan, Rahul Jain, Pranab Kumar Sen, Alessandro Panconesi, Venkatesh Srinivasan, Alessandro Mei, Luigi V. Mancini and Roberto Di Pietro and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Jaikumar Radhakrishnan

63 papers receiving 892 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jaikumar Radhakrishnan India 19 488 472 361 209 130 70 986
David Steurer United States 21 707 1.4× 383 0.8× 264 0.7× 83 0.4× 53 0.4× 47 1.1k
Michael J. Dinneen New Zealand 15 413 0.8× 361 0.8× 178 0.5× 96 0.5× 47 0.4× 80 791
Guy Kindler Israel 18 721 1.5× 478 1.0× 358 1.0× 119 0.6× 90 0.7× 50 1.1k
Ravi B. Boppana United States 13 744 1.5× 532 1.1× 216 0.6× 117 0.6× 97 0.7× 26 1.1k
Steven Rudich United States 19 927 1.9× 1.2k 2.5× 224 0.6× 165 0.8× 80 0.6× 36 1.6k
Thore Husfeldt Denmark 12 497 1.0× 194 0.4× 198 0.5× 50 0.2× 92 0.7× 42 708
Alex Samorodnitsky Israel 17 571 1.2× 419 0.9× 199 0.6× 88 0.4× 128 1.0× 44 857
Yury Makarychev United States 15 502 1.0× 222 0.5× 212 0.6× 84 0.4× 35 0.3× 51 769
M. Sipser United States 11 545 1.1× 556 1.2× 569 1.6× 401 1.9× 68 0.5× 12 1.2k
Konstantin Makarychev United States 18 553 1.1× 349 0.7× 427 1.2× 99 0.5× 36 0.3× 68 1.2k

Countries citing papers authored by Jaikumar Radhakrishnan

Since Specialization
Citations

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

Fields of papers citing papers by Jaikumar Radhakrishnan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jaikumar Radhakrishnan

This figure shows the co-authorship network connecting the top 25 collaborators of Jaikumar Radhakrishnan. A scholar is included among the top collaborators of Jaikumar Radhakrishnan 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 Jaikumar Radhakrishnan. Jaikumar Radhakrishnan 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
1.
Radhakrishnan, Jaikumar, et al.. (2024). Julia Robinson and Hilbert’s Tenth Problem. Resonance. 29(6). 747–757.
2.
Guruswami, Venkatesan & Jaikumar Radhakrishnan. (2016). Tight Bounds for Communication-Assisted Agreement Distillation. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
3.
Guruswami, Venkatesan & Jaikumar Radhakrishnan. (2016). Tight bounds for communication assisted agreement distillation.. Electronic colloquium on computational complexity. 23. 33. 1 indexed citations
4.
Radhakrishnan, Jaikumar, et al.. (2015). Set membership with a few bit probes. Symposium on Discrete Algorithms. 776–784. 3 indexed citations
5.
Chattopadhyay, Arkadev, Jaikumar Radhakrishnan, & Atri Rudra. (2014). Topology matters in communication.. Electronic colloquium on computational complexity. 21. 74.
6.
Radhakrishnan, Jaikumar. (2014). Conversations: from Alan Turing to NP-Completeness. Current Science. 106(12). 1696–1701. 1 indexed citations
7.
Limaye, Nutan, et al.. (2013). Streaming algorithms for language recognition problems. Theoretical Computer Science. 494. 13–23. 5 indexed citations
8.
Gopalan, Parikshit & Jaikumar Radhakrishnan. (2009). Finding duplicates in a data stream. Symposium on Discrete Algorithms. 402–411. 10 indexed citations
9.
Harsha, Prahladh, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, & Jaikumar Radhakrishnan. (2008). Minimizing average latency in oblivious routing. Symposium on Discrete Algorithms. 200–207. 8 indexed citations
10.
Kanoria, Yashodhan, et al.. (2008). A tight lower bound for parity in noisy communication networks. Symposium on Discrete Algorithms. 1056–1065. 18 indexed citations
11.
Kortsarz, Guy, et al.. (2005). Complete partitions of graphs. Symposium on Discrete Algorithms. 860–869. 6 indexed citations
12.
Dubhashi, Devdatt, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, & Aravind Srinivasan. (2005). Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences. 71(4). 467–479. 41 indexed citations
13.
Linial, Nathan & Jaikumar Radhakrishnan. (2004). Essential covers of the cube by hyperplanes. Journal of Combinatorial Theory Series A. 109(2). 331–338. 6 indexed citations
14.
Radhakrishnan, Jaikumar & A. Srinivasan. (2002). Improved bounds and algorithms for hypergraph two-coloring. 684–693. 18 indexed citations
15.
Buhrman, Harry, Peter Bro Miltersen, Jaikumar Radhakrishnan, & Venkatesh Srinivasan. (2002). Are Bitvectors Optimal?. SIAM Journal on Computing. 31(6). 1723–1744. 38 indexed citations
16.
Radhakrishnan, Jaikumar, et al.. (2001). The Communication Complexity of Pointer Chasing. Journal of Computer and System Sciences. 62(2). 323–355. 15 indexed citations
17.
Radhakrishnan, Jaikumar & Aravind Srinivasan. (2000). Improved bounds and algorithms for hypergraph 2-coloring. Random Structures and Algorithms. 16(1). 4–32. 74 indexed citations
18.
Radhakrishnan, Jaikumar. (1997). Better Lower Bounds for Monotone Threshold Formulas. Journal of Computer and System Sciences. 54(2). 221–226. 4 indexed citations
19.
Radhakrishnan, Jaikumar. (1997). An Entropy Proof of Bregman's Theorem. Journal of Combinatorial Theory Series A. 77(1). 161–164. 26 indexed citations
20.
Halldórsson, Magnús M. & Jaikumar Radhakrishnan. (1994). Improved approximations of independent sets in bounded-degree graphs via subgraph removal. Nordic journal of computing. 1(4). 475–492. 14 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

Breakdown of academic impact, for papers by David Steurer Breakdown of academic impact, for papers by Michael J. Dinneen Breakdown of academic impact, for papers by Guy Kindler Breakdown of academic impact, for papers by Ravi B. Boppana Breakdown of academic impact, for papers by Steven Rudich Breakdown of academic impact, for papers by Thore Husfeldt Breakdown of academic impact, for papers by Alex Samorodnitsky Breakdown of academic impact, for papers by Yury Makarychev Breakdown of academic impact, for papers by M. Sipser Breakdown of academic impact, for papers by Konstantin Makarychev
Rankless by CCL
2026