Efficiency guarantees for parallel incremental algorithms under relaxed schedulers

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Dan Alistarh, Nikita Koval, Giorgi Nadiradze

Journal title: 31st ACM Symposium on Parallelism in Algorithms and Architectures

Journal publisher: ACM

Published year: 2019

Published pages: 145-154

DOI identifier: 10.1145/3323165.3323201

ISBN: 9781450361842