Your Name

Weiqiang Yuan

Hi, I am a fifth-year Ph. D. student at the Theory Group of EPFL, fortunate to be coadvised by Mika Göös and Ola Svensson. Prior to that, I obtained my Bachelor degree from IIIS, Tsinghua University.
I have broad interests in theoretical computer science, especially complexity theory.

Publications

Quantum Advantage in Tolerant Junta Testing Avishay Tal, Weiqiang Yuan
In submission
Pseudodeterministic Communication Complexity Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
To appear in the 58th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2026)
eccc arxiv
Total Search Problems in ZPP Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
The 17th Innovations in Theoretical Computer Science (ITCS 2026)
eccc arxiv ITCS
Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan
The 37th ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)
arxiv SODA
Searching for Falsified Clause in Random (log(n))-CNFs is Hard for Randomized Communication Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
The 29th International Conference on Randomization and Computation (RANDOM 2025)
eccc arxiv RANDOM
Generalised Linial-Nisan Conjecture is False for DNFs Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
The 40th Computational Complexity Conference (CCC 2025)
eccc CCC
Direct Sum for Parity Decision Trees Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
The 40th Computational Complexity Conference (CCC 2025)
eccc arxiv CCC
Breaking Verifiable Delay Functions in the Random Oracle Model Ziyi Guan, Artur Riazanov, Weiqiang Yuan
The 45th Annual International Cryptology Conference (Crypto 2025)
ePrint Crypto
One-Way Functions vs. TFNP: Simpler and Improved Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
The 15th Innovations in Theoretical Computer Science (ITCS 2024)
ePrint ITCS
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity Xinrui Jia, Ola Svensson, Weiqiang Yuan
The 34th ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
arxiv SODA
Lower Bounds for Unambiguous Automata via Communication Complexity Mika Göös, Stefan Kiefer, Weiqiang Yuan
The 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022)
eccc arxiv ICALP
Log-rank and lifting for AND-functions Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
The 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021)
eccc arxiv STOC

Services

Reviewer: STOC (2025,2026), FOCS (2025), CCC(2023, 2026), ICALP (2023), IPCO (2024), ESA (2022), FSTTCS (2023)

Contact

Email: firstname.lastname@epfl.ch