| 29 | -- | 0 | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms |
| 30 | -- | 0 | Shaddin Dughmi, Tim Roughgarden, Qiqi Yan. Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding |
| 31 | -- | 0 | Dan Alistarh, Keren Censor Hillel, Nir Shavit. Are Lock-Free Concurrent Algorithms Practically Wait-Free? |
| 32 | -- | 0 | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth. Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity |
| 33 | -- | 0 | Carl A. Miller, Yaoyun Shi. Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices |
| 34 | -- | 0 | Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer. Approximate Constraint Satisfaction Requires Large LP Relaxations |
| 35 | -- | 0 | Venkatesan Guruswami, Adam D. Smith. Optimal Rate Code Constructions for Computationally Simple Channels |
| 36 | -- | 0 | Yakov Babichenko. Query Complexity of Approximate Nash Equilibria |
| 37 | -- | 0 | Johan Thapper, Stanislav Zivny. The Complexity of Finite-Valued CSPs |
| 38 | -- | 0 | . Invited Paper Foreword |
| 39 | -- | 0 | Zeev Dvir, Sivakanth Gopi. 2-Server PIR with Subpolynomial Communication |