◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

G. Blelloch

61 papers hereh-index 6015.6k citations331 works total

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

author position
  • first author21
  • middle author29
  • last author11

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

fields
  • cs.DS32
  • cs.DC21
  • cs.IR3
  • cs.PL2
  • cs.CG1
  • cs.DB1

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedTheoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

97 citations · 433 across the 54 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DS2012★ 15 cited

Greedy Sequential Maximal Independent Set and Matching are Parallel on Average

Guy Blelloch, Jeremy Fineman, Julian Shun

The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in arbitrary order adding a vertex to the resulting set if and only if no previous neighbo…

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