1. 2006. 9th DIMACS Implementation Challenge: Shortest Paths . 2006. 9th DIMACS Implementation Challenge: Shortest Paths.
2. 2015. OpenStreetMap. https://www.openstreetmap.org 2015. OpenStreetMap. https://www.openstreetmap.org
3. Chronos: Efficient Speculative Parallelism for Accelerators
4. Vitalii Aksenov , Dan Alistarh , and Janne H . Korhonen . 2020 . Scalable Belief Propagation via Relaxed Scheduling. In Proc. of the International Conference on Neural Information Processing Systems (NeurIPS). MIT Press , 22361--22372. Vitalii Aksenov, Dan Alistarh, and Janne H. Korhonen. 2020. Scalable Belief Propagation via Relaxed Scheduling. In Proc. of the International Conference on Neural Information Processing Systems (NeurIPS). MIT Press, 22361--22372.
5. Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms