The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jaikumar Radhakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan
    Bounds for Error Reduction with Few Quantum Queries. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:245-256 [Conf]
  2. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Towards a Characterisation of Finite-State Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:282-299 [Conf]
  3. Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
    Better Lower Bounds for Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:184-193 [Conf]
  4. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    Prior Entanglement, Message Compression and Privacy in Quantum Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:285-296 [Conf]
  5. Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:7- [Conf]
  6. Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
    Explicit Deterministic Constructions for Membership in the Bitprobe Model. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:290-299 [Conf]
  7. Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Complexity of Parallel Prefix Problems on Small Domains [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:638-647 [Conf]
  8. Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    Directed vs. Undirected Monotone Contact Networks for Threshold Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:604-613 [Conf]
  9. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:429-438 [Conf]
  10. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:220-229 [Conf]
  11. Jaikumar Radhakrishnan
    Better Bounds for Threshold Formulas [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:314-323 [Conf]
  12. Jaikumar Radhakrishnan, Aravind Srinivasan
    Improved Bounds and Algorithms for Hypergraph Two-Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:684-693 [Conf]
  13. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:554-562 [Conf]
  14. Jaikumar Radhakrishnan, Amnon Ta-Shma
    Tight Bounds for Depth-two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:585-594 [Conf]
  15. Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
    Subspace Polynomials and List Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:207-216 [Conf]
  16. Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
    Zero Error List-Decoding Capacity of the q/(q-1) Channel. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:129-138 [Conf]
  17. Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    On Some Communication Complexity Problems Related to THreshold Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:248-259 [Conf]
  18. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:218-229 [Conf]
  19. S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
    On the Hardness of Approximating Minimum Monopoly Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:277-288 [Conf]
  20. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:176-187 [Conf]
  21. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    A Direct Sum Theorem in Communication Complexity via Message Compression. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:300-315 [Conf]
  22. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Robust Asynchronous Protocols Are Finite-State. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:188-199 [Conf]
  23. Jaikumar Radhakrishnan
    Gap Amplification in PCPs Using Lazy Random Walks. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:96-107 [Conf]
  24. Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
    On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1399-1411 [Conf]
  25. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:612-621 [Conf]
  26. Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan
    Connectivity properties of secure wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    SASN, 2004, pp:53-58 [Conf]
  27. Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
    Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:717-724 [Conf]
  28. Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
    Complete partitions of graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:860-869 [Conf]
  29. Lov K. Grover, Jaikumar Radhakrishnan
    Is partial quantum search of a database any easier? [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:186-194 [Conf]
  30. Alessandro Panconesi, Jaikumar Radhakrishnan
    Expansion properties of (secure) wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:281-285 [Conf]
  31. Chinmoy Dutta, Jaikumar Radhakrishnan
    Tradeoffs in Depth-Two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:372-383 [Conf]
  32. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    Are bitvectors optimal? [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:449-458 [Conf]
  33. Shiva Chaudhuri, Jaikumar Radhakrishnan
    Deterministic Restrictions in Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:30-36 [Conf]
  34. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Greed is good: approximating independent sets in sparse and bounded-degree graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:439-448 [Conf]
  35. Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:602-611 [Conf]
  36. Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:4-15 [Conf]
  37. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Improved Approximations of Independent Sets in Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:195-206 [Conf]
  38. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:145-163 [Journal]
  39. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:4, pp:462-479 [Journal]
  40. Jaikumar Radhakrishnan
    Sigma Pi Sigma Threshold Formulas. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:3, pp:345-374 [Journal]
  41. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    A direct sum theorem in communication complexity via message compression [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  42. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  43. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  44. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:017, pp:- [Journal]
  45. Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Complexity of Parallel Prefix Problems on Small Domains. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:138, n:1, pp:1-22 [Journal]
  46. Jaikumar Radhakrishnan
    Improved Bounds for Covering Complete Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:203-207 [Journal]
  47. Jaikumar Radhakrishnan, Venkatesh Raman
    A tradeoff between search and update in dictionaries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:243-247 [Journal]
  48. Jaikumar Radhakrishnan, K. V. Subrahmanyam
    Directed Monotone Contact Networks for Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:4, pp:199-203 [Journal]
  49. Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
    Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:467-479 [Journal]
  50. Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    The Communication Complexity of Pointer Chasing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:323-355 [Journal]
  51. Jaikumar Radhakrishnan
    Better Lower Bounds for Monotone Threshold Formulas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:221-226 [Journal]
  52. Nathan Linial, Jaikumar Radhakrishnan
    Essential covers of the cube by hyperplanes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:109, n:2, pp:331-338 [Journal]
  53. Jaikumar Radhakrishnan
    An Entropy Proof of Bregman's Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:1, pp:161-164 [Journal]
  54. Jaikumar Radhakrishnan
    Pi-Sigma-Pi Threshold Formulas. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:357-374 [Journal]
  55. Magnús M. Halldórsson, Jaikumar Radhakrishnan
    Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:475-492 [Journal]
  56. Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:337-351 [Journal]
  57. Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
    Lower bounds for adaptive locally decodable codes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:3, pp:358-378 [Journal]
  58. Jaikumar Radhakrishnan
    A note on scrambling permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:4, pp:435-439 [Journal]
  59. Jaikumar Radhakrishnan, Aravind Srinivasan
    Improved bounds and algorithms for hypergraph 2-coloring. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:1, pp:4-32 [Journal]
  60. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    Are Bitvectors Optimal? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1723-1744 [Journal]
  61. Jaikumar Radhakrishnan, Amnon Ta-Shma
    Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:2-24 [Journal]
  62. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:325-335 [Journal]
  63. Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
    The Communication Complexity of Correlation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:10-23 [Conf]

  64. Data Structures for Storing Small Sets in the Bitprobe Model. [Citation Graph (, )][DBLP]


  65. Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. [Citation Graph (, )][DBLP]


  66. Online set packing and competitive scheduling of multi-part tasks. [Citation Graph (, )][DBLP]


  67. Minimizing average latency in oblivious routing. [Citation Graph (, )][DBLP]


  68. A tight lower bound for parity in noisy communication networks. [Citation Graph (, )][DBLP]


  69. Finding duplicates in a data stream. [Citation Graph (, )][DBLP]


  70. Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. [Citation Graph (, )][DBLP]


  71. Complete partitions of graphs. [Citation Graph (, )][DBLP]


  72. Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity [Citation Graph (, )][DBLP]


  73. The communication complexity of correlation. [Citation Graph (, )][DBLP]


Search in 0.114secs, Finished in 0.116secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002