Abstract is missing.
- Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. 1-19 [doi]
- Breaking and Making Quantum Money: Toward a New Quantum Cryptographic ProtocolAndrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor. 20-31 [doi]
- Analytical Tools for Natural AlgorithmsBernard Chazelle. 32-41 [doi]
- A New Approach to Strongly Polynomial Linear ProgrammingMihály Bárász, Santosh Vempala. 42-48 [doi]
- Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract)Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge. 49-65 [doi]
- Pan-Private Streaming AlgorithmsCynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin. 66-80 [doi]
- Robustly Leveraging Collusion in Combinatorial AuctionsJing Chen, Silvio Micali, Paul Valiant. 81-93 [doi]
- Robust Perfect Revenue From Perfectly Informed PlayersJing Chen, Avinatan Hassidim, Silvio Micali. 94-105 [doi]
- Playing Games without Observing PayoffsMichal Feldman, Adam Kalai, Moshe Tennenholtz. 106-110 [doi]
- Adversarial Leakage in GamesNoga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. 111-119 [doi]
- Game Theory with Costly Computation: Formulation and Application to Protocol SecurityJoseph Y. Halpern, Rafael Pass. 120-142 [doi]
- Bounding Rationality by Discounting TimeLance Fortnow, Rahul Santhanam. 143-155 [doi]
- Market Equilibrium under Separable, Piecewise-Linear, Concave UtilitiesVijay V. Vazirani, Mihalis Yannakakis. 156-165 [doi]
- Beyond Equilibria: Mechanisms for Repeated Combinatorial AuctionsBrendan Lucier. 166-177 [doi]
- A New Look at Selfish RoutingChristos H. Papadimitriou, Gregory Valiant. 178-187 [doi]
- Local Algorithms for Finding Interesting Individuals in Large NetworksMickey Brautbar, Michael Kearns. 188-199 [doi]
- Circumventing the Price of Anarchy: Leading Dynamics to Good BehaviorMaria-Florina Balcan, Avrim Blum, Yishay Mansour. 200-213 [doi]
- Reaching Consensus on Social NetworksElchanan Mossel, Grant Schoenebeck. 214-229 [doi]
- Robustness of the Learning with Errors AssumptionShafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan. 230-240 [doi]
- Distribution-Specific Agnostic BoostingVitaly Feldman. 241-250 [doi]
- Space-Efficient Estimation of Robust Statistics and Distribution TestingSteve Chien, Katrina Ligett, Andrew McGregor. 251-265 [doi]
- Cryptographic Complexity Classes and Computational Intractability AssumptionsHemanta K. Maji, Manoj Prabhakaran, Mike Rosulek. 266-289 [doi]
- Hard Instances for Satisfiability and Quasi-one-way FunctionsAndrej Bogdanov, Kunal Talwar, Andrew Wan. 290-300 [doi]
- On the Construction of One-Way Functions from Average Case HardnessNoam Livne. 301-309 [doi]
- Proof-Carrying Data and Hearsay Arguments from Signature CardsAlessandro Chiesa, Eran Tromer. 310-331 [doi]
- Are Stable Instances Easy?Yonatan Bilu, Nathan Linial. 332-341 [doi]
- A New Approximation Technique for Resource-Allocation ProblemsBarna Saha, Aravind Srinivasan. 342-357 [doi]
- Global Alignment of Molecular Sequences via Ancestral State ReconstructionAlexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch. 358-369 [doi]
- Effectively Polynomial SimulationsToniann Pitassi, Rahul Santhanam. 370-382 [doi]
- Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based ExtractionAriel Gabizon, Avinatan Hassidim. 397-405 [doi]
- Symmetric LDPC Codes and Local TestingTali Kaufman, Avi Wigderson. 406-421 [doi]
- Weight Distribution and List-Decoding Size of Reed-Muller CodesTali Kaufman, Shachar Lovett, Ely Porat. 422-433 [doi]
- Non-Malleable CodesStefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs. 434-452 [doi]
- Interactive Proofs For Quantum ComputationsDorit Aharonov, Michael Ben-Or, Elad Eban. 453-469 [doi]
- On the Power of a Unique Quantum WitnessRahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang. 470-481 [doi]
- Bounds on the Quantum Satisfiability ThresholdSergey Bravyi, Cristopher Moore, Alexander Russell. 482-489 [doi]
- Memory Consistency Conditions for Self-Assembly ProgrammingAaron Sterling. 490-500 [doi]
- Cache Replacement Policies for Multicore ProcessorsAvinatan Hassidim. 501-509 [doi]