Abstract is missing.
- Can Almost Everybody be Almost Happy?Yakov Babichenko, Christos H. Papadimitriou, Aviad Rubinstein. 1-9 [doi]
- Mechanisms With Costly KnowledgeAtalay Mert Ileri, Silvio Micali. 11-19 [doi]
- On the Computational Complexity of Optimal Simple MechanismsAviad Rubinstein. 21-28 [doi]
- Permanent v. Determinant: An Exponential Lower Bound Assuming SymmetryJoseph M. Landsberg, Nicolas Ressayre. 29-35 [doi]
- On Hardness of Approximating the Parameterized Clique ProblemSubhash Khot, Igor Shinkar. 37-45 [doi]
- The Complexity of DNF of ParitiesGil Cohen, Igor Shinkar. 47-58 [doi]
- Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity FunctionsParikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson. 59-70 [doi]
- Local Algorithms for Block Models with Side InformationElchanan Mossel, Jiaming Xu. 71-80 [doi]
- Distribution DesignAmos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz. 81-92 [doi]
- Sampling CorrectorsClément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld. 93-102 [doi]
- On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract]Roei Tell. 103-110 [doi]
- Strategic ClassificationMoritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters. 111-122 [doi]
- A PAC Approach to Application-Specific Algorithm SelectionRishi Gupta, Tim Roughgarden. 123-134 [doi]
- An Axiomatic Approach to Community DetectionChristian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng. 135-146 [doi]
- Obfuscating Conjunctions under Entropic Ring LWEZvika Brakerski, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs. 147-156 [doi]
- Secure Multiparty Computation with General Interaction PatternsShai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin. 157-168 [doi]
- Fully Succinct Garbled RAMRan Canetti, Justin Holmgren. 169-178 [doi]
- Cryptography for Parallel RAM from Indistinguishability ObfuscationYu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou. 179-190 [doi]
- Timeability of Extensive-Form GamesSune K. Jakobsen, Troels Bjerre Sørensen, Vincent Conitzer. 191-199 [doi]
- Auction Revenue in the General Spiteful-Utility ModelJing Chen, Silvio Micali. 201-211 [doi]
- How to Incentivize Data-Driven Collaboration Among Competing PartiesPablo Daniel Azar, Shafi Goldwasser, Sunoo Park. 213-225 [doi]
- From Nash Equilibria to Chain Recurrent Sets: Solution Concepts and TopologyChristos H. Papadimitriou, Georgios Piliouras. 227-235 [doi]
- Rational Proofs with Multiple ProversJing Chen, Samuel McCauley, Shikha Singh 0002. 237-248 [doi]
- Lower Bounds: From Circuits to QBF Proof SystemsOlaf Beyersdorff, Ilario Bonacina, Leroy Chew. 249-260 [doi]
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibilityMarco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider. 261-270 [doi]
- The Space "Just Above" BQPScott Aaronson, Adam Bouland, Joseph Fitzsimons, Mitchell Lee. 271-280 [doi]
- Coordination Complexity: Small Information Coordinating Large PopulationsRachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu. 281-290 [doi]
- On a Natural Dynamics for Linear ProgrammingDamian Straszak, Nisheeth K. Vishnoi. 291 [doi]
- On the Space Complexity of Linear Programming with PreprocessingYael Tauman Kalai, Ran Raz, Oded Regev. 293-300 [doi]
- Spectral Embedding of k-Cliques, Graph Partitioning and k-MeansPranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop. 301-310 [doi]
- On Sketching Quadratic FormsAlexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang. 311-319 [doi]
- Energy-Efficient AlgorithmsErik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi. 321-332 [doi]
- How To Bootstrap Anonymous CommunicationSune K. Jakobsen, Claudio Orlandi. 333-344 [doi]
- Time-Lock Puzzles from Randomized EncodingsNir Bitansky, Shafi Goldwasser, Abhishek Jain 0002, Omer Paneth, Vinod Vaikuntanathan, Brent Waters. 345-356 [doi]
- Is There an Oblivious RAM Lower Bound?Elette Boyle, Moni Naor. 357-368 [doi]
- Simultaneous Private Learning of Multiple ConceptsMark Bun, Kobbi Nissim, Uri Stemmer. 369-380 [doi]
- Information Complexity Density and Simulation of ProtocolsHimanshu Tyagi, Shaileshh Bojja Venkatakrishnan, Pramod Viswanath, Shun Watanabe. 381-391 [doi]
- Satisfiability on Mixed InstancesRuiwen Chen, Rahul Santhanam. 393-402 [doi]
- On the Computational Complexity of Limit Cycles in Dynamical SystemsChristos H. Papadimitriou, Nisheeth K. Vishnoi. 403 [doi]
- Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower BoundsAlexander Golovnev, Alexander S. Kulikov. 405-411 [doi]