Michael Elkin, Shaked Matar. Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work. In Kunal Agrawal, Yossi Azar, editors, SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021. pages 198-207, ACM, 2021. [doi]
Abstract is missing.