Abstract is missing.
- Massive online teaching to bounded learnersBrendan Juba, Ryan Williams. 1-10 [doi]
- Learning mixtures of spherical gaussians: moment methods and spectral decompositionsDaniel Hsu, Sham M. Kakade. 11-20 [doi]
- Low-weight halfspaces for sparse boolean vectorsPhilip M. Long, Rocco A. Servedio. 21-36 [doi]
- Learnability of DNF with representation-specific queriesLiu Yang, Avrim Blum, Jaime G. Carbonell. 37-46 [doi]
- Can theories be tested?: a cryptographic treatment of forecast testingKai-Min Chung, Edward Lui, Rafael Pass. 47-56 [doi]
- Multiplicative updates in coordination games and the theory of evolutionErick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani. 57-58 [doi]
- Making evolution rigorous: the error thresholdNisheeth K. Vishnoi. 59-60 [doi]
- On the convergence of the Hegselmann-Krause systemArnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen. 61-66 [doi]
- Is privacy compatible with truthfulness?David Xiao. 67-86 [doi]
- Differentially private data analysis of social networks via restricted sensitivityJeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet. 87-96 [doi]
- Characterizing the sample complexity of private learnersAmos Beimel, Kobbi Nissim, Uri Stemmer. 97-110 [doi]
- Barriers in cryptography with weak, correlated and leaky sourcesDaniel Wichs. 111-126 [doi]
- On the possibilities and limitations of pseudodeterministic algorithmsOded Goldreich, Shafi Goldwasser, Dana Ron. 127-138 [doi]
- Evasiveness through a circuit lensRaghav Kulkarni. 139-144 [doi]
- The garden-hose modelHarry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman. 145-158 [doi]
- Space-bounded communication complexityJoshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun. 159-172 [doi]
- Towards an optimal query efficient PCP?Subhash Khot, Muli Safra, Madhur Tulsiani. 173-186 [doi]
- A characterization of approximation resistance for even k-partite CSPsPer Austrin, Subhash Khot. 187-196 [doi]
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfactionBoaz Barak, Guy Kindler, David Steurer. 197-214 [doi]
- On the power of many one-bit proversPer Austrin, Johan Håstad, Rafael Pass. 215-220 [doi]
- Approaching utopia: strong truthfulness and externality-resistant mechanismsAmos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali. 221-230 [doi]
- Parametric digital auctionsPablo Daniel Azar, Silvio Micali. 231-232 [doi]
- Learning and incentives in user-generated content: multi-armed bandits with endogenous armsArpita Ghosh, Patrick Hummel. 233-246 [doi]
- Welfare maximization and the supermodular degreeUriel Feige, Rani Izsak. 247-256 [doi]
- Reachability in graph timelinesJakub Lacki, Piotr Sankowski. 257-268 [doi]
- Runtime guarantees for regression problemsHui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng. 269-282 [doi]
- An energy complexity model for algorithmsSwapnoneel Roy, Atri Rudra, Akshat Verma. 283-304 [doi]
- Streaming computations with a loquacious proverHartmut Klauck, Ved Prakash. 305-320 [doi]
- A classical leash for a quantum system: command of quantum systems via rigidity of CHSH gamesBen W. Reichardt, Falk Unger, Umesh V. Vazirani. 321-322 [doi]
- Adversary lower bound for the k-sum problemAleksandrs Belovs, Robert Spalek. 323-328 [doi]
- Stronger methods of making quantum interactive proofs perfectly completeHirotada Kobayashi, François Le Gall, Harumichi Nishimura. 329-352 [doi]
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic timeDamien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin. 353-354 [doi]
- An equational approach to secure multi-party computationDaniele Micciancio, Stefano Tessaro. 355-372 [doi]
- Publicly verifiable proofs of sequential workMohammad Mahmoody, Tal Moran, Salil P. Vadhan. 373-388 [doi]
- On the power of nonuniformity in proofs of securityKai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass. 389-400 [doi]
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstractEli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer. 401-414 [doi]
- Resource-based corruptions and the combinatorics of hidden diversityJuan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung. 415-428 [doi]
- Time hierarchies for sampling distributionsThomas Watson. 429-440 [doi]
- Properties and applications of boolean function compositionAvishay Tal. 441-454 [doi]
- Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systemsIlario Bonacina, Nicola Galesi. 455-472 [doi]
- Competing provers protocols for circuit evaluationGillat Kol, Ran Raz. 473-484 [doi]
- Catch them if you can: how to serve impatient usersMarek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski. 485-494 [doi]
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraintsNicole Megow, Julián Mestre. 495-504 [doi]
- Robust optimization in the presence of uncertaintyJoachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer. 505-514 [doi]
- Sorting noisy data with partial informationKonstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan. 515-528 [doi]
- New affine-invariant codes from liftingAlan Guo, Swastik Kopparty, Madhu Sudan. 529-540 [doi]
- H-wise independenceIshay Haviv, Michael Langberg. 541-552 [doi]
- Sparse extractor families for all the entropyAndrej Bogdanov, Siyao Guo. 553-560 [doi]
- On the power of conditional samples in distribution testingSourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah. 561-580 [doi]