Nairen Cao
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds | Managing Parallelism 2025 | 2025-10-20 |
The paper gives a parallel PRAM/MPC algorithm that breaks the 3× barrier, achieving 2.4+ε approximation in polylogarithmic rounds (poly(1/ε)·log^O(1) n) by… | ||
| nothing matches | ||