Citation:
Eric Balkanski and Yaron Singer. 2018. “The Adaptive Complexity of Maximizing a Submodular Function.” In Proceedings of the ACM Symposium on the Theory of Computation (STOC) 2018 . Download
Harvard John A. Paulson School of Engineering and Applied Sciences