Sherstov A.A., “On Multiparty Communication With Large Versus Unbounded Error”, Theory Comput., 14 (2018), 22
Ben-David Sh., Bouland A., Garg A., Kothari R., “Classical Lower Bounds From Quantum Upper Bounds”, 2018 IEEE 59Th Annual Symposium on Foundations of Computer Science (Focs), Annual IEEE Symposium on Foundations of Computer Science, ed. Thorup M., IEEE Computer Soc, 2018, 339–349
Laplante S., Lauriere M., Nolin A., Roland J., Senno G., “Robust Bell Inequalities From Communication Complexity”, Quantum, 2 (2018)
Le Gall F., Magniez F., “Sublinear-Time Quantum Computation of the Diameter in Congest Networks”, Podc'18: Proceedings of the 2018 Acm Symposium on Principles of Distributed Computing, Assoc Computing Machinery, 2018, 337–346
Braverman M., Garg A., Ko Y.K., Mao J., Touchette D., “Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness”, SIAM J. Comput., 47:6 (2018), 2277–2314
Gruska J., Qiu D., Zheng Sh., “Generalizations of the distributed Deutsch–Jozsa promise problem”, Math. Struct. Comput. Sci., 27:3 (2017), 311–331
Kothari P.K., Meka R., Raghavendra P., “Approximating Rectangles By Juntas and Weakly-Exponential Lower Bounds For Lp Relaxations of Csps”, Stoc'17: Proceedings of the 49Th Annual Acm Sigact Symposium on Theory of Computing, Annual Acm Symposium on Theory of Computing, eds. Hatami H., McKenzie P., King V., Assoc Computing Machinery, 2017, 590–603
Montanaro A., “the Quantum Complexity of Approximating the Frequency Moments”, Quantum Inform. Comput., 16:13-14 (2016), 1169–1190
Lee T., Leonardos N., Saks M., Wang F., “Hellinger volume and number-on-the-forehead communication complexity”, J. Comput. Syst. Sci., 82:6 (2016), 1064–1074
Goos M., Lovett Sh., Meka R., Watson T., Zuckerman D., “Rectangles Are Nonnegative Juntas”, SIAM J. Comput., 45:5 (2016), 1835–1869