Chaudhuri, Shiva Algorithms and Complexity, MPI for Informatics, Max Planck Society;
1-s2.0-S0890540197926547-main.pdf (Verlagsversion), 347KB
Chaudhuri, S., & Radhakrishnan, J. (1997). The Complexity of Parallel Prefix Problems on Small Domains. Information and Computation, 138(1), 1-22. doi:10.1006/inco.1997.2654.
