Abstract is missing.
- Lattice-based FHE as secure as PKEZvika Brakerski, Vinod Vaikuntanathan. 1-12 [doi]
- CryptogenographyJoshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler. 13-22 [doi]
- Limits of random oracles in secure computationMohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran. 23-34 [doi]
- Robust device independent quantum key distributionUmesh V. Vazirani, Thomas Vidick. 35-36 [doi]
- On the structure of boolean functions with small spectral normAmir Shpilka, Avishay Tal, Ben lee Volk. 37-48 [doi]
- Non-commutative arithmetic circuits with divisionPavel Hrubes, Avi Wigderson. 49-66 [doi]
- Decision trees, protocols and the entropy-influence conjectureAndrew Wan, John Wright, Chenggang Wu. 67-80 [doi]
- Locally testable codes and cayley graphsParikshit Gopalan, Salil P. Vadhan, Yuan Zhou. 81-92 [doi]
- Invitation games and the price of stabilityUriel Feige, Moshe Tennenholtz. 93-102 [doi]
- The computational hardness of pricing compound optionsMark Braverman, Kanika Pasricha. 103-104 [doi]
- Welfare maximization and truthfulness in mechanism design with ordinal preferencesDeeparnab Chakrabarty, Chaitanya Swamy. 105-120 [doi]
- Coordination mechanisms from (almost) all scheduling policiesSayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala. 121-134 [doi]
- Private interactive communication across an adversarial channelRan Gelles, Amit Sahai, Akshay Wadia. 135-144 [doi]
- Tree codes and a conjecture on exponential sumsCristopher Moore, Leonard J. Schulman. 145-154 [doi]
- Capacity of non-malleable codesMahdi Cheraghchi, Venkatesan Guruswami. 155-168 [doi]
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applicationsErez Druk, Yuval Ishai. 169-182 [doi]
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurementsFernando G. S. L. Brandão, Aram Wettroth Harrow, James R. Lee, Yuval Peres. 183-194 [doi]
- Sequential decision making with vector outcomesYossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz. 195-206 [doi]
- Learning mixtures of arbitrary distributions over large discrete domainsYuval Rabani, Leonard J. Schulman, Chaitanya Swamy. 207-224 [doi]
- Why do simple algorithms for triangle enumeration work in the real world?Jonathan W. Berry, Luke K. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson. 225-234 [doi]
- Black-box obfuscation for d-CNFsZvika Brakerski, Guy N. Rothblum. 235-250 [doi]
- 2Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen. 251-260 [doi]
- Iterated group products and leakage resilience against NC1Eric Miles. 261-268 [doi]
- Building one-time memories from isolated qubits: (extended abstract)Yi-Kai Liu. 269-286 [doi]
- Attribute-efficient evolvability of linear functionsElaine Angelino, Varun Kanade. 287-300 [doi]
- An efficient algorithm for finding the ground state of 1D gapped local hamiltoniansZeph Landau, Umesh V. Vazirani, Thomas Vidick. 301-302 [doi]
- Energy-efficient circuit designAntonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato. 303-312 [doi]
- Rate-independent computation in continuous chemical reaction networksHo-Lin Chen, David Doty, David Soloveichik. 313-326 [doi]
- Testers and their applicationsNader H. Bshouty. 327-352 [doi]
- Expanders with respect to Hadamard spaces and random graphs: extended abstractManor Mendel, Assaf Naor. 353-358 [doi]
- On the automorphism groups of strongly regular graphs ILászló Babai. 359-368 [doi]
- Limits of local algorithms over sparse random graphsDavid Gamarnik, Madhu Sudan. 369-376 [doi]
- Deterministic compression with uncertain priorsElad Haramaty, Madhu Sudan. 377-386 [doi]
- Faster private release of marginals on small databasesKarthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, Andrew Wan. 387-402 [doi]
- Mechanism design in large games: incentives and privacyMichael Kearns, Mallesh M. Pai, Aaron Roth, Jonathan Ullman. 403-410 [doi]
- Redrawing the boundaries on purchasing data from privacy-sensitive individualsKobbi Nissim, Salil P. Vadhan, David Xiao. 411-422 [doi]
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problemsYuichi Yoshida, Yuan Zhou. 423-438 [doi]
- Complexity of approximating CSP with balance / hard constraintsVenkatesan Guruswami, Euiwoong Lee. 439-448 [doi]
- Integer feasibility of random polytopes: random integer programsKarthekeyan Chandrasekaran, Santosh Vempala. 449-458 [doi]
- Multireference alignment using semidefinite programmingAfonso S. Bandeira, Moses Charikar, Amit Singer, Andy Zhu. 459-470 [doi]
- Decompositions of triangle-dense graphsRishi Gupta, Tim Roughgarden, C. Seshadhri. 471-482 [doi]
- Partial tests, universal tests and decomposabilityEldar Fischer, Yonatan Goldhirsh, Oded Lachish. 483-500 [doi]
- High dimensional expanders and property testingTali Kaufman, Alexander Lubotzky. 501-506 [doi]
- Parameterized testabilityKazuo Iwama, Yuichi Yoshida. 507-516 [doi]
- Direct sum fails for zero error average communicationGillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff. 517-522 [doi]
- Rational arguments: single round delegation with sublinear verificationSiyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald. 523-540 [doi]
- Optimal provision-after-wait in healthcareMark Braverman, Jing Chen, Sampath Kannan. 541-542 [doi]
- The truth behind the myth of the folk theoremJoseph Y. Halpern, Rafael Pass, Lior Seeman. 543-554 [doi]