Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar4. ITCS 2013: Cambridge, MA, USA
Robert D. Kleinberg:
Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013. ACM 2013, ISBN 978-1-4503-1859-4
Session 1
- Daniel J. Hsu, Sham M. Kakade:
Learning mixtures of spherical gaussians: moment methods and spectral decompositions. 11-20 - Liu Yang, Avrim Blum, Jaime G. Carbonell:
Learnability of DNF with representation-specific queries. 37-46
Session 2
- Kai-Min Chung, Edward Lui, Rafael Pass:
Can theories be tested?: a cryptographic treatment of forecast testing. 47-56 - Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani:
Multiplicative updates in coordination games and the theory of evolution. 57-58 - Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the convergence of the Hegselmann-Krause system. 61-66
Session 3
- Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
Differentially private data analysis of social networks via restricted sensitivity. 87-96 - Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the sample complexity of private learners. 97-110
Session 4
- Oded Goldreich, Shafi Goldwasser, Dana Ron:
On the possibilities and limitations of pseudodeterministic algorithms. 127-138 - Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun:
Space-bounded communication complexity. 159-172
Session 5
- Per Austrin, Subhash Khot:
A characterization of approximation resistance for even k-partite CSPs. 187-196 - Boaz Barak, Guy Kindler, David Steurer:
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. 197-214
Session 6
- Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. 221-230 - Arpita Ghosh, Patrick Hummel:
Learning and incentives in user-generated content: multi-armed bandits with endogenous arms. 233-246
Session 7
- Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng:
Runtime guarantees for regression problems. 269-282
Session 8
- Ben W. Reichardt, Falk Unger, Umesh V. Vazirani:
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. 321-322 - Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger methods of making quantum interactive proofs perfectly complete. 329-352 - Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin:
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. 353-354
Session 9
- Daniele Micciancio, Stefano Tessaro:
An equational approach to secure multi-party computation. 355-372 - Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Publicly verifiable proofs of sequential work. 373-388 - Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass:
On the power of nonuniformity in proofs of security. 389-400 - Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. 401-414 - Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based corruptions and the combinatorics of hidden diversity. 415-428
Session 10
- Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. 455-472
Session 11
- Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski:
Catch them if you can: how to serve impatient users. 485-494 - Nicole Megow, Julián Mestre:
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. 495-504 - Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty. 505-514 - Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Sorting noisy data with partial information. 515-528
Session 12
- Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. 561-580
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-22 21:51 CEST by the dblp team