Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThatchaphol Saranurak
Person information
- affiliation: University of Michigan, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c57]Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak
:
Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. ICALP 2024: 87:1-87:19- [c56]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. SODA 2024: 1465-1502 - [c55]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. SODA 2024: 1503-1541 - [c54]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-commodity Flow Emulators. STOC 2024: 71-82 - [c53]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. STOC 2024: 319-330 - [i69]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. CoRR abs/2401.10856 (2024) - [i68]Deeksha Adil, Thatchaphol Saranurak:
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. CoRR abs/2402.17929 (2024) - [i67]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. CoRR abs/2402.18541 (2024) - [i66]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. CoRR abs/2403.08983 (2024) - [i65]Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak:
Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. CoRR abs/2405.03801 (2024) - [i64]Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. CoRR abs/2406.03648 (2024) - [i63]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-Commodity Flow Emulators. CoRR abs/2406.14384 (2024) - 2023
- [c52]Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. ESA 2023: 92:1-92:9 - [c51]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. FOCS 2023: 1563-1588 - [c50]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. FOCS 2023: 1694-1714 - [c49]Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS 2023: 2204-2212 - [c48]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. SODA 2023: 1-47 - [c47]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [c46]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - [c45]Chaitanya Nalam, Thatchaphol Saranurak:
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. SODA 2023: 183-211 - [c44]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - [c43]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. STOC 2023: 254-266 - [c42]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC 2023: 1371-1383 - [c41]Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang:
Tight Conditional Lower Bounds for Vertex Connectivity Problems. STOC 2023: 1384-1395 - [i62]Chaitanya Nalam, Thatchaphol Saranurak:
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. CoRR abs/2302.02290 (2023) - [i61]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time. CoRR abs/2302.05030 (2023) - [i60]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i59]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. CoRR abs/2304.01889 (2023) - [i58]Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. CoRR abs/2307.00147 (2023) - [i57]Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic k-Vertex Connectivity in k2 Max-flows. CoRR abs/2308.04695 (2023) - [i56]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. CoRR abs/2311.10706 (2023) - [i55]Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak:
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13(10): 76-89 (2023) - 2022
- [c40]Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA 2022: 17:1-17:19 - [c39]Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. ESA 2022: 70:1-70:13 - [c38]Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. FOCS 2022: 789-800 - [c37]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS 2022: 884-895 - [c36]Yaowei Long, Thatchaphol Saranurak:
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. FOCS 2022: 1002-1010 - [c35]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - [c34]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP 2022: 37:1-37:20 - [c33]Seth Pettie, Thatchaphol Saranurak, Longhui Yin:
Optimal vertex connectivity oracles. STOC 2022: 151-161 - [c32]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684 - [i54]Seth Pettie, Thatchaphol Saranurak, Longhui Yin:
Optimal Vertex Connectivity Oracles. CoRR abs/2201.00408 (2022) - [i53]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR abs/2203.00751 (2022) - [i52]Yaowei Long, Thatchaphol Saranurak:
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. CoRR abs/2205.03930 (2022) - [i51]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR abs/2205.14978 (2022) - [i50]Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. CoRR abs/2207.04115 (2022) - [i49]Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary. CoRR abs/2207.04954 (2022) - [i48]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR abs/2207.07438 (2022) - [i47]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. CoRR abs/2207.07519 (2022) - [i46]Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. CoRR abs/2210.13739 (2022) - [i45]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. CoRR abs/2212.00189 (2022) - [i44]Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang:
Tight Conditional Lower Bounds for Vertex Connectivity Problems. CoRR abs/2212.00359 (2022) - 2021
- [j2]Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, Hengjie Zhang:
Near-optimal Distributed Triangle Enumeration via Expander Decompositions. J. ACM 68(3): 21:1-21:36 (2021) - [c31]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS 2021: 1000-1008 - [c30]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS 2021: 1124-1134 - [c29]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c28]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA 2021: 2212-2228 - [c27]Julia Chuzhoy, Thatchaphol Saranurak:
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. SODA 2021: 2478-2496 - [c26]Thatchaphol Saranurak:
A Simple Deterministic Algorithm for Edge Connectivity. SOSA 2021: 80-85 - [c25]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329 - [c24]Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. STOC 2021: 859-869 - [i43]Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Minimum Cost Flows, MDPs, and 𝓁1-Regression in Nearly Linear Time for Dense Instances. CoRR abs/2101.05719 (2021) - [i42]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. CoRR abs/2101.07149 (2021) - [i41]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021) - [i40]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - [i39]Jason Li, Thatchaphol Saranurak:
Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR abs/2106.01567 (2021) - [i38]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. CoRR abs/2106.02233 (2021) - [i37]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Fast Algorithms for Hop-Constrained Flows and Moving Cuts. CoRR abs/2111.01422 (2021) - [i36]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR abs/2111.03980 (2021) - [i35]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Gomory-Hu Tree in Subcubic Time. CoRR abs/2111.04958 (2021) - [i34]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - 2020
- [j1]László Kozma, Thatchaphol Saranurak:
Smooth Heaps and a Dual View of Self-Adjusting Data Structures. SIAM J. Comput. 49(5) (2020) - [c23]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM 2020: 33:1-33:21 - [c22]Yi-Jun Chang, Thatchaphol Saranurak:
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS 2020: 377-388 - [c21]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS 2020: 919-930 - [c20]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. FOCS 2020: 1123-1134 - [c19]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS 2020: 1135-1146 - [c18]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS 2020: 1158-1167 - [c17]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. SODA 2020: 476-494 - [c16]Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. SODA 2020: 2046-2065 - [i33]Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak:
Coarse-Grained Complexity for Dynamic Algorithms. CoRR abs/2001.00336 (2020) - [i32]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020) - [i31]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR abs/2005.02368 (2020) - [i30]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR abs/2005.02369 (2020) - [i29]Yi-Jun Chang, Thatchaphol Saranurak:
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. CoRR abs/2007.14898 (2020) - [i28]Thatchaphol Saranurak:
A Simple Deterministic Algorithm for Edge Connectivity. CoRR abs/2008.08575 (2020) - [i27]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR abs/2009.01802 (2020) - [i26]Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. CoRR abs/2009.02584 (2020) - [i25]Julia Chuzhoy, Thatchaphol Saranurak:
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. CoRR abs/2009.08479 (2020)
2010 – 2019
- 2019
- [c15]Jan van den Brand, Thatchaphol Saranurak:
Sensitive Distance and Reachability Oracles for Large Batch Updates. FOCS 2019: 424-435 - [c14]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. FOCS 2019: 456-480 - [c13]Yi-Jun Chang, Thatchaphol Saranurak:
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. PODC 2019: 66-73 - [c12]Thatchaphol Saranurak, Di Wang:
Expander Decomposition and Pruning: Faster, Stronger, and Simpler. SODA 2019: 2616-2635 - [c11]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking quadratic time for small vertex connectivity and an approximation scheme. STOC 2019: 241-252 - [c10]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed edge connectivity in sublinear time. STOC 2019: 343-354 - [i24]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Edge Connectivity in Sublinear Time. CoRR abs/1904.04341 (2019) - [i23]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. CoRR abs/1904.04453 (2019) - [i22]Yi-Jun Chang, Thatchaphol Saranurak:
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. CoRR abs/1904.08037 (2019) - [i21]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. CoRR abs/1905.05067 (2019) - [i20]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. CoRR abs/1905.05329 (2019) - [i19]Jan van den Brand, Thatchaphol Saranurak:
Sensitive Distance and Reachability Oracles for Large Batch Updates. CoRR abs/1907.07982 (2019) - [i18]Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR abs/1910.07950 (2019) - [i17]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs/1910.08025 (2019) - [i16]Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR abs/1910.14344 (2019) - [i15]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR abs/1912.02900 (2019) - 2018
- [b1]Thatchaphol Saranurak:
Dynamic algorithms: new worst-case and instance-optimal bounds via new connections. Royal Institute of Technology, Stockholm, Sweden, 2018 - [c9]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. ISAAC 2018: 55:1-55:26 - [c8]László Kozma, Thatchaphol Saranurak:
Smooth heaps and a dual view of self-adjusting data structures. STOC 2018: 801-814 - [i14]László Kozma, Thatchaphol Saranurak:
Smooth heaps and a dual view of self-adjusting data structures. CoRR abs/1802.05471 (2018) - [i13]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-finger binary search trees. CoRR abs/1809.01759 (2018) - [i12]Thatchaphol Saranurak, Di Wang:
Expander Decomposition and Pruning: Faster, Stronger, and Simpler. CoRR abs/1812.08958 (2018) - 2017
- [c7]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. FOCS 2017: 168-179 - [c6]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. FOCS 2017: 950-961 - [c5]Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time. STOC 2017: 1122-1129 - [i11]Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds. CoRR abs/1708.03903 (2017) - [i10]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. CoRR abs/1708.03962 (2017) - 2016
- [i9]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016) - [i8]László Kozma, Thatchaphol Saranurak:
Binary search trees and rectangulations. CoRR abs/1603.08151 (2016) - [i7]Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time. CoRR abs/1611.03745 (2016) - 2015
- [c4]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312 - [c3]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - [c2]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30 - [c1]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. WADS 2015: 152-165 - [i6]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015) - [i5]