Round Complexity of Common Randomness Generation: The Amortized Setting

DOI10.1137/1.9781611975994.66OpenAlexW3001783123MaRDI QIDQ5146837

Noah Golowich

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.00323

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Round Complexity of Common Randomness Generation: The Amortized Setting