On the Computation of 2-Dimensional Recurrence Equations

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $lo{g}_2(2n-1)$.