Publications (27)
An entropy based proof of the Moore bound for irregular graphs
S. Ajesh Babu, Jaikumar Radhakrishnan
The zero-error randomized query complexity of the pointer function
Jaikumar Radhakrishnan, Swagato Sanyal
On Zarankiewicz Problem and Depth-Two Superconcentrators
Chinmoy Dutta, Jaikumar Radhakrishnan
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
Analytical Studies of Strategies for Utilization of Cache Memory in Computers
Satya N. Majumdar, Jaikumar Radhakrishnan
Distance-preserving Subgraphs of Interval Graphs
Kshitij Gajjar, Jaikumar Radhakrishnan
Quantum search for multiple items using parallel queries
Lov K. Grover, Jaikumar Radhakrishnan
A Sampling Technique of Proving Lower Bounds for Noisy Computations
Chinmoy Dutta, Jaikumar Radhakrishnan
On Strong Graph Partitions and Universal Steiner Trees
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan +2
How Hard is Computing Parity with Noisy Communications?
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath +1
One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Ahmad Warsi
Set membership with non-adaptive bit probes
Mohit Garg, Jaikumar Radhakrishnan
One-shot Marton inner bound for classical-quantum broadcast channel
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Warsi
Streaming algorithms for language recognition problems
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan +1
The Quantum Complexity of Set Membership
Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh
Minimizing Branching Vertices in Distance-preserving Subgraphs
Kshitij Gajjar, Jaikumar Radhakrishnan
A theorem about relative entropy of quantum states with an application to privacy in quantum communication
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Coordination Complexity: Small Information Coordinating Large Populations
Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan +2
Bounds on the Zero-Error List-Decoding Capacity of the $q/(q-1)$ Channel
Siddharth Bhandari, Jaikumar Radhakrishnan
Set Membership with a Few Bit Probes
Mohit Garg, Jaikumar Radhakrishnan
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
A direct sum theorem in communication complexity via message compression
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Parametric Shortest Paths in Planar Graphs
Kshitij Gajjar, Jaikumar Radhakrishnan
A lower bound for bounded round quantum communication complexity of set disjointness
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Hypergraph Two-Coloring in the Streaming Model
Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat
On divergence, relative entropy and the substate property
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Is partial quantum search of a database any easier?
Lov K. Grover, Jaikumar Radhakrishnan