Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra, “Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs”, SIAM J. Comput., 51:2 (2022), STOC17-305
Frédéric Magniez, Ashwin Nayak, “Quantum Distributed Complexity of Set Disjointness on a Line”, ACM Trans. Comput. Theory, 14:1 (2022), 1
Marcel Dall'Agnol, Tom Gur, Subhayan Roy Moulik, Justin Thaler, “Quantum Proofs of Proximity”, Quantum, 6 (2022), 834
François Le Gall, Daiki Suruga, Lecture Notes in Computer Science, 13568, LATIN 2022: Theoretical Informatics, 2022, 641
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