Sorrachai Yingchareonthawornchai

51 papers A* 13B 7Misc 1Journal 27Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Simpler Analysis for ϵ-Clairvoyant Flow Time Scheduling.
CoRR
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2026 J jnl
CSLib: The Lean Computer Science Library.
CoRR
Clark W. Barrett, Swarat Chaudhuri, Fabrizio Montesi, Jim Grundy, Pushmeet Kohli, Leonardo de Moura, Alexandre Rademaker, Sorrachai Yingchareonthawornchai
2026 — conf
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs.
SOSA
Olivier Fischer, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 A* conf
A Little Clairvoyance Is All You Need.
FOCS
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025 J jnl
A Little Clairvoyance Is All You Need.
CoRR
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025 A* conf
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth.
STOC
Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai
2025 A* conf
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness.
STOC
Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2025 J jnl
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness.
CoRR
Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2025 J jnl
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs.
CoRR
Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 J jnl
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations.
CoRR
Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 A* conf
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations.
STOC
Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 J jnl
Vertex Connectivity in Poly-logarithmic Max-Flows.
J. ACM
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2024 B conf
An FPTAS for Connectivity Interdiction.
IPCO
Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai
2024 J jnl
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth.
CoRR
Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai
2024 B conf
Hardness Amplification for Dynamic Binary Search Trees.
ISAAC
Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai
2024 J jnl
Hardness Amplification for Dynamic Binary Search Trees.
CoRR
Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai
2024 A* conf
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns.
SODA
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
2024 A* conf
The Group Access Bounds for Binary Search Trees.
ICALP
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
2023 J jnl
Deterministic k-Vertex Connectivity in k
CoRR
Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2023 A* conf
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
SODA
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
2023 J jnl
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns.
CoRR
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
2023 J jnl
The Group Access Bounds for Binary Search Trees.
CoRR
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
2023 — —
Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization.
Sorrachai Yingchareonthawornchai
2022 A* conf
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
ICALP
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
2022 J jnl
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
CoRR
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
2022 A* conf
Deterministic Small Vertex Connectivity in Almost Linear Time.
FOCS
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2022 J jnl
Deterministic Small Vertex Connectivity in Almost Linear Time.
CoRR
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2022 J jnl
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity.
ACM J. Exp. Algorithmics
Max Franck, Sorrachai Yingchareonthawornchai
2022 J jnl
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
CoRR
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
2021 B conf
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity.
SEA
Max Franck, Sorrachai Yingchareonthawornchai
2021 J jnl
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity.
CoRR
Max Franck, Sorrachai Yingchareonthawornchai
2021 J jnl
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs.
Distributed Comput.
Duong N. Nguyen, Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas
2021 J jnl
Vertex Connectivity in Poly-logarithmic Max-flows.
CoRR
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2021 A* conf
Vertex connectivity in poly-logarithmic max-flows.
STOC
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020 A* conf
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.
SODA
Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020 — conf
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting.
GECCO Companion
Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb
2019 J jnl
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 A* conf
Breaking quadratic time for small vertex connectivity and an approximation scheme.
STOC
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 J jnl
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms.
CoRR
Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai
2019 J jnl
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries.
CoRR
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019 J jnl
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.
CoRR
Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2018 J jnl
A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification.
IEEE/ACM Trans. Netw.
Sorrachai Yingchareonthawornchai, James Daly, Alex X. Liu, Eric Torng
2018 J jnl
Analysis of Bounds on Hybrid Vector Clocks.
IEEE Trans. Parallel Distributed Syst.
Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Sandeep S. Kulkarni, Murat Demirbas
2017 Misc conf
Efficient Algorithms for Predicate Detection using Hybrid Logical Clocks.
ICDCN
Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas
2017 B conf
Monitoring Partially Synchronous Distributed Systems Using SMT Solvers.
RV
Vidhya Tekken Valapil, Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas
2017 J jnl
Monitoring Partially Synchronous Distributed Systems using SMT Solvers.
CoRR
Vidhya Tekken Valapil, Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas
2016 B conf
A sorted partitioning approach to high-speed and fast-update OpenFlow classification.
ICNP
Sorrachai Yingchareonthawornchai, James Daly, Alex X. Liu, Eric Torng
2016 B conf
Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems.
RV
Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas
2016 J jnl
Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems.
CoRR
Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas
2015 B conf
Analysis of Bounds on Hybrid Vector Clocks.
OPODIS
Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Murat Demirbas
2013 A* conf
Efficient Proper Length Time Series Motif Discovery.
ICDM
Sorrachai Yingchareonthawornchai, Haemwaan Sivaraks, Thanawin Rakthanmanon, Chotirat Ann Ratanamahatana