APPROX-RANDOM 2019 Special Issue
|
Vol 18, Article 9 (pp 1-18)
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions by Zongchen Chen and Santosh S. Vempala |
|
Vol 18, Article 7 (pp 1-24)
Fast and Deterministic Approximations for $k$-Cut by Kent Quanrud |
|
Vol 18, Article 6 (pp 1-33)
Max-Min Greedy Matching by Alon Eden, Uriel Feige, and Michal Feldman |
|
Vol 18, Article 4 (pp 1-46)
Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas by Rocco A. Servedio and Li-Yang Tan |
|
Vol 17, Article 7 (pp 1-46)
The Large-Error Approximate Degree of AC$^0$ by Mark Bun and Justin Thaler |
|
Vol 17, Article 4 (pp 1-35)
Deterministic Approximation of Random Walks in Small Space by Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan |
|
Vol 17, Article 3 (pp 1-4)
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword by Noga Ron-Zewi, Ivona Bezáková, and László Végh |