1. Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang and Peilin Zhong. 2018. Parallel Graph Connectivity in Log Diameter Rounds. In FOCS. 674--685. https://doi.org/10.1109/FOCS.2018.00070 10.1109/FOCS.2018.00070
2. Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang and Peilin Zhong. 2018. Parallel Graph Connectivity in Log Diameter Rounds. In FOCS. 674--685. https://doi.org/10.1109/FOCS.2018.00070
3. Alkida Balliu , Sebastian Brandt , Manuela Fischer , Rustam Latypov , Yannic Maus , Dennis Olivetti , and Jara Uitto . 2022 . Exponential Speedup over Locality in MPC with Optimal Memory . In DISC 2022 . https://doi.org/10.4230/LIPIcs.DISC.2022.9 10.4230/LIPIcs.DISC.2022.9 Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto. 2022. Exponential Speedup over Locality in MPC with Optimal Memory. In DISC 2022. https://doi.org/10.4230/LIPIcs.DISC.2022.9
4. Alkida Balliu , Rustam Latypov , Yannic Maus , Dennis Olivetti , and Jara Uitto . 2023 . Optimal Deterministic Massively Parallel Connectivity on Forests. In SODA 2023. to appear. Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto. 2023. Optimal Deterministic Massively Parallel Connectivity on Forests. In SODA 2023. to appear.
5. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover