Jaikumar Radhakrishnan

90 papers receiving 1.9k citations

Peers

Jaikumar Radhakrishnan
Comparison fields: 5 of 55
  • Discrete Mathematics and Combinatorics 313
  • Computational Theory and Mathematics 818
  • Artificial Intelligence 804
  • Computer Networks and Communications 417
  • Statistical and Nonlinear Physics 54
Replace Shlomo Hoory with:
Shlomo Hoory Israel
Petteri Kaski Finland
Luisa Gargano Italy
Ravi B. Boppana United States
René Peralta United States
Alex Samorodnitsky Israel
James B. Shearer United States
Eugene M. Luks United States
Daniel Panario Canada
W. Fernandez de la Véga France
Jaikumar Radhakrishnan relative to Shlomo Hoory Israel Shlomo Hoory's profile →
Citations per field
00.5×1.5×2.2×
Shlomo Hoory · 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 1997190
2 2000156
3 2007137
4 2005119
5 2000101
6 199480
7 200869
8 200365
9 200257
10 200346
11 200445
12 199644
13 199738
14 200536
15 200434
16 201034
17 200332
18 200932
19 200231
20 200029

About Jaikumar Radhakrishnan

Jaikumar Radhakrishnan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Computer Networks and Communications and Geometry and Topology, having authored 93 papers that have together received 2.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (43 papers), Algorithms and Data Compression (13 papers), Limits and Structures in Graph Theory (12 papers), Coding theory and cryptography (10 papers), Quantum Information and Cryptography (9 papers), Quantum Computing Algorithms and Architecture (7 papers), semigroups and automata theory (4 papers) and Security in Wireless Sensor Networks (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (313 citations), Computational Theory and Mathematics (818 citations), Artificial Intelligence (804 citations), Computer Networks and Communications (417 citations) and Statistical and Nonlinear Physics (54 citations). Jaikumar Radhakrishnan has collaborated with scholars based in India, United States and Israel. Frequent co-authors include Magnús M. Halldórsson, Rahul Jain, Amnon Ta‐Shma, Aravind Srinivasan, Alessandro Panconesi, Alessandro Mei, Prahladh Harsha, David McAllester, Peter Bro Miltersen and Luigi Vincenzo Mancini. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing, Journal of Computer and System Sciences, Random Structures and Algorithms and Theoretical Computer Science.

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