Παραπομπή σε μορφή APA (7η εκδ.)

Pettie, S., & Ramachandran, V. (2008). Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits. ACM Transactions on Algorithms, 4(1), 5:1. https://doi.org/10.1145/1328911.1328916

Παραπομπή σε μορφή Chicago (17η εκδ.)

Pettie, Seth, και Vijaya Ramachandran. "Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits." ACM Transactions on Algorithms 4, no. 1 (2008): 5:1. https://doi.org/10.1145/1328911.1328916.

Παραπομπή σε μορφή MLA (9th εκδ.)

Pettie, Seth, και Vijaya Ramachandran. "Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits." ACM Transactions on Algorithms, vol. 4, no. 1, 2008, p. 5:1, https://doi.org/10.1145/1328911.1328916.