Articles under category:
RANDOM
Vol 12, Article 9 (pp 1-23) [APRX-RND14 Spec Issue]
Communication Complexity of Set-Disjointness for All Probabilities
by Mika Göös and Thomas Watson
Vol 12, Article 8 (pp 1-3) [APRX-RND14 Spec Issue]
Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword
by Deeparnab Chakrabarty and David Galvin
Vol 12, Article 1 (pp 1-61) [APRX-RND13 Spec Issue]
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
by Amos Beimel, Kobbi Nissim, and Uri Stemmer
Vol 11, Article 17 (pp 413-443) [APRX-RND13 Spec Issue]
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration
by Emmanuel Abbe and Andrea Montanari
Vol 11, Article 12 (pp 299-338) [APRX-RND13 Spec Issue]
Absolutely Sound Testing of Lifted Codes
by Elad Haramaty, Noga Ron-Zewi, and Madhu Sudan
Vol 11, Article 8 (pp 237-239) [APRX-RND13 Spec Issue]
Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword
by Sofya Raskhodnikova and Ola Svensson
Vol 9, Article 25 (pp 783-807) [APRX-RND12 Spec Issue]
A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes
by Noga Ron-Zewi and Madhu Sudan
Vol 9, Article 15 (pp 559-577) [APRX-RND12 Spec Issue]
Almost $k$-Wise vs. $k$-Wise Independent Permutations, and Uniformity for General Group Actions
by Noga Alon and Shachar Lovett
Vol 9, Article 13 (pp 441-470) [APRX-RND12 Spec Issue]
Optimal Hitting Sets for Combinatorial Shapes
by Aditya Bhaskara, Devendra Desai, and Srikanth Srinivasan
Vol 9, Article 12 (pp 437-439) [APRX-RND12 Spec Issue]
Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword
by Alexandr Andoni and Atri Rudra