Larsen, K. G., & Yu, H. (2023, November 6). Super-Logarithmic Lower Bounds for Dynamic Graph Problems. Proceedings / annual Symposium on Foundations of Computer Science, 1589-1604. https://doi.org/10.1109/FOCS57990.2023.00096
Citace podle Chicago (17th ed.)Larsen, Kasper Green, a Huacheng Yu. "Super-Logarithmic Lower Bounds for Dynamic Graph Problems." Proceedings / Annual Symposium on Foundations of Computer Science 6 Nov. 2023: 1589-1604. https://doi.org/10.1109/FOCS57990.2023.00096.
Citace podle MLA (9th ed.)Larsen, Kasper Green, a Huacheng Yu. "Super-Logarithmic Lower Bounds for Dynamic Graph Problems." Proceedings / Annual Symposium on Foundations of Computer Science, 6 Nov. 2023, pp. 1589-1604, https://doi.org/10.1109/FOCS57990.2023.00096.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..