Gilbert Maystre

According to our database, Gilbert Maystre authored at least 11 papers between 2021 and 2025.

Collaborative distances:

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

2025

Supercritical Tradeoffs for Monotone Circuits.

Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov

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

The Complexity of Two-Team Polymatrix Games with Independent Adversaries.

Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Direct Sums for Parity Decision Trees.

Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 40th Computational Complexity Conference, 2025

Generalised Linial-Nisan Conjecture Is False for DNFs.

Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).

Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao

SIAM J. Comput., 2024

One-Way Functions vs. TFNP: Simpler and Improved.

Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2022

Separations in Proof Complexity and TFNP.

Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Randomised Composition and Small-Bias Minimax.

Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Further Collapses in TFNP.

Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Communication Efficient Coresets for Maximum Matching.

Michael Kapralov, Gilbert Maystre, Jakab Tardos

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

A Majority Lemma for Randomised Query Complexity.

Mika Göös, Gilbert Maystre

Proceedings of the 36th Computational Complexity Conference, 2021