Jaikumar Radhakrishnan

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 39

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

ISIT

Publications

Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. STOC (2023)
Siddharth Bhandari, Jaikumar Radhakrishnan
Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel. IEEE Trans. Inf. Theory 68 (1) (2022)
Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan
Set Membership with Two Classical and Quantum Bit Probes. ICALP (2022)
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. (2022)
Jaikumar Radhakrishnan, Aravind Srinivasan
Property B: Two-Coloring Non-Uniform Hypergraphs. FSTTCS (2021)
Prerona Chatterjee, Kshitij Gajjar, Jaikumar Radhakrishnan, Girish Varma
Generalized Parametric Path Problems. CoRR (2021)
Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan
Set membership with two classical and quantum bit probes. CoRR (2021)
Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan
Generalized parametric path problems. UAI (2021)
Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. MFCS (2020)
Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel. IEEE Trans. Inf. Theory 66 (2) (2020)
Kshitij Gajjar, Jaikumar Radhakrishnan
Parametric Shortest Paths in Planar Graphs. FOCS (2019)
Kshitij Gajjar, Jaikumar Radhakrishnan
Minimizing Branching Vertices in Distance-Preserving Subgraphs. CSR (2019)
Kshitij Gajjar, Jaikumar Radhakrishnan
Parametric Shortest Paths in Planar Graphs. Electron. Colloquium Comput. Complex. 25 (2018)
Siddharth Bhandari, Jaikumar Radhakrishnan
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. CoRR (2018)
Siddharth Bhandari, Jaikumar Radhakrishnan
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. ISIT (2018)
Kshitij Gajjar, Jaikumar Radhakrishnan
Parametric Shortest Paths in Planar Graphs. CoRR (2018)
Sagnik Mukhopadhyay, Jaikumar Radhakrishnan, Swagato Sanyal
Separation Between Deterministic and Randomized Query Complexity. SIAM J. Comput. 47 (4) (2018)
Kshitij Gajjar, Jaikumar Radhakrishnan
Minimizing Branching Vertices in Distance-preserving Subgraphs. CoRR (2018)
Kshitij Gajjar, Jaikumar Radhakrishnan
Distance-preserving Subgraphs of Interval Graphs. CoRR (2017)
Kshitij Gajjar, Jaikumar Radhakrishnan
Distance-Preserving Subgraphs of Interval Graphs. ESA (2017)
Mohit Garg, Jaikumar Radhakrishnan
Set Membership with Non-Adaptive Bit Probes. STACS (2017)
Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan
An improved bound on the zero-error list-decoding capacity of the 4/3 channel. ISIT (2017)
Venkatesan Guruswami, Jaikumar Radhakrishnan
Tight bounds for communication assisted agreement distillation. Electron. Colloquium Comput. Complex. 23 (2016)
Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu
Coordination Complexity: Small Information Coordinating Large Populations. ITCS (2016)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Partition Bound Is Quadratically Tight for Product Distributions. ICALP (2016)
Jaikumar Radhakrishnan, Swagato Sanyal
The zero-error randomized query complexity of the pointer function. CoRR (2016)
Jaikumar Radhakrishnan, Swagato Sanyal
The zero-error randomized query complexity of the pointer function. Electron. Colloquium Comput. Complex. 23 (2016)
Venkatesan Guruswami, Jaikumar Radhakrishnan
Tight Bounds for Communication-Assisted Agreement Distillation. Computational Complexity Conference (2016)
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Ahmad Warsi
One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel. IEEE Trans. Inf. Theory 62 (5) (2016)
Jaikumar Radhakrishnan, Swagato Sanyal
The Zero-Error Randomized Query Complexity of the Pointer Function. FSTTCS (2016)
Mohit Garg, Jaikumar Radhakrishnan
Set membership with non-adaptive bit probes. CoRR (2016)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. 22 (2015)
Mohit Garg, Jaikumar Radhakrishnan
Set Membership with a Few Bit Probes. CoRR (2015)
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
How Hard is Computing Parity with Noisy Communications? CoRR (2015)
Chinmoy Dutta, Jaikumar Radhakrishnan
A Sampling Technique of Proving Lower Bounds for Noisy Computations. CoRR (2015)
Mohit Garg, Jaikumar Radhakrishnan
Set membership with a few bit probes. SODA (2015)
Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat
Hypergraph Two-Coloring in the Streaming Model. CoRR (2015)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Relaxed partition bound is quadratically tight for product distributions. CoRR (2015)
Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu
Coordination Complexity: Small Information Coordinating Large Populations. CoRR (2015)
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Warsi
One-shot Marton inner bound for classical-quantum broadcast channel. CoRR (2014)
Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra
Topology Matters in Communication. FOCS (2014)
Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra
Topology matters in communication. Electron. Colloquium Comput. Complex. 21 (2014)
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma
Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494 (2013)
Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz
Online Set Packing. SIAM J. Comput. 41 (4) (2012)
Chinmoy Dutta, Jaikumar Radhakrishnan
More on a Problem of Zarankiewicz. ISAAC (2012)
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS (2012)
Chinmoy Dutta, Jaikumar Radhakrishnan
More on a Problem of Zarankiewicz CoRR (2012)
Alessandro Panconesi, Jaikumar Radhakrishnan
Expansion properties of (secure) wireless networks. ACM Trans. Algorithms 8 (3) (2012)
Jaikumar Radhakrishnan, Saswata Shannigrahi
Streaming Algorithms for 2-Coloring Uniform Hypergraphs. WADS (2011)
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs CoRR (2011)
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma
Streaming algorithms for language recognition problems CoRR (2011)
Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi
Data Structures for Storing Small Sets in the Bitprobe Model. ESA (2) (2010)
Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56 (1) (2010)
Ajesh Babu, Jaikumar Radhakrishnan
An entropy based proof of the Moore bound for irregular graphs CoRR (2010)
Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz
Online set packing and competitive scheduling of multi-part tasks. PODC (2010)
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
The communication complexity of correlation. IEEE Trans. Inf. Theory 56 (1) (2010)
Parikshit Gopalan, Jaikumar Radhakrishnan
Finding duplicates in a data stream. SODA (2009)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56 (6) (2009)
Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Algorithmica 55 (3) (2009)
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity CoRR (2008)
Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
Unassailable sensor networks. SecureComm (2008)
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
A tight lower bound for parity in noisy communication networks. SODA (2008)
Chinmoy Dutta, Jaikumar Radhakrishnan
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. FOCS (2008)
Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
Redoubtable Sensor Networks. ACM Trans. Inf. Syst. Secur. 11 (3) (2008)
Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan
Minimizing average latency in oblivious routing. SODA (2008)
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
The Communication Complexity of Correlation. Computational Complexity Conference (2007)
Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
Complete partitions of graphs. Comb. 27 (5) (2007)
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
-1) Channel. FSTTCS (2006)
Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
Sensor Networks that Are Provably Resilient. SecureComm (2006)
Jaikumar Radhakrishnan
Gap Amplification in PCPs Using Lazy Random Walks. ICALP (1) (2006)
Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS (2006)
Chinmoy Dutta, Jaikumar Radhakrishnan
Tradeoffs in Depth-Two Superconcentrators. STACS (2006)
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
The communication complexity of correlation. Electron. Colloquium Comput. Complex. 13 (151) (2006)
Nathan Linial, Jaikumar Radhakrishnan
Essential covers of the cube by hyperplanes. J. Comb. Theory, Ser. A 109 (2) (2005)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On converting CNF to DNF. Theor. Comput. Sci. 347 (1-2) (2005)
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71 (4) (2005)
Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
Complete partitions of graphs. SODA (2005)
Lov K. Grover, Jaikumar Radhakrishnan
Is partial quantum search of a database any easier? SPAA (2005)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27 (3) (2005)
Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. ICALP (2005)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Prior Entanglement, Message Compression and Privacy in Quantum Communication. Computational Complexity Conference (2005)
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan
Bounds for Error Reduction with Few Quantum Queries. APPROX-RANDOM (2005)
Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
Connectivity properties of secure wireless sensor networks. SASN (2004)
Alessandro Panconesi, Jaikumar Radhakrishnan
Expansion properties of (secure) wireless networks. SPAA (2004)
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA (2003)
Jaikumar Radhakrishnan
A note on scrambling permutations. Random Struct. Algorithms 22 (4) (2003)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP (2003)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A direct sum theorem in communication complexity via message compression CoRR (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF. MFCS (2003)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF Electron. Colloquium Comput. Complex. 10 (017) (2003)
S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
On the Hardness of Approximating Minimum Monopoly Problems. FSTTCS (2002)
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
Are Bitvectors Optimal? SIAM J. Comput. 31 (6) (2002)
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
The Quantum Complexity of Set Membership. Algorithmica 34 (4) (2002)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
Better Lower Bounds for Locally Decodable Codes. Computational Complexity Conference (2002)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS (2002)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS (2002)
Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
The Communication Complexity of Pointer Chasing. J. Comput. Syst. Sci. 62 (2) (2001)
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem CoRR (2001)
Jaikumar Radhakrishnan, Venkatesh Raman
A tradeoff between search and update in dictionaries. Inf. Process. Lett. 80 (5) (2001)

Jaikumar Radhakrishnan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jaikumar Radhakrishnan