| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Chinmoy Dutta, Jaikumar Radhakrishnan |
More on a Problem of Zarankiewicz  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma |
Streaming algorithms for language recognition problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan |
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Saswata Shannigrahi |
Streaming Algorithms for 2-Coloring Uniform Hypergraphs. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajesh Babu, Jaikumar Radhakrishnan |
An entropy based proof of the Moore bound for irregular graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan |
The communication complexity of correlation. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace polynomials and limits to list decoding of Reed-Solomon codes. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Shannigrahi |
Data Structures for Storing Small Sets in the Bitprobe Model. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
multi-packet frames, online set packing, packet fragmentation, competitive analysis |
| 1 | Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen |
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Random orthonormal measurement bases, Ensemble quantum state distinction, Hidden subgroup problem, Frobenius distance, Quantum Fourier transforms, Gel’fand pairs, Quantum algorithms |
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A property of quantum relative entropy with an application to privacy in quantum communication. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
quantum communication complexity, Privacy, quantum information theory |
| 1 | Parikshit Gopalan, Jaikumar Radhakrishnan |
Finding duplicates in a data stream. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan |
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan |
Redoubtable Sensor Networks. |
ACM Trans. Inf. Syst. Secur. |
2008 |
DBLP DOI BibTeX RDF |
Wireless sensor network, connectivity, random graphs, probabilistic key sharing |
| 1 | Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan |
Minimizing average latency in oblivious routing. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan |
A tight lower bound for parity in noisy communication networks. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chinmoy Dutta, Jaikumar Radhakrishnan |
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan |
The Communication Complexity of Correlation. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan |
The communication complexity of correlation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
Gap Amplification in PCPs Using Lazy Random Walks. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chinmoy Dutta, Jaikumar Radhakrishnan |
Tradeoffs in Depth-Two Superconcentrators. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan |
Sensor Networks that Are Provably Resilient. |
SecureComm |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace Polynomials and List Decoding of Reed-Solomon Codes. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte |
Zero Error List-Decoding Capacity of the q/(q-1) Channel. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, Jaikumar Radhakrishnan |
Essential covers of the cube by hyperplanes. |
J. Comb. Theory, Ser. A |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On converting CNF to DNF. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan |
Lower bounds for adaptive locally decodable codes. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Lov K. Grover, Jaikumar Radhakrishnan |
Is partial quantum search of a database any easier? |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
amplitude amplification, partial search, quantum search |
| 1 | Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan |
Bounds for Error Reduction with Few Quantum Queries. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
Prior Entanglement, Message Compression and Privacy in Quantum Communication. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan |
Connectivity properties of secure wireless sensor networks. |
SASN |
2004 |
DBLP DOI BibTeX RDF |
sensor networks, connectivity, key management, random graphs, probabilistic key sharing |
| 1 | Alessandro Panconesi, Jaikumar Radhakrishnan |
Expansion properties of (secure) wireless networks. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
security, ad hoc networks, wireless networks, distributed algorithms, connectivity, expanders |
| 1 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On Converting CNF to DNF |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
A note on scrambling permutations. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A direct sum theorem in communication complexity via message compression |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Ad hoc networks, distributed algorithms, dominating sets |
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A Direct Sum Theorem in Communication Complexity via Message Compression. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On Converting CNF to DNF. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paritosh K. Pandya, Jaikumar Radhakrishnan (eds.) |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings |
FSTTCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
Are Bitvectors Optimal? |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam |
Better Lower Bounds for Locally Decodable Codes. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Second Moment Method, Probabilistically Checkable Proof Systems, Error Correcting Codes, Pseudorandom Generators, Private Information Retrieval |
| 1 | S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
On the Hardness of Approximating Minimum Monopoly Problems. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Venkatesh Raman |
A tradeoff between search and update in dictionaries. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan |
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
The Communication Complexity of Pointer Chasing. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
Explicit Deterministic Constructions for Membership in the Bitprobe Model. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Improved bounds and algorithms for hypergraph 2-coloring. |
Random Struct. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Amnon Ta-Shma |
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm |
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan |
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
Are bitvectors optimal? |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). (PDF / PS) |
IEEE Conference on Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
pointer chasing, entropy, Communication complexity |
| 1 | Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni |
Robust Asynchronous Protocols Are Finite-State. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni |
Towards a Characterisation of Finite-State Message-Passing Systems. |
ASIAN |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Improved Bounds and Algorithms for Hypergraph Two-Coloring. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Hypergraph coloring, The Probabilistic Method, Lovasz Local Lemma |
| 1 | Jaikumar Radhakrishnan |
An Entropy Proof of Bregman's Theorem. |
J. Comb. Theory, Ser. A |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan |
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Complexity of Parallel Prefix Problems on Small Domains. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
Better Lower Bounds for Monotone Threshold Formulas. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Amnon Ta-Shma |
Tight Bounds for Depth-two Superconcentrators. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
depth-two superconcentrators, optimal bounds, disperser graphs, entropy loss, superconcentrator, entropy, directed graphs, directed graph, edges, tight bounds |
| 1 | Shiva Chaudhuri, Jaikumar Radhakrishnan |
Deterministic Restrictions in Circuit Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
Pi-Sigma-Pi Threshold Formulas. |
Mathematical Systems Theory |
1996 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Randomized Complexity of Maintaining the Minimum. |
Nord. J. Comput. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Randomized Complexity of Maintaining the Minimum. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Chaudhuri, Jaikumar Radhakrishnan |
Deterministic Restrictions in Circuit Complexity. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuro Nishino, Jaikumar Radhakrishnan |
On the Number of Negations Needed to Compute Parity Functions. |
IEICE Transactions |
1995 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, K. V. Subrahmanyam |
Directed Monotone Contact Networks for Threshold Functions. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
Sigma Pi Sigma Threshold Formulas. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan |
Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. |
Nord. J. Comput. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan |
Improved Approximations of Independent Sets in Bounded-Degree Graphs. |
SWAT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan |
Greed is good: approximating independent sets in sparse and bounded-degree graphs. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam |
Directed vs. Undirected Monotone Contact Networks for Threshold Functions |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
Boolean functions complexity, monotone contact networks, almost optimal, lower bound, upper bound, threshold functions |
| 1 | Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam |
On Some Communication Complexity Problems Related to THreshold Functions. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan |
Improved Bounds for Covering Complete Uniform Hypergraphs. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Complexity of Parallel Prefix Problems on Small Domains |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
small domain problems, parallel prefix problems, small domains, prefix maxima, range maxima, parenthesis matching problem, very fast parallel algorithms, complexity, lower bound, chaining, CRCW PRAM model |
| 1 | Jaikumar Radhakrishnan |
Better Bounds for Threshold Formulas |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
stronger monotone contact networks model, better bounds, nearly optimal bounds, threshold formulas, monotone formula, computation, threshold functions |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")