Behnezhad, S. (2022, February). Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. Proceedings / annual Symposium on Foundations of Computer Science, 873-884. https://doi.org/10.1109/FOCS52979.2021.00089
Citace podle Chicago (17th ed.)Behnezhad, Soheil. "Time-Optimal Sublinear Algorithms for Matching and Vertex Cover." Proceedings / Annual Symposium on Foundations of Computer Science Feb. 2022: 873-884. https://doi.org/10.1109/FOCS52979.2021.00089.
Citace podle MLA (9th ed.)Behnezhad, Soheil. "Time-Optimal Sublinear Algorithms for Matching and Vertex Cover." Proceedings / Annual Symposium on Foundations of Computer Science, Feb. 2022, pp. 873-884, https://doi.org/10.1109/FOCS52979.2021.00089.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..