Krishnamoorthy Dinesh, Jayalal Sarma, “Sensitivity, affine transforms and quantum communication complexity”, Theoretical Computer Science, 838 (2020), 68
Kol G., Moran Sh., Shpilka A., Yehudayoff A., “Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound”, Comput. Complex., 28:1 (2019), 1–25
Chattopadhyay A., Mande N.S., Sherif S., “The Log-Approximate-Rank Conjecture Is False”, Proceedings of the 51St Annual Acm Sigact Symposium on Theory of Computing (Stoc `19), Annual Acm Symposium on Theory of Computing, eds. Charikar M., Cohen E., Assoc Computing Machinery, 2019, 42–53
Krishnamoorthy Dinesh, Jayalal Sarma, Lecture Notes in Computer Science, 11653, Computing and Combinatorics, 2019, 140
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