Communication Efficient Coresets for Maximum Matching. - Michael Kapralov; Gilbert Maystre; Jakab Tardos (SOSA, 2021)

A Majority Lemma for Randomised Query Complexity. - Mika Göös; Gilbert Maystre (Electron. Colloquium Comput. Complex., 2021)

Randomised Composition and Small-Bias Minimax. - Shalev Ben-David; Eric Blais; Mika Göös; Gilbert Maystre (Electron. Colloquium Comput. Complex., 2022)

Further Collapses in TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

Separations in Proof Complexity and TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

One-Way Functions vs. TFNP: Simpler and Improved. - Lukás Folwarczný; Mika Göös; Pavel Hubácek; Gilbert Maystre; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2023)

Direct Sums for Parity Decision Trees. - Tyler Besselman; Mika Göös; Siyao Guo; Gilbert Maystre; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2024)

Supercritical Tradeoffs for Monotone Circuits. - Mika Göös; Gilbert Maystre; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2024)

Further Collapses in ( boldsymbol{ mathsf{TFNP}} ). - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (SIAM J. Comput., 2024)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries. - Alexandros Hollender; Gilbert Maystre; Sai Ganesh Nagarajan (ICLR, 2025)

Generalised Linial-Nisan Conjecture is False for DNFs. - Yaroslav Alekseev; Mika Göös; Ziyi Guan; Gilbert Maystre; Artur Riazanov; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)