Tree Path Minimum Query Oracle via Boruvka Trees. - Tianqi Yang 001 (CoRR, 2021)

The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. - Zhiyuan Fan; Jiatu Li; Tianqi Yang 001 (Electron. Colloquium Comput. Complex., 2021)

3.1n - o(n) Circuit Lower Bounds for Explicit Functions. - Jiatu Li; Tianqi Yang 001 (Electron. Colloquium Comput. Complex., 2021)

The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. - Zhiyuan Fan; Jiatu Li; Tianqi Yang 001 (STOC, 2022)

3.1n - o(n) circuit lower bounds for explicit functions. - Jiatu Li; Tianqi Yang 001 (STOC, 2022)

Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. - Lijie Chen 001; Jiatu Li; Tianqi Yang 001 (Electron. Colloquium Comput. Complex., 2022)

Black-Box Constructive Proofs Are Unavoidable. - Lijie Chen 001; Ryan Williams 001; Tianqi Yang 001 (ITCS, 2023)