Jaikumar Radhakrishnan

2.5k citations
93 papers · 1.4k · h-index 21

Impact in

Papers in

Jaikumar Radhakrishnan

86 papers receiving 1.3k citations

Peers

Jaikumar Radhakrishnan
Comparison fields: 5 of 56
  • Discrete Mathematics and Combinatorics 163
  • Computational Theory and Mathematics 740
  • Computer Networks and Communications 515
  • Artificial Intelligence 697
  • Computer Graphics and Computer-Aided Design 65
Replace Ravi B. Boppana with:
Ravi B. Boppana United States
Thore Husfeldt Denmark
Ilan Newman Israel
Richard Beigel United States
Andreas Björklund Sweden
Shachar Lovett United States
Guy Kindler Israel
Martin Fürer United States
Richard Zippel United States
M. Sipser United States
Jaikumar Radhakrishnan relative to Ravi B. Boppana United States Ravi B. Boppana's profile →
Citations per field
00.5×
Ravi B. Boppana · 1×
Citations per year

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-authors

The 25 scholars most cited alongside Jaikumar Radhakrishnan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Jaikumar Radhakrishnan Line = papers co-authored together Jaikumar Radhakrishnan links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 93 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2000149
2 200085
3 199481
4 200859
5 200353
6 200551
7 200250
8 200445
9 200337
10 200533
11 199730
12 200029
13 201028
14 200327
15 200227
16 200924
17 200424
18 200522
19 200622
20 199421

About Jaikumar Radhakrishnan

Jaikumar Radhakrishnan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics, having authored 93 papers that have together received 1.4k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (53 papers), Advanced Graph Theory Research (25 papers), Limits and Structures in Graph Theory (16 papers), Cryptography and Data Security (14 papers), Optimization and Search Problems (12 papers), graph theory and CDMA systems (12 papers), Algorithms and Data Compression (10 papers) and Cooperative Communication and Network Coding (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (163 citations), Computational Theory and Mathematics (740 citations), Computer Networks and Communications (515 citations), Artificial Intelligence (697 citations) and Computer Graphics and Computer-Aided Design (65 citations). Jaikumar Radhakrishnan has collaborated with scholars based in India, United States and Italy. Frequent co-authors include Amnon Ta‐Shma, Magnús M. Halldórsson, Pranab Kumar Sen, Rahul Jain, Aravind Srinivasan, Alessandro Panconesi, Alessandro Mei, Luigi V. Mancini, Roberto Di Pietro and Peter Bro Miltersen. Their work appears in journals such as Random Structures and Algorithms, IEEE Transactions on Information Theory, SIAM Journal on Computing, Journal of Computer and System Sciences and Algorithmica.

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