◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Radhakrishnan

22 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 author6
  • last author11

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

fields
  • quant-ph8
  • cs.CC4
  • cs.DS4
  • cs.DC2
  • cs.DM2
  • cond-mat.stat-mech1

identity via Semantic Scholar / OpenAlex

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

23 citations · 97 across the 13 of their papers we have counts for

collaborators
Showing 2010Show all

1 paper · 1 filter

cs.DM2010

An entropy based proof of the Moore bound for irregular graphs

S. Ajesh Babu, Jaikumar Radhakrishnan

We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girt…

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