Jaikumar Radhakrishnan
Impact in
-
- Limits and Structures in Graph Theory
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 41
- Advanced Graph Theory Research 16
-
- Cryptography and Data Security 10
- Machine Learning and Algorithms 9
- Co-authors
- Amnon Ta‐Shma (2 shared papers)Magnús M. Halldórsson (7 shared papers)Aravind Srinivasan (3 shared papers)Rahul Jain (6 shared papers)Pranab Kumar Sen (6 shared papers)Alessandro Panconesi (5 shared papers)Venkatesh Srinivasan (5 shared papers)Alessandro Mei (3 shared papers)
- Journals
- IEEE Transactions on Information Theory (4 papers)Random Structures and Algorithms (3 papers)Journal of Computer and System Sciences (3 papers)SIAM Journal on Computing (3 papers)Algorithmica (2 papers)
- Partner nations
- IndiaUnited StatesItaly
In The Last Decade
Jaikumar Radhakrishnan
63 papers receiving 892 citations
Peers
Comparison fields: 5 of 51
- Discrete Mathematics and Combinatorics 130
- Computational Theory and Mathematics 488
- Computer Networks and Communications 361
- Artificial Intelligence 472
- Computer Graphics and Computer-Aided Design 44
Countries citing papers authored by Jaikumar Radhakrishnan
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
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.
All Works
Showing the 20 most-cited of 70 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 103 | |
| 2 | 2000 | 74 | |
| 3 | 1994 | 61 | |
| 4 | 2008 | 54 | |
| 5 | 2005 | 41 | |
| 6 | 2004 | 40 | |
| 7 | 2002 | 38 | |
| 8 | 2003 | 34 | |
| 9 | 2005 | 32 | |
| 10 | 2010 | 27 | |
| 11 | 1997 | 26 | |
| 12 | 2003 | 23 | |
| 13 | 2004 | 22 | |
| 14 | 2000 | 22 | |
| 15 | 2005 | 21 | |
| 16 | 2009 | 21 | |
| 17 | A tight lower bound for parity in noisy communication networks | 2008 | 18 |
| 18 | 2002 | 18 | |
| 19 | 2008 | 18 | |
| 20 | 2002 | 17 |
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 70 papers that have together received 986 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (16 papers), Optimization and Search Problems (10 papers), graph theory and CDMA systems (10 papers), Cryptography and Data Security (10 papers), Machine Learning and Algorithms (9 papers), Limits and Structures in Graph Theory (8 papers) and Cooperative Communication and Network Coding (8 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (130 citations), Computational Theory and Mathematics (488 citations), Computer Networks and Communications (361 citations), Artificial Intelligence (472 citations) and Computer Graphics and Computer-Aided Design (44 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, Aravind Srinivasan, Rahul Jain, Pranab Kumar Sen, Alessandro Panconesi, Venkatesh Srinivasan, Alessandro Mei, Roberto Di Pietro and Luigi V. Mancini. Their work appears in journals such as IEEE Transactions on Information Theory, Random Structures and Algorithms, Journal of Computer and System Sciences, SIAM Journal on Computing 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.