APPROX-RANDOM 2013 Special Issue
|
Vol 13, Article 5 (pp 1-47)
A Pseudo-Approximation for the Genus of Hamiltonian Graphs by Yury Makarychev, Amir Nayyeri, and Anastasios Sidiropoulos |
|
Vol 12, Article 1 (pp 1-61)
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy by Amos Beimel, Kobbi Nissim, and Uri Stemmer |
|
Vol 11, Article 17 (pp 413-443)
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration by Emmanuel Abbe and Andrea Montanari |
|
Vol 11, Article 12 (pp 299-338)
Absolutely Sound Testing of Lifted Codes by Elad Haramaty, Noga Ron-Zewi, and Madhu Sudan |
|
Vol 11, Article 10 (pp 257-283)
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems by Per Austrin, Rajsekar Manokaran, and Cenny Wenner |
|
Vol 11, Article 9 (pp 241-256)
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs by Shayan Oveis Gharan and Luca Trevisan |
|
Vol 11, Article 8 (pp 237-239)
Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword by Sofya Raskhodnikova and Ola Svensson |