1. Mohamad Ahmadi , Fabian Kuhn , and Rotem Oshman . 2018 . Distributed Approximate Maximum Matching in the CONGEST Model . In Proc. of the 32nd International Symposium on Distributed Computing, DISC 2018 (LIPIcs , Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6: 17 . Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed Approximate Maximum Matching in the CONGEST Model. In Proc. of the 32nd International Symposium on Distributed Computing, DISC 2018 (LIPIcs, Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6:17.
2. Ioannis Anagnostides , Christoph Lenzen , Bernhard Haeupler , Goran Zuzic , and Themis Gouleakis . 2022 . Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts . In Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs , Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6: 20 . arXiv:2109.05151 Announced at PODC 2022. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, and Themis Gouleakis. 2022. Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. In Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs, Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6:20. arXiv:2109.05151 Announced at PODC 2022.
3. Alexandr Andoni , Clifford Stein , and Peilin Zhong . 2020 . Parallel approximate undirected shortest paths via low hop emulators . In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 322--335 . arXiv:1911.01956 Alexandr Andoni, Clifford Stein, and Peilin Zhong. 2020. Parallel approximate undirected shortest paths via low hop emulators. In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 322--335. arXiv:1911.01956
4. Kyriakos Axiotis , Aleksander Mądry , and Adrian Vladu . 2020 . Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs . In Proc. of the 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 93--104 . arXiv:2003.04863 Kyriakos Axiotis, Aleksander Mądry, and Adrian Vladu. 2020. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. In Proc. of the 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 93--104. arXiv:2003.04863
5. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models;Becker Ruben;SIAM J. Comput.,2021