Alexander A. Sherstov, “The Power of Asymmetry in Constant-Depth Circuits”, SIAM J. Comput., 47, no. 6, 2018, 2362
Thomas Watson, “Communication Complexity with Small Advantage”, comput. complex., 29, no. 1, 2020, 2
Alexander A. Sherstov, Pei Wu, “Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$”, SIAM J. Comput., 52, no. 2, 2023, STOC19-1
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, 8087, Mathematical Foundations of Computer Science 2013, 2013, 516
Mark Bun, Justin Thaler, “A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$”, SIAM J. Comput., 49, no. 4, 2020, FOCS17-59
Mika Göös, Toniann Pitassi, Thomas Watson, “Query-to-Communication Lifting for BPP”, SIAM J. Comput., 49, no. 4, 2020, FOCS17-441
Hartmut Klauck, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 189
Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman, Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, 2015, 257
Mark Bun, Justin Thaler, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 1
Alexander A. Sherstov, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 223