Sorrachai Yingchareonthawornchai

Orcid: 0000-0002-7169-0163

Affiliations:
  • UC Berkeley, CA, USA
  • Aalto University, Finland (PhD 2023)


According to our database1, Sorrachai Yingchareonthawornchai authored at least 24 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An FPTAS for Connectivity Interdiction.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

The Group Access Bounds for Binary Search Trees.
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.
PhD thesis, 2023

Deterministic k-Vertex Connectivity in k<sup>2</sup> Max-flows.
CoRR, 2023

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity.
ACM J. Exp. Algorithmics, 2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Deterministic Small Vertex Connectivity in Almost Linear Time.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs.
Distributed Comput., 2021

Vertex connectivity in poly-logarithmic max-flows.
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.
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.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

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

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

Breaking quadratic time for small vertex connectivity and an approximation scheme.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Analysis of Bounds on Hybrid Vector Clocks.
IEEE Trans. Parallel Distributed Syst., 2018

A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification.
IEEE/ACM Trans. Netw., 2018

2017
Monitoring Partially Synchronous Distributed Systems Using SMT Solvers.
Proceedings of the Runtime Verification - 17th International Conference, 2017

Efficient Algorithms for Predicate Detection using Hybrid Logical Clocks.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016
Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems.
Proceedings of the Runtime Verification - 16th International Conference, 2016

A sorted partitioning approach to high-speed and fast-update OpenFlow classification.
Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

2015
Analysis of Bounds on Hybrid Vector Clocks.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2013
Efficient Proper Length Time Series Motif Discovery.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013


  Loading...