Blelloch, G. E., & Brady, A. C. (2025). Parallel Batch-Dynamic Maximal Matching with Constant Work per Update. Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 429. https://doi.org/10.1145/3694906.3743313
Παραπομπή σε μορφή Chicago (17η εκδ.)Blelloch, Guy E., και Andrew C. Brady. "Parallel Batch-Dynamic Maximal Matching with Constant Work Per Update." Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures 2025: 429. https://doi.org/10.1145/3694906.3743313.
Παραπομπή σε μορφή MLA (9th εκδ.)Blelloch, Guy E., και Andrew C. Brady. "Parallel Batch-Dynamic Maximal Matching with Constant Work Per Update." Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025, p. 429, https://doi.org/10.1145/3694906.3743313.