"Internally deterministic parallel algorithms can be fast."

Guy E. Blelloch et al. (2012)
a service of Schloss Dagstuhl - Leibniz Center for Informatics