BibSonomy :: author  ::

bookmarks

publications

(109)

• Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
  Rahul Jain and Pranab Sen and Jaikumar Radhakrishnan CoRR abs/0807.1267 (2008)
  to dblp by dblp on 2008-08-04 00:00:00
  | URL | BibTeX  
• From filing and fitting to flexible manufacturing
  {Roger E.} Bohn and {Ramchandran} Jaikumar (2005)
  to Fertigungstechnik Produktion by fbw on 2008-05-29 13:01:59
  | URL | BibTeX  
• A tight lower bound for parity in noisy communication networks.
  Chinmoy Dutta and Yashodhan Kanoria and D. Manjunath and Jaikumar Radhakrishnan SODA 1056-1065 (2008)
  to dblp by dblp on 2008-04-22 00:00:00
  | URL | BibTeX  
• Minimizing average latency in oblivious routing.
  Prahladh Harsha and Thomas P. Hayes and Hariharan Narayanan and Harald Räcke and Jaikumar Radhakrishnan SODA 200-207 (2008)
  to dblp by dblp on 2008-04-22 00:00:00
  | URL | BibTeX  
• Redoubtable Sensor Networks.
  Roberto Di Pietro and Luigi V. Mancini and Alessandro Mei and Alessandro Panconesi and Jaikumar Radhakrishnan ACM Trans. Inf. Syst. Secur. 11 (2008)
  to dblp by dblp on 2008-04-01 00:00:00
  | URL | BibTeX  
• The Quantum Complexity of Set Membership
  Jaikumar Radhakrishnan and Pranab Sen and Srinivasan Venkatesh CoRR quant-ph/0007021 (2000)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
  Jaikumar Radhakrishnan and Pranab Sen and Sundar Vishwanathan CoRR cs.DM/0110031 (2001)
  to dblp by dblp on 2008-01-02 00:00:00
  | URL | BibTeX  
• A direct sum theorem in communication complexity via message compression
  Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen CoRR cs.CC/0304020 (2003)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• Tagging Makes Secrecy Decidable with Unbounded Nonces as Well.
  Ramaswamy Ramanujam and S. P. Suresh FSTTCS 363-374 (2003)
  to dblp by dblp on 2007-08-24 00:00:00
  | URL | BibTeX  
• Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States.
  Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen FOCS 429-438 (2002)
  to dblp by dblp on 2007-07-26 00:00:00
  | URL | BibTeX