| 1 | -- | 34 | Mark Bun, Justin Thaler. Dual Polynomials for Collision and Element Distinctness |
| 1 | -- | 29 | Eden Chlamtác, Michael Dinitz. Lowest-Degree k-Spanner: Approximation and Hardness |
| 1 | -- | 61 | Amos Beimel, Kobbi Nissim, Uri Stemmer. Private Learning and Sanitization: Pure vs. Approximate Differential Privacy |
| 1 | -- | 50 | Anindya De, Elchanan Mossel, Joe Neeman. Majority is Stablest: Discrete and SoS |
| 1 | -- | 23 | Mika Göös, Thomas Watson 0001. Communication Complexity of Set-Disjointness for All Probabilities |
| 1 | -- | 14 | Neil Thapen. A Tradeoff Between Length and Width in Resolution |
| 1 | -- | 38 | Nutan Limaye, Guillaume Malod, Srikanth Srinivasan. Lower Bounds for Non-Commutative Skew Circuits |
| 1 | -- | 25 | Anand Louis, Yury Makarychev. Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion |
| 1 | -- | 14 | Nikhil Bansal, Bouke Cloostermans. Minimizing Maximum Flow-Time on Related Machines |
| 1 | -- | 33 | Mika Göös, Jukka Suomela. Locally Checkable Proofs in Distributed Computing |
| 1 | -- | 3 | Nicole Megow, Mary Wootters. Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword |
| 1 | -- | 42 | Matthew McKague. Interactive Proofs for BQP via Self-Tested Graph States |
| 1 | -- | 11 | Venkatesan Guruswami, Euiwoong Lee. Simple Proof of Hardness of Feedback Vertex Set |
| 1 | -- | 25 | Jugal Garg, Ruta Mehta, Vijay V. Vazirani. Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP |
| 1 | -- | 17 | Raghu Meka, Oanh Nguyen, Van Vu. Anti-concentration for Polynomials of Independent Random Variables |
| 1 | -- | 35 | Cedric Yen-Yu Lin, Han-Hsuan Lin. Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester |
| 1 | -- | 34 | Daniel Dadush, Gábor Kun. Lattice Sparsification and the Approximate Closest Vector Problem |
| 1 | -- | 27 | Swastik Kopparty, Mrinal Kumar 0001, Michael E. Saks. Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields |
| 1 | -- | 3 | Deeparnab Chakrabarty, David Galvin. Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword |
| 1 | -- | 35 | Amit Chakrabarti, Graham Cormode, Andrew McGregor 0001. Robust Lower Bounds for Communication and Stream Computation |