| 2018 | 33rd Computational Complexity Conference, CCC 2018, San Diego, CA, USA, June 22-24, 2018 Rocco A. Servedio |
| 2018 | A New Approach for Constructing Low-Error, Two-Source Extractors. Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma |
| 2018 | A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. Daniel Kane, Sankeerth Rao |
| 2018 | A Tight Lower Bound for Entropy Flattening. Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang |
| 2018 | Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. Zeyu Guo, Nitin Saxena, Amit Sinhababu |
| 2018 | Communication Complexity with Small Advantage. Thomas Watson |
| 2018 | Complexity Classification of Conjugated Clifford Circuits. Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh |
| 2018 | Dimension Reduction for Polynomials over Gaussian Space and Applications. Badih Ghazi, Pritish Kamath, Prasad Raghavendra |
| 2018 | Earthmover Resilience and Testing in Ordered Structures. Omri Ben-Eliezer, Eldar Fischer |
| 2018 | Efficient Batch Verification for UP. Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2018 | Hardness Amplification for Non-Commutative Arithmetic Circuits. Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin |
| 2018 | Hardness of Function Composition for Semantic Read once Branching Programs. Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi |
| 2018 | Hardness vs Randomness for Bounded Depth Arithmetic Circuits. Chi-Ning Chou, Mrinal Kumar, Noam Solomon |
| 2018 | Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials. Richard Ryan Williams |
| 2018 | Linear Sketching over F_2. Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev |
| 2018 | Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. Venkatesan Guruswami, Nicolas Resch, Chaoping Xing |
| 2018 | Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao |
| 2018 | NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. Shuichi Hirahara, Igor C. Oliveira, Rahul Santhanam |
| 2018 | New Hardness Results for the Permanent Using Linear Optics. Daniel Grier, Luke Schaeffer |
| 2018 | On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Lijie Chen |
| 2018 | On the Complexity of the Cayley Semigroup Membership Problem. Lukas Fleischer |
| 2018 | Pseudorandom Generators from Polarizing Random Walks. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett |
| 2018 | Reordering Rule Makes OBDD Proof Systems Stronger. Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov |
| 2018 | Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. Andrzej Lingas |
| 2018 | Testing Linearity against Non-Signaling Strategies. Alessandro Chiesa, Peter Manohar, Igor Shinkar |
| 2018 | The Power of Natural Properties as Oracles. Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich |
| 2018 | Two-Player Entangled Games are NP-Hard. Anand Natarajan, Thomas Vidick |
| 2018 | Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Noga Alon, Mrinal Kumar, Ben Lee Volk |
| 2018 | Worst-Case to Average Case Reductions for the Distance to a Code. Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf |