| 2023 | STOC | Randomized versus Deterministic Decision Tree Size. | Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal |
| 2022 | ICALP | Set Membership with Two Classical and Quantum Bit Probes. | Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan |
| 2021 | UAI | Generalized parametric path problems. | Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan |
| 2020 | MFCS | Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. | Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy |
| 2019 | CSR | Minimizing Branching Vertices in Distance-Preserving Subgraphs. | Kshitij Gajjar, Jaikumar Radhakrishnan |
| 2019 | FOCS | Parametric Shortest Paths in Planar Graphs. | Kshitij Gajjar, Jaikumar Radhakrishnan |
| 2018 | ISIT | Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. | Siddharth Bhandari, Jaikumar Radhakrishnan |
| 2017 | ESA | Distance-Preserving Subgraphs of Interval Graphs. | Kshitij Gajjar, Jaikumar Radhakrishnan |
| 2017 | ISIT | An improved bound on the zero-error list-decoding capacity of the 4/3 channel. | Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan |
| 2017 | STACS | Set Membership with Non-Adaptive Bit Probes. | Mohit Garg, Jaikumar Radhakrishnan |
| 2016 | ICALP | Partition Bound Is Quadratically Tight for Product Distributions. | Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan |
| 2015 | SODA | Set membership with a few bit probes. | Mohit Garg, Jaikumar Radhakrishnan |
| 2014 | FOCS | Topology Matters in Communication. | Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra |
| 2012 | FOCS | Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. | Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan |
| 2012 | ISAAC | More on a Problem of Zarankiewicz. | Chinmoy Dutta, Jaikumar Radhakrishnan |
| 2011 | WADS | Streaming Algorithms for 2-Coloring Uniform Hypergraphs. | Jaikumar Radhakrishnan, Saswata Shannigrahi |
| 2010 | ESA | Data Structures for Storing Small Sets in the Bitprobe Model. | Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi |
| 2010 | PODC | Online set packing and competitive scheduling of multi-part tasks. | Yuval Emek, Magns M. Halldrsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
| 2009 | SODA | Finding duplicates in a data stream. | Parikshit Gopalan, Jaikumar Radhakrishnan |
| 2008 | FOCS | Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. | Chinmoy Dutta, Jaikumar Radhakrishnan |
| 2008 | SODA | A tight lower bound for parity in noisy communication networks. | Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan |
| 2008 | SODA | Minimizing average latency in oblivious routing. | Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Rcke, Jaikumar Radhakrishnan |
| 2008 | SecureComm | Unassailable sensor networks. | Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan |
| 2006 | FOCS | Subspace Polynomials and List Decoding of Reed-Solomon Codes. | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
| 2006 | ICALP | Gap Amplification in PCPs Using Lazy Random Walks. | Jaikumar Radhakrishnan |
| 2006 | STACS | Tradeoffs in Depth-Two Superconcentrators. | Chinmoy Dutta, Jaikumar Radhakrishnan |
| 2006 | SecureComm | Sensor Networks that Are Provably Resilient. | Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan |
| 2005 | ICALP | On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. | Jaikumar Radhakrishnan, Martin Rtteler, Pranab Sen |
| 2005 | SODA | Complete partitions of graphs. | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
| 2005 | SPAA | Is partial quantum search of a database any easier? | Lov K. Grover, Jaikumar Radhakrishnan |
| 2004 | SPAA | Expansion properties of (secure) wireless networks. | Alessandro Panconesi, Jaikumar Radhakrishnan |
| 2003 | FOCS | A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
| 2003 | ICALP | A Direct Sum Theorem in Communication Complexity via Message Compression. | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
| 2003 | MFCS | On Converting CNF to DNF. | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
| 2003 | SODA | Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan |
| 2002 | FOCS | Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
| 2001 | ESA | Explicit Deterministic Constructions for Membership in the Bitprobe Model. | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
| 2000 | FOCS | The Quantum Complexity of Set Membership. | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
| 2000 | STOC | Are bitvectors optimal? | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
| 1999 | STOC | The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. | Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
| 1998 | FOCS | Improved Bounds and Algorithms for Hypergraph Two-Coloring. | Jaikumar Radhakrishnan, Aravind Srinivasan |
| 1998 | ICALP | Robust Asynchronous Protocols Are Finite-State. | Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni |
| 1997 | FOCS | Tight Bounds for Depth-two Superconcentrators. | Jaikumar Radhakrishnan, Amnon Ta-Shma |
| 1996 | STOC | Deterministic Restrictions in Circuit Complexity. | Shiva Chaudhuri, Jaikumar Radhakrishnan |
| 1994 | STOC | Greed is good: approximating independent sets in sparse and bounded-degree graphs. | Magns M. Halldrsson, Jaikumar Radhakrishnan |
| 1993 | FOCS | Directed vs. Undirected Monotone Contact Networks for Threshold Functions | Magns M. Halldrsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam |
| 1992 | FOCS | The Complexity of Parallel Prefix Problems on Small Domains | Shiva Chaudhuri, Jaikumar Radhakrishnan |
| 1991 | FOCS | Better Bounds for Threshold Formulas | Jaikumar Radhakrishnan |