Wang Ch., Wu X., Yao P., “Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum Congest Model”, SPIN, 11:03 (2021), 2140007
Sherstov A.A., “The Hardest Halfspace”, Comput. Complex., 30:2 (2021), 11
Anna Gál, Ridwan Syed, Lecture Notes in Computer Science, 12730, Computer Science – Theory and Applications, 2021, 116
Chattopadhyay A., Mande N.S., Sherif S., “The Log-Approximate-Rank Conjecture Is False”, J. ACM, 67:4 (2020), 23
Goos M., Watson T., “A Lower Bound For Sampling Disjoint Sets”, ACM Trans. Comput. Theory, 12:3 (2020), 20
Sherstov A.A., “Algorithmic Polynomials”, SIAM J. Comput., 49:6 (2020), 1173–1231
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