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. The proposed parallel fully ...

Recent advances have integrated methods from probability theory, optimisation and distributed computing, thereby expanding the range of practically viable algorithms aimed at computing near ...

In this video, Peter Sanders from Karlsruhe Institute of Technology presents: Parallel Algorithms Reconsidered. Parallel algorithms have been a subject of intensive algorithmic research in the 1980s.

This paper investigates diagonally implicit Runge-Kutta methods in which the implicit relations can be solved in parallel and are singly diagonal-implicit on each processor. The algorithms are based ...

Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier-Stokes problem. These ...