APPROX-RANDOM 2020 Special Issue
|
Vol 21, Article 3 (pp 1-41)
Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains by Sarah Miracle, Amanda Pascoe Streib, and Noah Streib |
|
Vol 19, Article 8 (pp 1-71)
Pinning Down the Strong Wilber-1 Bound for Binary Search Trees by Parinya Chalermsook, Julia Chuzhoy, and Thatchaphol Saranurak |
|
Vol 19, Article 6 (pp 1-21)
Reaching a Consensus on Random Networks: The Power of Few by Linh Tran and Van Vu |
|
Vol 19, Article 5 (pp 1-3)
Special Issue: APPROX-RANDOM 2020: Guest Editor's Foreword by Jarosław Byrka and Raghu Meka |