While doing some research on topological sorting I came across a paper Parallel Topological Sorting Algorithm, TADA, A. and MIGITA, M. and NAKAMURA, R. which claims a recursive divide-and-conquer algorithm that
requires $O(n+m)$ processors and $O(\log^2m)$ time on a CREW-PRAM model
Unfortunately the paper is not only behind pay wall but is also in Japanese except for the abstract. I was able to obtain a copy, however only from the abstract and some contained (English) pseudocode I did not fully understand the details of the algorithm/analysis.
I found few references in English papers (such as this), but none does more then mention in.
Does anybody know of an English (or perhaps German?) description of the details of this algorithm?