Yaonan Jin

collaborators

2 papers

cs.DS2026

Round-efficient Fully-scalable MPC algorithms for k-Means

Shaofeng H. -C. Jiang, Yaonan Jin, Jianing Lou +1

We study Euclidean $k$ -Means under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully-scalable} setting. Our main result is a fully-scalable $O((\log n/\lo…

cs.DS2023

Subset Sum in Time $2^{n /2} / p o l y (n)$

Xi Chen, Yaonan Jin, Tim Randolph +1

A major goal in the area of exact exponential algorithms is to give an algorithm for the (worst-case) $n$ -input Subset Sum problem that runs in time $2^{(1/2 - c) n}$ for some const…

Round-efficient Fully-scalable MPC algorithms for k-Means

Subset Sum in Time 2n/2/poly(n)

Subset Sum in Time $2^{n /2} / p o l y (n)$