default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 12
Volume 12, Number 1, 2016
- Amos Beimel
, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. 1-61 - Daniel Dadush, Gábor Kun:
Lattice Sparsification and the Approximate Closest Vector Problem. 1-34 - Matthew McKague:
Interactive Proofs for BQP via Self-Tested Graph States. 1-42 - Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest: Discrete and SoS. 1-50 - Neil Thapen:
A Tradeoff Between Length and Width in Resolution. 1-14 - Venkatesan Guruswami, Euiwoong Lee:
Simple Proof of Hardness of Feedback Vertex Set. 1-11 - Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. 1-27 - Deeparnab Chakrabarty, David J. Galvin:
Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword. 1-3 - Mika Göös, Thomas Watson:
Communication Complexity of Set-Disjointness for All Probabilities. 1-23 - Amit Chakrabarti, Graham Cormode, Andrew McGregor:
Robust Lower Bounds for Communication and Stream Computation. 1-35 - Raghu Meka, Oanh Nguyen, Van Vu:
Anti-concentration for Polynomials of Independent Random Variables. 1-17 - Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Non-Commutative Skew Circuits. 1-38 - Nicole Megow, Mary Wootters:
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. 1-3 - Nikhil Bansal, Bouke Cloostermans:
Minimizing Maximum Flow-Time on Related Machines. 1-14 - Eden Chlamtác, Michael Dinitz:
Lowest-Degree k-Spanner: Approximation and Hardness. 1-29 - Mark Bun, Justin Thaler:
Dual Polynomials for Collision and Element Distinctness. 1-34 - Anand Louis, Yury Makarychev:
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion. 1-25 - Cedric Yen-Yu Lin, Han-Hsuan Lin:
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester. 1-35 - Mika Göös, Jukka Suomela:
Locally Checkable Proofs in Distributed Computing. 1-33 - Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. 1-25
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-12-05 22:24 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:
