Patel, S., Dave, B., Kumbhani, S., Desai, M., Kumar, S., & Chaudhury, B. (2021). Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures. 2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2), Extreme Scale Programming Models and Middleware (ESPM2), 2021 IEEE/ACM 6th International Workshop on, ESPM2, 1. https://doi.org/10.1109/ESPM254806.2021.00006
Παραπομπή σε μορφή Chicago (17η εκδ.)Patel, Sarthak, Bhrugu Dave, Smit Kumbhani, Mihir Desai, Sidharth Kumar, και Bhaskar Chaudhury. "Scalable Parallel Algorithm for Fast Computation of Transitive Closure of Graphs on Shared Memory Architectures." 2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2), Extreme Scale Programming Models and Middleware (ESPM2), 2021 IEEE/ACM 6th International Workshop on, ESPM2 2021: 1. https://doi.org/10.1109/ESPM254806.2021.00006.
Παραπομπή σε μορφή MLA (9th εκδ.)Patel, Sarthak, et al. "Scalable Parallel Algorithm for Fast Computation of Transitive Closure of Graphs on Shared Memory Architectures." 2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2), Extreme Scale Programming Models and Middleware (ESPM2), 2021 IEEE/ACM 6th International Workshop on, ESPM2, 2021, p. 1, https://doi.org/10.1109/ESPM254806.2021.00006.