Skip to content

Author

Pachara Sawettamalya

We have 2 of 11 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Gap-Majority Lemmas in Communication Complexity

This work proves an information-theoretically optimal gap-majority lemma in the two-player randomized communication model and makes GapMAJ, to the knowledge, only the third explicit outer gadget that admits a strong composition theorem in the two-player communication setting, following the identity and XOR gadgets.

Pachara Sawettamalya, Huacheng Yu · 0 citations
Conference Jul 2026

On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths

A new $\widetilde{O}(n^{3/2})$-bit protocol for computing a maximum matching in general graphs and a new $\widetilde{O}(n)$-bit protocol for negative-cycle detection and negative-weight single-source shortest paths are introduced.

Yu Cheng, Tianle Jiang, Pachara Sawettamalya et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.