- Zhihuai Chen, Siyao Guo, Qian Li 0012, Chengyu Lin 0001, Xiaoming Sun 0001. New Distinguishers for Negation-Limited Weak Pseudorandom Functions. Theory of Computing, 20:1-19, 2024.
- Jean Bourgain, Jeff Kahn 0001, Gil Kalai. Influential Coalitions for Boolean Functions I: Constructions. Theory of Computing, 20:1-13, 2024.
- Nikhil Bansal 0001. On a Generalization of Iterated and Randomized Rounding. Theory of Computing, 20:1-23, 2024.
- Ivan Hu, Dieter van Melkebeek, Andrew Morgan. Polynomial Identity Testing via Evaluation of Rational Functions. Theory of Computing, 20:1-70, 2024.
- Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, Thomas Vidick. Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. Theory of Computing, 20:1-87, 2024.
- Ivan Hu, Dieter van Melkebeek, Andrew Morgan. Lower Bound Techniques in the Comparison-Query Model and Applications to Inversion Minimization. Theory of Computing, 20:1-62, 2024.
- Prahladh Harsha, Ramprasad Saptharishi. On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim. Theory of Computing, 20:1-22, 2024.
- Mrinal Kumar 0001, Ramprasad Saptharishi, Anamay Tengse. Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. Theory of Computing, 19:1-30, 2023.
- Elbert Du, Michael Mitzenmacher, David P. Woodruff, Guang Yang 0020. t-Player One-Way Communication, with Applications to Data Streams. Theory of Computing, 19:1-44, 2023.
- Irit Dinur, Inbal Livni Navon. Exponentially Small Soundness for the Direct Product Z-test. Theory of Computing, 19:1-56, 2023.