Vahid Asadi, Richard Cleve, Eric Culf, Alex May, “Linear gate bounds against natural functions for position-verification”, Quantum, 9 (2025), 1604
Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye, “Quantum and Classical Communication Complexity of Permutation-Invariant Functions”, IEEE Trans. Inform. Theory, 71:4 (2025), 2782
Alexander A. Sherstov, “The Approximate Degree of DNF and CNF Formulas”, SIAM J. Comput., 54:3 (2025), 702
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley, “Separation of the Factorization Norm and Randomized Communication Complexity”, comput. complex., 34:2 (2025)
Ashley Montanaro, Changpeng Shao, “Quantum Communication Complexity of Linear Regression”, ACM Trans. Comput. Theory, 16:1 (2024), 1
Michael de Oliveira, Luís S. Barbosa, Ernesto F. Galvão, “Quantum advantage in temporally flat measurement-based quantum computation”, Quantum, 8 (2024), 1312
Ruoyu Meng, Aditya Ramamoorthy, “Communication Complexity of Entanglement-Assisted Multi-Party Computation”, Entropy, 26:11 (2024), 896
Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G.S.L. Brandão, Patrick Hayden, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, 476
Alexander A. Sherstov, Andrey A. Storozhenko, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, 433
Anna Gál, Ridwan Syed, “Upper Bounds on Communication in Terms of Approximate Rank”, Theory Comput Syst, 2023