Pachara Sawettamalya

According to our database, Pachara Sawettamalya authored at least 7 papers between 2024 and 2026.

Collaborative distances:

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

2026

A (Very) Nearly Optimal Sketch for k-Edge Connectivity Certificates.

Pachara Sawettamalya, Huacheng Yu

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Minimum <i>s</i> <i>t</i> Cuts with Fewer Cut Queries.

Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Minimum s-t Cuts with Fewer Cut Queries.

Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya

CoRR, October, 2025

A (Very) Nearly Optimal Sketch for <i>k</i>-Edge Connectivity Certificates.

Pachara Sawettamalya, Huacheng Yu

CoRR, October, 2025

Strong XOR Lemma for Information Complexity.

Pachara Sawettamalya, Huacheng Yu

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors.

Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald.

Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu

Proc. ACM Manag. Data, 2024