Log-rank and lifting for AND-functions. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2020)

Guest Column: Models of computation between decision trees and communication. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (SIGACT News, 2021)

Lower Bounds for Unambiguous Automata via Communication Complexity. - Mika Göös; Stefan Kiefer; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2022)

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. - Xinrui Jia 001; Ola Svensson; Weiqiang Yuan 002 (SODA, 2023)

One-Way Functions vs. TFNP: Simpler and Improved. - Lukás Folwarczný; Mika Göös; Pavel Hubácek; Gilbert Maystre; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2023)

Direct Sums for Parity Decision Trees. - Tyler Besselman; Mika Göös; Siyao Guo; Gilbert Maystre; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2024)

Breaking Verifiable Delay Functions in the Random Oracle Model. - Ziyi Guan; Artur Riazanov; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2024)

Generalised Linial-Nisan Conjecture is False for DNFs. - Yaroslav Alekseev; Mika Göös; Ziyi Guan; Gilbert Maystre; Artur Riazanov; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Searching for Falsified Clause in Random log{n}-CNFs is Hard for Randomized Communication. - Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case. - Venkatesan Guruswami; Xin Lyu; Weiqiang Yuan 002 (CoRR, 2025)