Dory, M., & Matar, S. (2025). Massively parallel algorithms for approximate shortest paths. Distributed computing, 38(2), 131-162. https://doi.org/10.1007/s00446-025-00482-y
Citace podle Chicago (17th ed.)Dory, Michal, a Shaked Matar. "Massively Parallel Algorithms for Approximate Shortest Paths." Distributed Computing 38, no. 2 (2025): 131-162. https://doi.org/10.1007/s00446-025-00482-y.
Citace podle MLA (9th ed.)Dory, Michal, a Shaked Matar. "Massively Parallel Algorithms for Approximate Shortest Paths." Distributed Computing, vol. 38, no. 2, 2025, pp. 131-162, https://doi.org/10.1007/s00446-025-00482-y.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..