APPROX-RANDOM 2014 Special Issue
|
Vol 13, Article 12 (pp 1-50)
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs by Thomas Steinke, Salil Vadhan, and Andrew Wan |
|
Vol 12, Article 17 (pp 1-25)
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion by Anand Louis and Yury Makarychev |
|
Vol 12, Article 15 (pp 1-29)
Lowest-Degree $k$-Spanner: Approximation and Hardness by Eden Chlamtáč and Michael Dinitz |
|
Vol 12, Article 9 (pp 1-23)
Communication Complexity of Set-Disjointness for All Probabilities by Mika Göös and Thomas Watson |
|
Vol 12, Article 8 (pp 1-3)
Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword by Deeparnab Chakrabarty and David Galvin |