Gilbert Maystre

According to our database, Gilbert Maystre authored at least 10 papers between 2021 and 2024.

Collaborative distances:

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

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

Supercritical Tradeoffs for Monotone Circuits.

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

Electron. Colloquium Comput. Complex., 2024

Direct Sums for Parity Decision Trees.

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

Electron. Colloquium Comput. Complex., 2024

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

Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan

CoRR, 2024

2023

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

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

IACR Cryptol. ePrint Arch., 2023

2022

Separations in Proof Complexity and TFNP.

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

Electron. Colloquium Comput. Complex., 2022

Further Collapses in TFNP.

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

Electron. Colloquium Comput. Complex., 2022

Randomised Composition and Small-Bias Minimax.

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

Electron. Colloquium Comput. Complex., 2022

2021

A Majority Lemma for Randomised Query Complexity.

Mika Göös, Gilbert Maystre

Electron. Colloquium Comput. Complex., 2021

Communication Efficient Coresets for Maximum Matching.

Michael Kapralov, Gilbert Maystre, Jakab Tardos

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