Gilbert Maystre

27 papers A* 4A 5Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A conf
Direct Sums for Parity Decision Trees.
CCC
Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2025 A conf
Generalised Linial-Nisan Conjecture Is False for DNFs.
CCC
Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Generalised Linial-Nisan Conjecture is False for DNFs.
Electron. Colloquium Comput. Complex.
Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025 A* conf
Supercritical Tradeoffs for Monotone Circuits.
STOC
Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2025 A* conf
The Complexity of Two-Team Polymatrix Games with Independent Adversaries.
ICLR
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
2024 J jnl
Direct Sums for Parity Decision Trees.
CoRR
Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2024 J jnl
Direct Sums for Parity Decision Trees.
Electron. Colloquium Comput. Complex.
Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2024 J jnl
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).
SIAM J. Comput.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024 A conf
One-Way Functions vs. TFNP: Simpler and Improved.
ITCS
Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
2024 J jnl
Separations in Proof Complexity and TFNP.
J. ACM
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024 J jnl
Supercritical Tradeoffs for Monotone Circuits.
CoRR
Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2024 J jnl
Supercritical Tradeoffs for Monotone Circuits.
Electron. Colloquium Comput. Complex.
Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2024 J jnl
The Complexity of Two-Team Polymatrix Games with Independent Adversaries.
CoRR
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
2023 J jnl
One-Way Functions vs. TFNP: Simpler and Improved.
IACR Cryptol. ePrint Arch.
Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
2022 A conf
Further Collapses in TFNP.
CCC
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Further Collapses in TFNP.
CoRR
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Further Collapses in TFNP.
Electron. Colloquium Comput. Complex.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 A* conf
Randomised Composition and Small-Bias Minimax.
FOCS
Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022 J jnl
Randomised Composition and Small-Bias Minimax.
CoRR
Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022 J jnl
Randomised Composition and Small-Bias Minimax.
Electron. Colloquium Comput. Complex.
Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022 A* conf
Separations in Proof Complexity and TFNP.
FOCS
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Separations in Proof Complexity and TFNP.
CoRR
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Separations in Proof Complexity and TFNP.
Electron. Colloquium Comput. Complex.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2021 A conf
A Majority Lemma for Randomised Query Complexity.
CCC
Mika Göös, Gilbert Maystre
2021 J jnl
A Majority Lemma for Randomised Query Complexity.
Electron. Colloquium Comput. Complex.
Mika Göös, Gilbert Maystre
2021 — conf
Communication Efficient Coresets for Maximum Matching.
SOSA
Michael Kapralov, Gilbert Maystre, Jakab Tardos
2020 J jnl
Communication Efficient Coresets for Maximum Matching.
CoRR
Michael Kapralov, Gilbert Maystre, Jakab Tardos