| Planar distance oracles with better time-space tradeoffs Y Long, S Pettie Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 25 | 2021 |
| Near-optimal deterministic vertex-failure connectivity oracles Y Long, T Saranurak 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13 | 2022 |
| Tight conditional lower bounds for vertex connectivity problems Z Huang, Y Long, T Saranurak, B Wang Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1384-1395, 2023 | 5 | 2023 |
| Almost optimal exact distance oracles for planar graphs P Charalampopoulos, P Gawrychowski, Y Long, S Mozes, S Pettie, ... Journal of the ACM 70 (2), 1-50, 2023 | 5 | 2023 |
| Dynamic Deterministic Constant-Approximate Distance Oracles with Worst-Case Update Time B Haeupler, Y Long, T Saranurak arXiv preprint arXiv:2402.18541, 2024 | 1 | 2024 |
| Unbreakable Decomposition in Close-to-Linear Time A Anand, E Lee, J Li, Y Long, T Saranurak arXiv preprint arXiv:2408.09368, 2024 | | 2024 |
| Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity Y Long, Y Wang arXiv preprint arXiv:2402.09150, 2024 | | 2024 |
Thatchaphol SaranurakUniversity of Michigan在 umich.edu 的电子邮件经过验证
Thatchaphol SaranurakUniversity of Michigan在 umich.edu 的电子邮件经过验证
Seth PettieProfessor of Computer Science and Engineering, University of Michigan在 umich.edu 的电子邮件经过验证