Sorrachai Yingchareonthawornchai

According to our database, Sorrachai Yingchareonthawornchai authored at least 25 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns.

Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Hardness Amplification for Dynamic Binary Search Trees.

Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

An FPTAS for Connectivity Interdiction.

Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

The Group Access Bounds for Binary Search Trees.

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization.

Sorrachai Yingchareonthawornchai

PhD thesis, 2023

Deterministic k-Vertex Connectivity in k² Max-flows.

Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

CoRR, 2023

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity.

Max Franck, Sorrachai Yingchareonthawornchai

ACM J. Exp. Algorithmics, 2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.

Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Deterministic Small Vertex Connectivity in Almost Linear Time.

Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

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

Vertex connectivity in poly-logarithmic max-flows.

Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

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

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

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

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.

Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

CoRR, 2019

Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries.

Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

CoRR, 2019

Breaking quadratic time for small vertex connectivity and an approximation scheme.

Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Analysis of Bounds on Hybrid Vector Clocks.

Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Sandeep S. Kulkarni, Murat Demirbas

IEEE Trans. Parallel Distributed Syst., 2018

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

2017

Monitoring Partially Synchronous Distributed Systems Using SMT Solvers.

Vidhya Tekken Valapil, Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas

Proceedings of the Runtime Verification - 17th International Conference, 2017

Efficient Algorithms for Predicate Detection using Hybrid Logical Clocks.

Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016

Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems.

Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas

Proceedings of the Runtime Verification - 16th International Conference, 2016

A sorted partitioning approach to high-speed and fast-update OpenFlow classification.

Sorrachai Yingchareonthawornchai, James Daly, Alex X. Liu, Eric Torng

Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

2015

Analysis of Bounds on Hybrid Vector Clocks.

Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Murat Demirbas

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2013

Efficient Proper Length Time Series Motif Discovery.

Sorrachai Yingchareonthawornchai, Haemwaan Sivaraks, Thanawin Rakthanmanon, Chotirat Ann Ratanamahatana

Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013