On the competition complexity of dynamic mechanism design S Liu, CA Psomas Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 34* | 2018 |
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier J Bootle, A Chiesa, S Liu Annual International Conference on the Theory and Applications of …, 2022 | 20* | 2022 |
High-dimensional expanders from expanders S Liu, S Mohanty, E Yang arXiv preprint arXiv:1907.10771, 2019 | 12 | 2019 |
On the impossibility of probabilistic proofs in relativized worlds A Chiesa, S Liu 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 10 | 2020 |
Hypercontractivity on high dimensional expanders T Gur, N Lifshitz, S Liu Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
Testing thresholds for high-dimensional sparse random geometric graphs S Liu, S Mohanty, T Schramm, E Yang Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
Risk-Robust Mechanism Design for a Prospect-Theoretic Buyer S Liu, JB Miller, A Psomas Theory of Computing Systems 66 (3), 616-644, 2022 | 3 | 2022 |
On statistical inference when fixed points of belief propagation are unstable S Liu, S Mohanty, P Raghavendra 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | | 2022 |
Linear-Time Probabilistic Proofs Over Every Field J Bootle, A Chiesa, Z Guan, S Liu Cryptology ePrint Archive, 2022 | | 2022 |
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for ε-Product Spaces. T Gur, N Lifshitz, S Liu arXiv preprint arXiv:2111.09375, 2021 | | 2021 |