Gilbert Maystre

Orcid: 0009-0002-4408-3330

According to our database1, Gilbert Maystre authored at least 8 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).
SIAM J. Comput., 2024

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

2023
One-Way Functions vs. TFNP: Simpler and Improved.
IACR Cryptol. ePrint Arch., 2023

2022
Separations in Proof Complexity and TFNP.
Electron. Colloquium Comput. Complex., 2022

Further Collapses in TFNP.
Electron. Colloquium Comput. Complex., 2022

Randomised Composition and Small-Bias Minimax.
Electron. Colloquium Comput. Complex., 2022

2021
A Majority Lemma for Randomised Query Complexity.
Electron. Colloquium Comput. Complex., 2021

Communication Efficient Coresets for Maximum Matching.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021


  Loading...