logo
  • Articles
  • editors
  • Submit
  • Search
  • Home
  • About
  • Articles
  • Special Issues
  • Graduate Surveys
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
APPROX-RANDOM 2020 Special Issue
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