Bodwin, G., & Hoppenworth, G. (2023, November 6). Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. Proceedings / annual Symposium on Foundations of Computer Science, 701-720. https://doi.org/10.1109/FOCS57990.2023.00046
Chicago Style (17th ed.) CitationBodwin, Greg, and Gary Hoppenworth. "Folklore Sampling Is Optimal for Exact Hopsets: Confirming the √n Barrier." Proceedings / Annual Symposium on Foundations of Computer Science 6 Nov. 2023: 701-720. https://doi.org/10.1109/FOCS57990.2023.00046.
MLA (9th ed.) CitationBodwin, Greg, and Gary Hoppenworth. "Folklore Sampling Is Optimal for Exact Hopsets: Confirming the √n Barrier." Proceedings / Annual Symposium on Foundations of Computer Science, 6 Nov. 2023, pp. 701-720, https://doi.org/10.1109/FOCS57990.2023.00046.