Siqi Liu

sliu18 AT berkeley DOT edu

I am a third-year graduate student in the theory group at UC Berkeley, where I am fortunate to be advised by Alessandro Chiesa. I received my BA in Computer Science from UC Berkeley in 2018.

I am interested in theoretical computer science in general. Most recently, I have been thinking about probabilistic proofs, spectral graph theory, and message passing algorithms.

Papers

Computational phase transitions in sparse planted problems? [arXiv]

Siqi Liu, Sidhanth Mohanty, and Prasad Raghavendra.

Zero-Knowledge Succinct Arguments with a Linear-Time Prover [eprint]

Alessandro Chiesa, Jonathan Bootle, and Siqi Liu.

High-Dimensional Expanders from Expanders [arXiv]

Siqi Liu, Sidhanth Mohanty, and Elizabeth Yang.
ITCS 2020 (11th Innovations in Theoretical Computer Science conference)

On the Impossibility of Probabilistic Proofs in Relativized Worlds [eprint]

Alessandro Chiesa and Siqi Liu.
ITCS 2020 (11th Innovations in Theoretical Computer Science conference)

Risk Robust Mechanism Design for a Prospect Theoretic Buyer [pdf]

Siqi Liu, J. Benjamin Miller, and Christos Alexandros Psomas.
SAGT 2019 (12th International Symposium on Algorithmic Game Theory)

On the Competition Complexity of Dynamic Mechanism Design [arXiv]

Siqi Liu and Christos Alexandros Psomas.
SODA 2018 (29th ACM-SIAM Symposium on Discrete Algorithms)

Teaching Experience

Spring 2017: CS170 Efficient Algorithms and Intractable Problems.

Teaching Assistant

Summer 2016: CS70 Discrete Math and Probability Theory.

Head Teaching Assistant