◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Radhakrishnan

10 papers hereh-index 323.4k citations125 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author4
  • last author4

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • quant-ph6
  • cond-mat.stat-mech1
  • cs.CC1
  • cs.DC1
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20002008
most citedA direct sum theorem in communication complexity via message compression

23 citations · 81 across the 7 of their papers we have counts for

collaborators
Showing 2003 · cs.CCShow all

1 paper · 2 filters

cs.CC2003★ 23 cited

A direct sum theorem in communication complexity via message compression

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use the notion of information cost of a p…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.