Siqi Liu

Affiliations:
  • University of California, Berkeley, CA, USA


According to our database1, Siqi Liu authored at least 15 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Geometry of Local-spectral Expanders
PhD thesis, 2023

Local and Global Expansion in Random Geometric Graphs.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Risk-Robust Mechanism Design for a Prospect-Theoretic Buyer.
Theory Comput. Syst., 2022

Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field.
IACR Cryptol. ePrint Arch., 2022

Testing thresholds for high-dimensional sparse random geometric graphs.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Hypercontractivity on high dimensional expanders.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for $\epsilon$-Product Spaces.
Electron. Colloquium Comput. Complex., 2021

Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for ε-Product Spaces.
CoRR, 2021

Computational phase transitions in sparse planted problems?
CoRR, 2021

On statistical inference when fixed points of belief propagation are unstable.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Zero-Knowledge Succinct Arguments with a Linear-Time Prover.
IACR Cryptol. ePrint Arch., 2020

High-Dimensional Expanders from Expanders.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
On the Impossibility of Probabilistic Proofs in Relativized Worlds.
IACR Cryptol. ePrint Arch., 2019

2018
On the Competition Complexity of Dynamic Mechanism Design.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018


  Loading...