Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Rahul Jain 0001

◀ ▶ joint publications with Jaikumar Radhakrishnan

> Home > Persons > Rahul Jain 0001

Publications

2016
[c24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/Harsha0R16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Harsha0R16
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Partition Bound Is Quadratically Tight for Product Distributions. ICALP 2016: 135:1-135:13
2015
[i34]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HarshaJR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HarshaJR15
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. CoRR abs/1512.01968 (2015)
[i32]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/HarshaJR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HarshaJR15
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. TR15 (2015)
2010
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/HarshaJMR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/HarshaJMR10
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. IEEE Trans. Inf. Theory 56(1): 438-449 (2010)
2009
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/JainRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/JainRS09
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6): 33:1-33:32 (2009)
2008
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0807-1267
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0807-1267
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan:
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity. CoRR abs/0807.1267 (2008)
2007
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/HarshaJMR07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/HarshaJMR07
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The Communication Complexity of Correlation. CCC 2007: 10-23
2006
[i2]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/HarshaJMR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/HarshaJMR06
Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. Electron. Colloquium Comput. Complex. TR06 (2006)
2005
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/DeshpandeJKLR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DeshpandeJKLR05
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005)
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/JainRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/JainRS05
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
Prior Entanglement, Message Compression and Privacy in Quantum Communication. CCC 2005: 285-296
2003
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/JainRS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/JainRS03
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/JainRS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/JainRS03
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-CC-0304020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-0304020
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A direct sum theorem in communication complexity via message compression. CoRR cs.CC/0304020 (2003)
2002
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/DeshpandeJKRL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/DeshpandeJKRL02
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes. CCC 2002: 184-193
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/JainRS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/JainRS02
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: 429-438
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/JainRS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/JainRS02
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.