| 2017 | 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, Berkeley, CA, USA, January 9-11, 2017 Christos H. Papadimitriou |
| 2017 | A Hierarchy Theorem for Interactive Proofs of Proximity. Tom Gur, Ron D. Rothblum |
| 2017 | Algorithmic Aspects of Private Bayesian Persuasion. Yakov Babichenko, Siddharth Barman |
| 2017 | An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity. Benjamin Rossman |
| 2017 | Approximating Approximate Distance Oracles. Michael Dinitz, Zeyu Zhang |
| 2017 | Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All. Mark Braverman, Sumegha Garg, Ariel Schvartzman |
| 2017 | Compression in a Distributed Setting. Badih Ghazi, Elad Haramaty, Pritish Kamath, Madhu Sudan |
| 2017 | Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. Nancy A. Lynch, Cameron Musco, Merav Parter |
| 2017 | Conditional Hardness for Sensitivity Problems. Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams |
| 2017 | Conditional Sparse Linear Regression. Brendan Juba |
| 2017 | Condorcet-Consistent and Approximately Strategyproof Tournament Rules. Jon Schneider, Ariel Schvartzman, S. Matthew Weinberg |
| 2017 | Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. Ran Gelles, Yael Tauman Kalai |
| 2017 | Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam |
| 2017 | Cube vs. Cube Low Degree Test. Amey Bhangale, Irit Dinur, Inbal Livni Navon |
| 2017 | Cumulative Space in Black-White Pebbling and Resolution. Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals |
| 2017 | Detecting communities is Hard (And Counting Them is Even Harder). Aviad Rubinstein |
| 2017 | Expander Construction in VNC1. Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký |
| 2017 | Fast Cross-Polytope Locality-Sensitive Hashing. Christopher Kennedy, Rachel A. Ward |
| 2017 | Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete. Steffen Schuldenzucker, Sven Seuken, Stefano Battiston |
| 2017 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2017 | Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions. Ioannis Panageas, Georgios Piliouras |
| 2017 | Hierarchical Functional Encryption. Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev |
| 2017 | High Dimensional Random Walks and Colorful Expansion. Tali Kaufman, David Mass |
| 2017 | Inferential Privacy Guarantees for Differentially Private Mechanisms. Arpita Ghosh, Robert Kleinberg |
| 2017 | Inherent Trade-Offs in the Fair Determination of Risk Scores. Jon M. Kleinberg, Sendhil Mullainathan, Manish Raghavan |
| 2017 | Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent. Zeyuan Allen Zhu, Lorenzo Orecchia |
| 2017 | Low-Complexity Cryptographic Hash Functions . Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan |
| 2017 | Low-Sensitivity Functions from Unambiguous Certificates. Shalev Ben-David, Pooya Hatami, Avishay Tal |
| 2017 | Metatheorems for Dynamic Weighted Matching. Daniel Stubbs, Virginia Vassilevska Williams |
| 2017 | Multi-Clique-Width. Martin Fürer |
| 2017 | Multiplayer Parallel Repetition for Expanding Games. Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen |
| 2017 | Mutation, Sexual Reproduction and Survival in Dynamic Environments. Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani |
| 2017 | Nash Social Welfare, Matrix Permanent, and Stable Polynomials. Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh |
| 2017 | Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models. Lennart Gulikers, Marc Lelarge, Laurent Massoulié |
| 2017 | Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication. Harry Buhrman, Matthias Christandl, Jeroen Zuiddam |
| 2017 | On the Power of Learning from k-Wise Queries. Vitaly Feldman, Badih Ghazi |
| 2017 | Outlaw Distributions and Locally Decodable Codes. Jop Briët, Zeev Dvir, Sivakanth Gopi |
| 2017 | Overlapping Qubits. Rui Chao, Ben W. Reichardt, Chris Sutherland, Thomas Vidick |
| 2017 | Parallel Repetition via Fortification: Analytic View and the Quantum Case. Mohammad Bavarian, Thomas Vidick, Henry Yuen |
| 2017 | Parameterized Property Testing of Functions. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma |
| 2017 | Quantum Codes from High-Dimensional Manifolds. Matthew B. Hastings |
| 2017 | Quantum Recommendation Systems. Iordanis Kerenidis, Anupam Prakash |
| 2017 | Random Walks in Polytopes and Negative Dependence. Yuval Peres, Mohit Singh, Nisheeth K. Vishnoi |
| 2017 | Real Stability Testing. Prasad Raghavendra, Nick Ryder, Nikhil Srivastava |
| 2017 | Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. Itai Arad, Zeph Landau, Umesh V. Vazirani, Thomas Vidick |
| 2017 | SOS Is Not Obviously Automatizable, Even Approximately. Ryan O'Donnell |
| 2017 | Self-Sustaining Iterated Learning. Bernard Chazelle, Chu Wang |
| 2017 | Separators in Region Intersection Graphs. James R. Lee |
| 2017 | Simultaneously Load Balancing for Every p-norm, With Reassignments. Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein |
| 2017 | Testing Submodularity and Other Properties of Valuation Functions. Eric Blais, Abhinav Bommireddi |
| 2017 | Testing k-Monotonicity. Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer |
| 2017 | The Classification of Reversible Bit Operations. Scott Aaronson, Daniel Grier, Luke Schaeffer |
| 2017 | The Complexity of Problems in P Given Correlated Instances. Shafi Goldwasser, Dhiraj Holden |
| 2017 | The Distortion of Locality Sensitive Hashing. Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli |
| 2017 | The Duality Gap for Two-Team Zero-Sum Games. Leonard J. Schulman, Umesh V. Vazirani |
| 2017 | The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting. Mathieu Laurière, Dave Touchette |
| 2017 | The Journey from NP to TFNP Hardness. Pavel Hubácek, Moni Naor, Eylon Yogev |
| 2017 | Towards Hardness of Approximation for Polynomial Time Problems. Amir Abboud, Arturs Backurs |
| 2017 | Towards Human Computable Passwords. Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala |
| 2017 | Very Simple and Efficient Byzantine Agreement. Silvio Micali |
| 2017 | Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games. Xi Chen, Yu Cheng, Bo Tang |
| 2017 | What Circuit Classes Can Be Learned with Non-Trivial Savings?. Rocco A. Servedio, Li-Yang Tan |