1 citations · 1 across the 1 of their papers we have counts for
1 paper
Th. Lippert, A. Seyfried, A. Bode +1
A new class of parallel algorithms is introduced that can achieve a complexity of O(n^3/2) with respect to the interprocessor communication, in the exact computation of systems wit…