◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Raghavendra

21 papers hereh-index 374.3k citations89 works total

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

author position
  • first author6
  • middle author8
  • last author7

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

fields
  • cs.DS9
  • cs.CC8
  • cs.IT1
  • math.MG1
  • math.OC1
  • math.ST1
same name
  • P. Raghavendra — 5 papers, h 3
  • P. Raghavendra — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082021
most citedOn the Bit Complexity of Sum-of-Squares Proofs

17 citations · 60 across the 12 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DS2012★ 5 cited

On Mimicking Networks Representing Minimum Terminal Cuts

Arindam Khan, Prasad Raghavendra, Prasad Tetali +1

Given a capacitated undirected graph G=(V,E) with a set of terminals K⊂V, a mimicking network is a smaller graph H=(VH​,EH​) that exactly preserves all the minimum cu…

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