default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th 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
- Brendan Juba, Ryan Williams
:
Massive online teaching to bounded learners. 1-10 - Daniel J. Hsu, Sham M. Kakade:
Learning mixtures of spherical gaussians: moment methods and spectral decompositions. 11-20 - Philip M. Long, Rocco A. Servedio:
Low-weight halfspaces for sparse boolean vectors. 21-36 - 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 - Nisheeth K. Vishnoi:
Making evolution rigorous: the error threshold. 59-60 - Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the convergence of the Hegselmann-Krause system. 61-66
Session 3
- David Xiao:
Is privacy compatible with truthfulness? 67-86 - 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 - Daniel Wichs:
Barriers in cryptography with weak, correlated and leaky sources. 111-126
Session 4
- Oded Goldreich, Shafi Goldwasser, Dana Ron:
On the possibilities and limitations of pseudodeterministic algorithms. 127-138 - Raghav Kulkarni:
Evasiveness through a circuit lens. 139-144 - Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The garden-hose model. 145-158 - Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun:
Space-bounded communication complexity. 159-172
Session 5
- Subhash Khot, Muli Safra, Madhur Tulsiani:
Towards an optimal query efficient PCP? 173-186 - 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 - Per Austrin, Johan Håstad, Rafael Pass:
On the power of many one-bit provers. 215-220
Session 6
- Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. 221-230 - Pablo Daniel Azar, Silvio Micali:
Parametric digital auctions. 231-232 - Arpita Ghosh, Patrick Hummel:
Learning and incentives in user-generated content: multi-armed bandits with endogenous arms. 233-246 - Uriel Feige, Rani Izsak:
Welfare maximization and the supermodular degree. 247-256
Session 7
- Jakub Lacki, Piotr Sankowski:
Reachability in graph timelines. 257-268 - Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng:
Runtime guarantees for regression problems. 269-282 - Swapnoneel Roy, Atri Rudra, Akshat Verma:
An energy complexity model for algorithms. 283-304 - Hartmut Klauck, Ved Prakash:
Streaming computations with a loquacious prover. 305-320
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 - Aleksandrs Belovs, Robert Spalek:
Adversary lower bound for the k-sum problem. 323-328 - 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
- Thomas Watson:
Time hierarchies for sampling distributions. 429-440 - Avishay Tal:
Properties and applications of boolean function composition. 441-454 - Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. 455-472 - Gillat Kol, Ran Raz:
Competing provers protocols for circuit evaluation. 473-484
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
- Alan Guo, Swastik Kopparty, Madhu Sudan:
New affine-invariant codes from lifting. 529-540 - Ishay Haviv, Michael Langberg:
H-wise independence. 541-552 - Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. 553-560 - Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. 561-580
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-24 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
