PESERICO, E., & SCQUIZZATO, M. (2023). Matching on the Line Admits no o(√logn)-Competitive Algorithm. ACM Transactions on Algorithms, 19(3), 1. https://doi.org/10.1145/3594873
Chicago Style (17th ed.) CitationPESERICO, ENOCH, and MICHELE SCQUIZZATO. "Matching on the Line Admits No O(√logn)-Competitive Algorithm." ACM Transactions on Algorithms 19, no. 3 (2023): 1. https://doi.org/10.1145/3594873.
MLA (9th ed.) CitationPESERICO, ENOCH, and MICHELE SCQUIZZATO. "Matching on the Line Admits No O(√logn)-Competitive Algorithm." ACM Transactions on Algorithms, vol. 19, no. 3, 2023, p. 1, https://doi.org/10.1145/3594873.
Warning: These citations may not always be 100% accurate.