The resulting algorithm computes the entire prefix values of any continued fraction in O (log n ) time on the EREW PRAM model or a network with O ( n /log n ) processors connected by the cube-connectedcycles, binary tree, perfect shuffle, or hypercube. It can be applied to approximate ...