Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSorrachai Yingchareonthawornchai
Person information
- affiliation: UC Berkeley, CA, USA
- affiliation (PhD 2023): Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. ICALP 2024: 38:1-38:18- [c16]Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai:
An FPTAS for Connectivity Interdiction. IPCO 2024: 210-223 - [c15]Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai:
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. SODA 2024: 133-149 - 2023
- [b1]Sorrachai Yingchareonthawornchai:
Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization. Aalto University, Espoo, Finland, 2023 - [c14]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. SODA 2023: 509-534 - [i14]Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai:
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. CoRR abs/2307.02294 (2023) - [i13]Chaitanya Nalam, Thatchaphol Saranurak
, Sorrachai Yingchareonthawornchai:
Deterministic k-Vertex Connectivity in k2 Max-flows. CoRR abs/2308.04695 (2023) - [i12]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. CoRR abs/2312.15426 (2023) - 2022
- [j4]Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. ACM J. Exp. Algorithmics 27: 4.4:1-4.4:29 (2022) - [c13]Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. FOCS 2022: 789-800 - [c12]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 - [i11]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) - [i10]Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Small Vertex Connectivity in Almost Linear Time. CoRR abs/2210.13739 (2022) - [i9]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR abs/2211.04112 (2022) - 2021
- [j3]Duong N. Nguyen, Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas:
Precision, recall, and sensitivity of monitoring partially synchronous distributed programs. Distributed Comput. 34(5): 319-348 (2021) - [c11]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329 - [c10]Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. SEA 2021: 1:1-1:18 - [i8]Max Franck, Sorrachai Yingchareonthawornchai:
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. CoRR abs/2103.15703 (2021) - [i7]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021) - 2020
- [c9]Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb:
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting. GECCO Companion 2020: 185-186 - [c8]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
2010 – 2019
- 2019
- [c7]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking quadratic time for small vertex connectivity and an approximation scheme. STOC 2019: 241-252 - [i6]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. CoRR abs/1904.04453 (2019) - [i5]Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries. CoRR abs/1905.05329 (2019) - [i4]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) - [i3]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) - 2018
- [j2]Sorrachai Yingchareonthawornchai, James Daly, Alex X. Liu, Eric Torng:
A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification. IEEE/ACM Trans. Netw. 26(4): 1907-1920 (2018) - [j1]Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Sandeep S. Kulkarni, Murat Demirbas:
Analysis of Bounds on Hybrid Vector Clocks. IEEE Trans. Parallel Distributed Syst. 29(9): 1947-1960 (2018) - 2017
- [c6]Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas:
Efficient Algorithms for Predicate Detection using Hybrid Logical Clocks. ICDCN 2017: 10 - [c5]Vidhya Tekken Valapil, Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas:
Monitoring Partially Synchronous Distributed Systems Using SMT Solvers. RV 2017: 277-293 - [i2]Vidhya Tekken Valapil, Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Eric Torng, Murat Demirbas:
Monitoring Partially Synchronous Distributed Systems using SMT Solvers. CoRR abs/1707.07699 (2017) - 2016
- [c4]Sorrachai Yingchareonthawornchai, James Daly, Alex X. Liu, Eric Torng:
A sorted partitioning approach to high-speed and fast-update OpenFlow classification. ICNP 2016: 1-10 - [c3]Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas:
Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems. RV 2016: 420-435 - [i1]Sorrachai Yingchareonthawornchai, Duong N. Nguyen, Vidhya Tekken Valapil, Sandeep S. Kulkarni, Murat Demirbas:
Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems. CoRR abs/1607.03369 (2016) - 2015
- [c2]Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Murat Demirbas:
Analysis of Bounds on Hybrid Vector Clocks. OPODIS 2015: 34:1-34:17 - 2013
- [c1]Sorrachai Yingchareonthawornchai, Haemwaan Sivaraks, Thanawin Rakthanmanon, Chotirat Ann Ratanamahatana:
Efficient Proper Length Time Series Motif Discovery. ICDM 2013: 1265-1270
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 20:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
