◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Pemmaraju

23 papers hereh-index 303.4k citations161 works total

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

author position
  • first author4
  • middle author7
  • last author11

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

fields
  • cs.DC18
  • cs.DS3
  • cs.LG1
  • cs.SI1
same name
  • S. Pemmaraju — 2 papers, h 2

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
20082026
most citedSuper-fast MST Algorithms in the Congested Clique using o(m) Messages

4 citations · 7 across the 12 of their papers we have counts for

collaborators
Showing 2025 · cs.DCShow all

1 paper · 2 filters

cs.DC2025

Message Optimality and Message-Time Trade-offs for APSP and Beyond

Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan +2

Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the \emph{message complexity} of distributed computing problems and its r…

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