Bernstein, A., Gutenberg, M. P., & Saranurak, T. (2020, November). Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. Proceedings / annual Symposium on Foundations of Computer Science, 1123-1134. https://doi.org/10.1109/FOCS46700.2020.00108
Chicago Style (17th ed.) CitationBernstein, Aaron, Maximilian Probst Gutenberg, and Thatchaphol Saranurak. "Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing." Proceedings / Annual Symposium on Foundations of Computer Science Nov. 2020: 1123-1134. https://doi.org/10.1109/FOCS46700.2020.00108.
MLA (9th ed.) CitationBernstein, Aaron, et al. "Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing." Proceedings / Annual Symposium on Foundations of Computer Science, Nov. 2020, pp. 1123-1134, https://doi.org/10.1109/FOCS46700.2020.00108.