APPROX-RANDOM 2016 Special Issue
|
Vol 18, Article 3 (pp 1-29)
Near-Optimal NP-Hardness of Approximating Max $k$-CSP$_R$ by Pasin Manurangsi, Preetum Nakkiran, and Luca Trevisan |
|
Vol 16, Article 15 (pp 1-25)
Online Row Sampling by Michael B. Cohen, Cameron Musco, and Jakub Pachocki |
|
Vol 15, Article 15 (pp 1-58)
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem by Daniel Dadush, Shashwat Garg, Shachar Lovett, and Aleksandar Nikolov |
|
Vol 15, Article 14 (pp 1-3)
Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword by Shiri Chechik and Ronen Shaltiel |