Efficient Proper Length Time Series Motif Discovery. - Sorrachai Yingchareonthawornchai; Haemwaan Sivaraks; Thanawin Rakthanmanon; Chotirat Ann Ratanamahatana (ICDM, 2013)

Analysis of Bounds on Hybrid Vector Clocks. - Sorrachai Yingchareonthawornchai; Sandeep S. Kulkarni; Murat Demirbas (OPODIS, 2015)

A sorted partitioning approach to high-speed and fast-update OpenFlow classification. - Sorrachai Yingchareonthawornchai; James Daly; Alex X. Liu; Eric Torng (ICNP, 2016)

Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems. - Sorrachai Yingchareonthawornchai; Duong N. Nguyen; Vidhya Tekken Valapil; Sandeep S. Kulkarni; Murat Demirbas (RV, 2016)

Efficient Algorithms for Predicate Detection using Hybrid Logical Clocks. - Sorrachai Yingchareonthawornchai; Vidhya Tekken Valapil; Sandeep S. Kulkarni; Eric Torng; Murat Demirbas (ICDCN, 2017)

Monitoring Partially Synchronous Distributed Systems Using SMT Solvers. - Vidhya Tekken Valapil; Sorrachai Yingchareonthawornchai; Sandeep S. Kulkarni; Eric Torng; Murat Demirbas (RV, 2017)

A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification. - Sorrachai Yingchareonthawornchai; James Daly; Alex X. Liu; Eric Torng (IEEE/ACM Trans. Netw., 2018)

Analysis of Bounds on Hybrid Vector Clocks. - Sorrachai Yingchareonthawornchai; Duong N. Nguyen; Sandeep S. Kulkarni; Murat Demirbas (IEEE Trans. Parallel Distributed Syst., 2018)

Breaking quadratic time for small vertex connectivity and an approximation scheme. - Danupon Nanongkai; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (STOC, 2019)

Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. - Danupon Nanongkai; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. - Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting. - Sorrachai Yingchareonthawornchai; Proteek Chandan Roy; Bundit Laekhanukit; Eric Torng; Kalyanmoy Deb (GECCO Companion, 2020)

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. - Sebastian Forster; Danupon Nanongkai; Liu Yang; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (SODA, 2020)

Precision, recall, and sensitivity of monitoring partially synchronous distributed programs. - Duong N. Nguyen; Sorrachai Yingchareonthawornchai; Vidhya Tekken Valapil; Sandeep S. Kulkarni; Murat Demirbas (Distributed Comput., 2021)

Deterministic Small Vertex Connectivity in Almost Linear Time. - Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (FOCS, 2022)

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. - Parinya Chalermsook; Chien-Chung Huang 001; Danupon Nanongkai; Thatchaphol Saranurak; Pattara Sukprasert; Sorrachai Yingchareonthawornchai (ICALP, 2022)

Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. - Max Franck; Sorrachai Yingchareonthawornchai (ACM J. Exp. Algorithmics, 2022)

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Nidia Obscura Acosta; Akash Pareek; Sorrachai Yingchareonthawornchai (SODA, 2023)

Deterministic k-Vertex Connectivity in k2 Max-flows. - Chaitanya Nalam; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2023)

Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization. - Sorrachai Yingchareonthawornchai (2023)

The Group Access Bounds for Binary Search Trees. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Akash Pareek; Sorrachai Yingchareonthawornchai (ICALP, 2024)

An FPTAS for Connectivity Interdiction. - Chien-Chung Huang 001; Nidia Obscura Acosta; Sorrachai Yingchareonthawornchai (IPCO, 2024)

Hardness Amplification for Dynamic Binary Search Trees. - Shunhua Jiang; Victor Lecomte; Omri Weinstein; Sorrachai Yingchareonthawornchai (ISAAC, 2024)

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. - Parinya Chalermsook; Seth Pettie; Sorrachai Yingchareonthawornchai (SODA, 2024)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations. - Joakim Blikstad; Yonggang Jiang; Sagnik Mukhopadhyay; Sorrachai Yingchareonthawornchai (STOC, 2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness. - Yonggang Jiang; Chaitanya Nalam; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (STOC, 2025)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. - Zhuan Khye Koh; Omri Weinstein; Sorrachai Yingchareonthawornchai (STOC, 2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations. - Joakim Blikstad; Yonggang Jiang; Sagnik Mukhopadhyay; Sorrachai Yingchareonthawornchai (CoRR, 2025)

Vertex Connectivity in Poly-logarithmic Max-Flows. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (J. ACM, 2025)