◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Radhakrishnan

26 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 author4
  • middle author7
  • last author14

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

fields
  • quant-ph8
  • cs.DS7
  • cs.CC4
  • cs.DC2
  • cs.DM2
  • cond-mat.soft1

identity via Semantic Scholar / OpenAlex

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

23 citations · 109 across the 14 of their papers we have counts for

collaborators
Showing 2016 · cs.CCShow all

1 paper · 2 filters

cs.CC2016

The zero-error randomized query complexity of the pointer function

Jaikumar Radhakrishnan, Swagato Sanyal

The pointer function of G{ö}{ö}s, Pitassi and Watson \cite{DBLP:journals/eccc/GoosP015a} and its variants have recently been used to prove separation results among various measures…

◍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.