In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most distributed and parallel graph algorithms in the MPC model are designed for static ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

Parallel algorithms for singular value decomposition (SVD) have risen to prominence as an indispensable tool in high-performance numerical linear algebra. They offer significant improvements in ...