Thatchaphol Saranurak
Title
Cited by
Cited by
Year
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
M Henzinger, S Krinninger, D Nanongkai, T Saranurak
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1882015
Dynamic minimum spanning forest with subpolynomial worst-case update time
D Nanongkai, T Saranurak, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
752017
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time
D Nanongkai, T Saranurak
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
662017
Expander decomposition and pruning: Faster, stronger, and simpler
T Saranurak, D Wang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
382019
Distributed Exact Weighted All-Pairs Shortest Paths in Ő (n^{5/4}) Rounds
CC Huang, D Nanongkai, T Saranurak
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
322017
Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds
J van den Brand, D Nanongkai, T Saranurak
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
282019
A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
262020
Distributed edge connectivity in sublinear time
M Daga, M Henzinger, D Nanongkai, T Saranurak
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
222019
Pattern-avoiding access in binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015
222015
Improved distributed expander decomposition and nearly optimal triangle enumeration
YJ Chang, T Saranurak
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
212019
Bipartite matching in nearly-linear time on moderately dense graphs
J van den Brand, YT Lee, D Nanongkai, R Peng, T Saranurak, A Sidford, ...
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
172020
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
172020
Sensitive distance and reachability oracles for large batch updates
J van den Brand, T Saranurak
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
172019
Breaking quadratic time for small vertex connectivity and an approximation scheme
D Nanongkai, T Saranurak, S Yingchareonthawornchai
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
172019
Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms
S Forster, D Nanongkai, L Yang, T Saranurak, S Yingchareonthawornchai
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
142020
The expander hierarchy and its applications to dynamic graph algorithms
G Goranci, H Räcke, T Saranurak, Z Tan
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
112021
Self-adjusting binary search trees: What makes them tick?
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms-ESA 2015, 300-312, 2015
112015
The landscape of bounds for binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1603.04892, 2016
102016
Deterministic decremental reachability, SCC, and shortest paths via directed expanders and congestion balancing
A Bernstein, MP Gutenberg, T Saranurak
arXiv preprint arXiv:2009.02584, 2020
92020
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
L Chen, G Goranci, M Henzinger, R Peng, T Saranurak
arXiv preprint arXiv:2005.02368, 2020
92020
The system can't perform the operation now. Try again later.
Articles 1–20