Das, B., & Pelc, A. (2026). Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks. Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures, 503. https://doi.org/10.1145/3816782.3819209
Παραπομπή σε μορφή Chicago (17η εκδ.)Das, Bibhuti, και Andrzej Pelc. "Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks." Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures 2026: 503. https://doi.org/10.1145/3816782.3819209.
Παραπομπή σε μορφή MLA (9th εκδ.)Das, Bibhuti, και Andrzej Pelc. "Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks." Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures, 2026, p. 503, https://doi.org/10.1145/3816782.3819209.