Abstract is missing.
- High-confidence predictions under adversarial uncertaintyAndrew Drucker. 1-10 [doi]
- Learning hurdles for sleeping expertsVarun Kanade, Thomas Steinke. 11-18 [doi]
- Restriction accessZeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff. 19-33 [doi]
- Mechanism design with approximate valuationsAlessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu. 34-38 [doi]
- Quantum strategic game theoryShengyu Zhang. 39-59 [doi]
- The curse of simultaneityRenato Paes Leme, Vasilis Syrgkanis, Éva Tardos. 60-67 [doi]
- No justified complaints: on fair sharing of multiple resourcesDanny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Raz Kupferman, Nathan Linial. 68-75 [doi]
- From randomizing polynomials to parallel algorithmsYuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky. 76-89 [doi]
- Practical verified computation with streaming interactive proofsGraham Cormode, Michael Mitzenmacher, Justin Thaler. 90-112 [doi]
- Paging for multi-core shared cachesAlejandro López-Ortiz, Alejandro Salinger. 113-127 [doi]
- Noise vs computational intractability in dynamicsMark Braverman, Alexander Grigo, Cristobal Rojas. 128-141 [doi]
- Distribution free evolvability of polynomial functions over all convex loss functionsPaul Valiant. 142-148 [doi]
- Algorithms on evolving graphsAris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin. 149-160 [doi]
- Towards deterministic tree code constructionsMark Braverman. 161-167 [doi]
- Linear time decoding of regular expander codesMichael Viderman. 168-182 [doi]
- List decoding subspace codes from insertions and deletionsVenkatesan Guruswami, Srivatsan Narayanan, Carol Wang. 183-189 [doi]
- Bounds on locally testable codes with unique testsGillat Kol, Ran Raz. 190-202 [doi]
- Approximately optimal mechanism design via differential privacyKobbi Nissim, Rann Smorodinsky, Moshe Tennenholtz. 203-213 [doi]
- Fairness through awarenessCynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel. 214-226 [doi]
- Dynamics of prisoner's dilemma and the evolution of cooperation on networksVahideh H. Manshadi, Amin Saberi. 227-235 [doi]
- Crowdsourced Bayesian auctionsPablo Azar 0002, Jing Chen, Silvio Micali. 236-248 [doi]
- Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structureBohua Zhan, Shelby Kimmel, Avinatan Hassidim. 249-265 [doi]
- Quantum interactive proofs with weak error boundsTsuyoshi Ito, Hirotada Kobayashi, John Watrous. 266-275 [doi]
- Quantum money from knotsEdward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor. 276-289 [doi]
- Quantum rejection samplingMaris Ozols, Martin Roetteler, Jérémie Roland. 290-308 [doi]
- (Leveled) fully homomorphic encryption without bootstrappingZvika Brakerski, Craig Gentry, Vinod Vaikuntanathan. 309-325 [doi]
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back againNir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer. 326-349 [doi]
- Targeted malleability: homomorphic encryption for restricted computationsDan Boneh, Gil Segev, Brent Waters. 350-366 [doi]
- Sherali-Adams relaxations and indistinguishability in counting logicsAlbert Atserias, Elitza N. Maneva. 367-379 [doi]
- Graph densificationMoritz Hardt, Nikhil Srivastava, Madhur Tulsiani. 380-392 [doi]
- Spectral sparsification via random spannersMichael Kapralov, Rina Panigrahy. 393-398 [doi]
- Multicommodity flows and cuts in polymatroidal networksChandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath. 399-408 [doi]
- On the degree of univariate polynomials over the integersGil Cohen, Amir Shpilka, Avishay Tal. 409-427 [doi]
- On persistent homotopy, knotted complexes and the Alexander moduleDavid Letscher. 428-441 [doi]
- Compressed matrix multiplicationRasmus Pagh. 442-451 [doi]
- Gadgets and anti-gadgets leading to a complexity dichotomyJin-yi Cai, Michael Kowalczyk, Tyson Williams. 452-467 [doi]
- On beating the hybrid argumentBill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola. 468-483 [doi]
- Linear programming, width-1 CSPs, and robust satisfactionGábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou. 484-495 [doi]
- Marginal hitting sets imply super-polynomial lower bounds for permanentMaurice J. Jansen, Rahul Santhanam. 496-506 [doi]