"Internally deterministic parallel algorithms can be fast."

Guy E. Blelloch et al. (2012)

Details and statistics

DOI: 10.1145/2145816.2145840

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics