Jaikumar Radhakrishnan

International Centre for Theoretical Sciences — India

Computer Science · Physical Sciences

27h-index2.4kcitations138works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(68), Advanced Graph Theory Research(33), Limits and Structures in Graph Theory(22), Cryptography and Data Security(18), Quantum Computing Algorithms and Architecture(17)

Publications138 total

Optimal Two-Round Communication Lower Bound for Graph Connectivity via Pointer Chasing
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
Julia Robinson and Hilbert’s Tenth Problem
Resonance·2024· 1 cited
Ronald L. Graham
Resonance·2023
Randomized versus Deterministic Decision Tree Size
2023· 2 citedOpen Access
Bounds on the Zero-Error List-Decoding Capacity of the <i>q</i>/(<i>q</i> – 1) Channel
IEEE Transactions on Information Theory·2021· 5 cited
Generalized Parametric Path Problems
Uncertainty in Artificial Intelligence·2021
Generalized Parametric Path Problems
arXiv (Cornell University)·2021Open Access
Property B: Two-Coloring Non-Uniform Hypergraphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020Open Access
Parametric Shortest Paths in Planar Graphs
2019· 5 cited
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
IEEE Transactions on Information Theory·2019· 10 citedOpen Access
Minimizing Branching Vertices in Distance-Preserving Subgraphs
Lecture notes in computer science·2019Open Access
Parametric Shortest Paths in Planar Graphs
arXiv (Cornell University)·2018Open Access
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel
2018· 3 citedOpen Access
Separation Between Deterministic and Randomized Query Complexity
SIAM Journal on Computing·2018· 2 cited
Distance-preserving Subgraphs of Interval Graphs
arXiv (Cornell University)·2017· 2 citedOpen Access
An improved bound on the zero-error list-decoding capacity of the 4/3 channel
2017· 15 citedOpen Access
One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma
arXiv (Cornell University)·2017· 13 citedOpen Access
Distance-Preserving Subgraphs of Interval Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 5 citedOpen Access
Set Membership with Non-Adaptive Bit Probes
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 3 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Pranab Kumar Sen(12), Rahul Jain(9), Magnús M. Halldórsson(6), Alessandro Panconesi(4), Alessandro Mei(3), Venkatesh Srinivasan(3), Amnon Ta‐Shma(2), Aravind Srinivasan(2), Roberto Di Pietro(2), Luigi V. Mancini(2), Harry Buhrman(2), Peter Bro Miltersen(2), Stephen Ponzio(2), Martin Rötteler(2), Naqueeb Ahmad Warsi(2), Yuval Emek(2), Boaz Patt-Shamir(2), Dror Rawitz(2), Devdatt Dubhashi(1), Alessandro Mei(1)