Weiqiang Yuan

27 papers A* 4A 5Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case.
SODA
Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan
2026 A conf
Total Search Problems in ZPP.
ITCS
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2025 — conf
Breaking Verifiable Delay Functions in the Random Oracle Model.
CRYPTO (7)
Ziyi Guan, Artur Riazanov, Weiqiang Yuan
2025 J jnl
Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case.
CoRR
Venkatesan Guruswami, Xin Lyu, Weiqiang Yuan
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 J jnl
Pseudodeterministic Communication Complexity.
CoRR
Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Pseudodeterministic Communication Complexity.
Electron. Colloquium Comput. Complex.
Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication.
CoRR
Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025 A conf
Searching for Falsified Clause in Random (log{n})-CNFs Is Hard for Randomized Communication.
APPROX/RANDOM
Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Searching for Falsified Clause in Random log{n}-CNFs is Hard for Randomized Communication.
Electron. Colloquium Comput. Complex.
Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025 J jnl
Total Search Problems in ZPP.
CoRR
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2025 J jnl
Total Search Problems in ZPP.
Electron. Colloquium Comput. Complex.
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2024 J jnl
Breaking Verifiable Delay Functions in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
Ziyi Guan, Artur Riazanov, Weiqiang Yuan
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 A conf
One-Way Functions vs. TFNP: Simpler and Improved.
ITCS
Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
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
2023 A* conf
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity.
SODA
Xinrui Jia, Ola Svensson, Weiqiang Yuan
2022 A* conf
Lower Bounds for Unambiguous Automata via Communication Complexity.
ICALP
Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022 J jnl
Lower Bounds for Unambiguous Automata via Communication Complexity.
Electron. Colloquium Comput. Complex.
Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022 J jnl
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity.
CoRR
Xinrui Jia, Ola Svensson, Weiqiang Yuan
2021 J jnl
Guest Column: Models of computation between decision trees and communication.
SIGACT News
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2021 A* conf
Log-rank and lifting for AND-functions.
STOC
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2020 J jnl
Log-rank and lifting for AND-functions.
CoRR
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2020 J jnl
Log-rank and lifting for AND-functions.
Electron. Colloquium Comput. Complex.
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan