Antoniadis, A., Englert, M., Matsakis, N., Veselý, P., Veselý, A. A. a. M. E. a. N. M. a. P., Bansal, N., . . . Worrell, J. (2024). Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Transactions on Algorithms, 20, 1-29. https://doi.org/10.1145/3676887
Παραπομπή σε μορφή Chicago (17η εκδ.)Antoniadis, Antonios, Matthias Englert, Nicolaos Matsakis, Pavel Veselý, Antonios Antoniadis and Matthias Englert and Nicolaos Matsakis and Pavel Veselý, Nikhil Bansal, Emanuela Merelli, και James Worrell. "Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop." ACM Transactions on Algorithms 20 (2024): 1-29. https://doi.org/10.1145/3676887.
Παραπομπή σε μορφή MLA (9th εκδ.)Antoniadis, Antonios, et al. "Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop." ACM Transactions on Algorithms, vol. 20, 2024, pp. 1-29, https://doi.org/10.1145/3676887.