Skip to content

Author

Wen-Horng Sheu

We have 1 of 5 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Fixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications

This is the first $O(1)$-approximate algorithm for densest subgraph to break the $\Theta(\sqrt{\lg n})$ round-complexity barrier in the sub-linear MPC model and achieves the following round-approximation tradeoffs.

Slobodan Mitrović, Theodore Pan, Wen-Horng Sheu · 0 citations