Jaikumar Radhakrishnan

Most-cited papers

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
Jaikumar Radhakrishnan, A. Ta-Shma
2000SIAM Journal on Discrete Mathematics267 citations Open access
Semantic Scholar
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt P. Dubhashi, Alessandro Mei, A. Panconesi, Jaikumar Radhakrishnan +1 more
2003Journal of computer and system sciences (Print)173 citations Open access
Semantic Scholar
A Direct Sum Theorem in Communication Complexity via Message Compression
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
2003International Colloquium on Automata, Languages and Programming122 citations Open access
Semantic Scholar
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
P. Pandya, M. Agrawal, Jaikumar Radhakrishnan
2004Lecture Notes in Computer Science109 citations
Semantic Scholar
Redoubtable Sensor Networks
R. Di Pietro, L. Mancini, Alessandro Mei, A. Panconesi +1 more
2008TSEC102 citations
Semantic Scholar
Entropy and Counting ∗
Jaikumar Radhakrishnan
200197 citations
Semantic Scholar
Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
2002The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.86 citations
Semantic Scholar
Connectivity properties of secure wireless sensor networks
R. Di Pietro, L. Mancini, Alessandro Mei, A. Panconesi +1 more
2004ACM Workshop on Security of ad hoc and Sensor Networks81 citations
Semantic Scholar
A lower bound for bounded round quantum communication complexity of set disjointness
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
200379 citations
Semantic Scholar
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Jaikumar Radhakrishnan, M. Rötteler, P. Sen
2005Cybersecurity and Cyberforensics Conference76 citations
Semantic Scholar
Prior entanglement, message compression and privacy in quantum communication
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
2005Cybersecurity and Cyberforensics Conference69 citations
Semantic Scholar
Is partial quantum search of a database any easier?
Lov K. Grover, Jaikumar Radhakrishnan
2004ACM Symposium on Parallelism in Algorithms and Architectures62 citations Open access
Semantic Scholar
Improved bounds and algorithms for hypergraph 2-coloring
Jaikumar Radhakrishnan, A. Srinivasan
2000Random Struct. Algorithms53 citations
Semantic Scholar
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
E. Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2010IEEE Transactions on Information Theory52 citations
Semantic Scholar
Better lower bounds for locally decodable codes
A. Deshpande, Rahul Jain, T. Kavitha, Jaikumar Radhakrishnan +1 more
2002Proceedings 17th IEEE Annual Conference on Computational Complexity52 citations
Semantic Scholar
On converting CNF to DNF
Peter Bro Miltersen, Jaikumar Radhakrishnan, I. Wegener
2003Theoretical Computer Science48 citations Open access
Semantic Scholar
A property of quantum relative entropy with an application to privacy in quantum communication
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
2009JACM45 citations
Semantic Scholar
The Communication Complexity of Pointer Chasing
S. Ponzio, Jaikumar Radhakrishnan, Venkatesh Srinivasan
2001Journal of computer and system sciences (Print)40 citations Open access
Semantic Scholar
The Communication Complexity of Correlation
P. Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2010IEEE Transactions on Information Theory37 citations Open access
Semantic Scholar
Sensor Networks that Are Provably Resilient
R. Di Pietro, L. Mancini, Alessandro Mei, A. Panconesi +1 more
20062006 Securecomm and Workshops36 citations
Semantic Scholar
Topology Matters in Communication
A. Chattopadhyay, Jaikumar Radhakrishnan, A. Rudra
2014IEEE Annual Symposium on Foundations of Computer Science34 citations
Semantic Scholar
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
Rahul Jain, P. Sen, Jaikumar Radhakrishnan
2008arXiv.org34 citations
Semantic Scholar
One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel
Jaikumar Radhakrishnan, P. Sen, Naqueeb Ahmad Warsi
2014IEEE Transactions on Information Theory33 citations Open access
Semantic Scholar
A tight lower bound for parity in noisy communication networks
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
2008ACM-SIAM Symposium on Discrete Algorithms33 citations
Semantic Scholar
Explicit Deterministic Constructions for Membership in the Bitprobe Model
Jaikumar Radhakrishnan, Venkatesh Raman, S. Rao
2001Embedded Systems and Applications33 citations
Semantic Scholar
On Dinur’s proof of the PCP theorem
Jaikumar Radhakrishnan, M. Sudan
200632 citations Open access
Semantic Scholar
Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks
Devdatt P. Dubhashi, Alessandro Mei, A. Panconesi, Jaikumar Radhakrishnan +1 more
200323rd International Conference on Distributed Computing Systems, 2003. Proceedings.32 citations
Semantic Scholar
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
Jaikumar Radhakrishnan, M. Rötteler, P. Sen
2005International Colloquium on Automata, Languages and Programming28 citations Open access
Semantic Scholar
Streaming algorithms for language recognition problems
Ajesh Babu, N. Limaye, Jaikumar Radhakrishnan, G. Varma
2011Theoretical Computer Science27 citations Open access
Semantic Scholar
Finding duplicates in a data stream
Parikshit Gopalan, Jaikumar Radhakrishnan
2009ACM-SIAM Symposium on Discrete Algorithms25 citations
Semantic Scholar
Minimizing average latency in oblivious routing
P. Harsha, T. Hayes, Hariharan Narayanan, H. Räcke +1 more
2008ACM-SIAM Symposium on Discrete Algorithms25 citations
Semantic Scholar
An improved bound on the zero-error list-decoding capacity of the 4/3 channel
Marco Dalai, Venkatesan Guruswami Carnegie, Jaikumar Radhakrishnan
2017International Symposium on Information Theory24 citations Open access
Semantic Scholar
Data Structures for Storing Small Sets in the Bitprobe Model
Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi
2010Embedded Systems and Applications24 citations
Semantic Scholar
Online Set Packing
Y. Emek, M. Halldórsson, Y. Mansour, B. Patt-Shamir +2 more
2012SIAM journal on computing (Print)23 citations
Semantic Scholar
Open Problems in Data Streams, Property Testing, and Related Topics
P. Indyk, A. Mcgregor, Nir Ailon, N. Alon +49 more
201122 citations
Semantic Scholar
On the Hardness of Approximating Minimum Monopoly Problems
S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2002Foundations of Software Technology and Theoretical Computer Science22 citations
Semantic Scholar
Online set packing and competitive scheduling of multi-part tasks
Y. Emek, M. Halldórsson, Y. Mansour, B. Patt-Shamir +2 more
2010ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing21 citations Open access
Semantic Scholar
Bounds for Error Reduction with Few Quantum Queries
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan
2005International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques21 citations
Semantic Scholar
One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma
Jaikumar Radhakrishnan, P. Sen, Naqueeb Ahmad Warsi
201720 citations
Semantic Scholar
Set membership with a few bit probes
M. Garg, Jaikumar Radhakrishnan
2015ACM-SIAM Symposium on Discrete Algorithms20 citations
Semantic Scholar
Unassailable sensor networks
Alessandro Mei, A. Panconesi, Jaikumar Radhakrishnan
2008Security and Privacy in Communication Networks20 citations
Semantic Scholar
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan, P. Sen, S. Vishwanathan
2000Foundations of Software Technology and Theoretical Computer Science19 citations
Semantic Scholar
Subspace Polynomials and List Decoding of Reed-Solomon Codes
E. Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2006IEEE Annual Symposium on Foundations of Computer Science18 citations
Semantic Scholar
The Quantum Complexity of Set Membership
Jaikumar Radhakrishnan, P. Sen, Venkatesh Srinivasan
2000Proceedings 41st Annual Symposium on Foundations of Computer Science18 citations
Semantic Scholar
Tight Bounds for Communication-Assisted Agreement Distillation
V. Guruswami, Jaikumar Radhakrishnan
2016Cybersecurity and Cyberforensics Conference17 citations
Semantic Scholar
Complete partitions of graphs
M. Halldórsson, G. Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2005ACM-SIAM Symposium on Discrete Algorithms17 citations
Semantic Scholar
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
C. Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, R. Rajaraman +1 more
2011IEEE Annual Symposium on Foundations of Computer Science16 citations Open access
Semantic Scholar
An entropy based proof of the Moore bound for irregular graphs
Ajesh Babu, Jaikumar Radhakrishnan
2010arXiv.org16 citations
Semantic Scholar
A new information-theoretic property about quantum states with an application to privacy in quantum communication ∗
Rahul Jain, Jaikumar Radhakrishnan, P. Sen
200916 citations
Semantic Scholar
Quantum search for multiple items using parallel queries
Lov K. Grover, Jaikumar Radhakrishnan
200416 citations
Semantic Scholar