APA (7th ed.) Citation

Censor-Hillel, K., Dory, M., Korhonen, J. H., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed computing, 34(6), 463-487. https://doi.org/10.1007/s00446-020-00380-5

Chicago Style (17th ed.) Citation

Censor-Hillel, Keren, Michal Dory, Janne H. Korhonen, and Dean Leitersdorf. "Fast Approximate Shortest Paths in the Congested Clique." Distributed Computing 34, no. 6 (2021): 463-487. https://doi.org/10.1007/s00446-020-00380-5.

MLA (9th ed.) Citation

Censor-Hillel, Keren, et al. "Fast Approximate Shortest Paths in the Congested Clique." Distributed Computing, vol. 34, no. 6, 2021, pp. 463-487, https://doi.org/10.1007/s00446-020-00380-5.