• Chechik S and Mukhtar D. (2021). Single-source shortest paths in the CONGEST model with improved bounds. Distributed Computing. 10.1007/s00446-021-00412-8. 35:4. (357-374). Online publication date: 1-Aug-2022.

    https://link.springer.com/10.1007/s00446-021-00412-8

  • Elkin M and Neiman O. (2022). Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. Distributed Computing. 10.1007/s00446-022-00431-z. 35:5. (419-437). Online publication date: 1-Oct-2022.

    https://link.springer.com/10.1007/s00446-022-00431-z

  • Elkin M, Filtser A and Neiman O. Distributed Construction of Light Networks. Proceedings of the 39th Symposium on Principles of Distributed Computing. (483-492).

    https://doi.org/10.1145/3382734.3405701

  • Chechik S and Mukhtar D. Single-Source Shortest Paths in the CONGEST Model with Improved Bound. Proceedings of the 39th Symposium on Principles of Distributed Computing. (464-473).

    https://doi.org/10.1145/3382734.3405729

  • Elkin M and Neiman O. Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC. The 31st ACM Symposium on Parallelism in Algorithms and Architectures. (333-341).

    https://doi.org/10.1145/3323165.3323177

  • Friedrichs S and Lenzen C. (2018). Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. Journal of the ACM. 65:6. (1-55). Online publication date: 26-Nov-2018.

    https://doi.org/10.1145/3231591