default search action
5th ITCS 2014: Princeton, NJ, USA
- Moni Naor:
Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014. ACM 2014, ISBN 978-1-4503-2698-8
Session 1: 08: 30--8: 40
- Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-based FHE as secure as PKE. 1-12 - Joshua Brody, Sune K. Jakobsen, Dominik Scheder
, Peter Winkler
Cryptogenography. 13-22 - Mohammad Mahmoody
Limits of random oracles in secure computation. 23-34 - Umesh V. Vazirani, Thomas Vidick
Robust device independent quantum key distribution. 35-36
Session 2: 10: 30--10: 40
- Amir Shpilka
On the structure of boolean functions with small spectral norm. 37-48 - Pavel Hrubes, Avi Wigderson:
Non-commutative arithmetic circuits with division. 49-66 - Andrew Wan, John Wright, Chenggang Wu:
Decision trees, protocols and the entropy-influence conjecture. 67-80 - Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. 81-92
Session 3: 14: 00--14: 10
- Uriel Feige, Moshe Tennenholtz:
Invitation games and the price of stability. 93-102 - Mark Braverman, Kanika Pasricha:
The computational hardness of pricing compound options. 103-104 - Deeparnab Chakrabarty, Chaitanya Swamy:
Welfare maximization and truthfulness in mechanism design with ordinal preferences. 105-120 - Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Coordination mechanisms from (almost) all scheduling policies. 121-134
Session 4: 16: 00--16: 10
- Ran Gelles, Amit Sahai, Akshay Wadia:
Private interactive communication across an adversarial channel. 135-144 - Cristopher Moore
Tree codes and a conjecture on exponential sums. 145-154 - Mahdi Cheraghchi
Capacity of non-malleable codes. 155-168 - Erez Druk, Yuval Ishai:
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. 169-182
Session 5: 08: 30--08: 40
- Fernando G. S. L. Brandão, Aram W. Harrow
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. 183-194 - Yossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz:
Sequential decision making with vector outcomes. 195-206 - Yuval Rabani
Learning mixtures of arbitrary distributions over large discrete domains. 207-224 - Jonathan W. Berry, Luke K. Fostvedt
Why do simple algorithms for triangle enumeration work in the real world? 225-234
Session 6: 10: 30--10: 40
- Zvika Brakerski, Guy N. Rothblum:
Black-box obfuscation for d-CNFs. 235-250 - Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. 251-260 - Eric Miles:
Iterated group products and leakage resilience against NC1. 261-268 - Yi-Kai Liu:
Building one-time memories from isolated qubits: (extended abstract). 269-286
Session 7: 14: 00--14: 10
- Elaine Angelino, Varun Kanade
Attribute-efficient evolvability of linear functions. 287-300 - Zeph Landau, Umesh V. Vazirani, Thomas Vidick:
An efficient algorithm for finding the ground state of 1D gapped local hamiltonians. 301-302 - Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Energy-efficient circuit design. 303-312 - Ho-Lin Chen
Rate-independent computation in continuous chemical reaction networks. 313-326
Session 8: 16: 00--16: 10
- Nader H. Bshouty:
Testers and their applications. 327-352 - Manor Mendel, Assaf Naor:
Expanders with respect to Hadamard spaces and random graphs: extended abstract. 353-358 - László Babai
On the automorphism groups of strongly regular graphs I. 359-368 - David Gamarnik, Madhu Sudan:
Limits of local algorithms over sparse random graphs. 369-376
Session 9: 08: 30--08: 40
- Elad Haramaty, Madhu Sudan:
Deterministic compression with uncertain priors. 377-386 - Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster private release of marginals on small databases. 387-402 - Michael J. Kearns, Mallesh M. Pai, Aaron Roth
Mechanism design in large games: incentives and privacy. 403-410 - Kobbi Nissim
Redrawing the boundaries on purchasing data from privacy-sensitive individuals. 411-422
Session 10: 10: 30--10: 40
- Yuichi Yoshida, Yuan Zhou:
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. 423-438 - Venkatesan Guruswami, Euiwoong Lee
Complexity of approximating CSP with balance / hard constraints. 439-448 - Karthekeyan Chandrasekaran, Santosh S. Vempala:
Integer feasibility of random polytopes: random integer programs. 449-458 - Afonso S. Bandeira, Moses Charikar
Multireference alignment using semidefinite programming. 459-470
Session 11: 14: 00--14: 10
- Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of triangle-dense graphs. 471-482 - Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
Partial tests, universal tests and decomposability. 483-500 - Tali Kaufman, Alexander Lubotzky
High dimensional expanders and property testing. 501-506 - Kazuo Iwama, Yuichi Yoshida:
Parameterized testability. 507-516
Session 12: 16: 00--16: 10
- Gillat Kol, Shay Moran, Amir Shpilka
Direct sum fails for zero error average communication. 517-522 - Siyao Guo, Pavel Hubácek
Rational arguments: single round delegation with sublinear verification. 523-540 - Mark Braverman, Jing Chen, Sampath Kannan:
Optimal provision-after-wait in healthcare. 541-542 - Joseph Y. Halpern, Rafael Pass
The truth behind the myth of the folk theorem. 543-554
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 2024-12-15 01:15 CET 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: