Mihai Ptraşcu, “Unifying the Landscape of Cell-Probe Lower Bounds”, SIAM J. Comput., 40, no. 3, 2011, 827
Alexander A. Sherstov, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 921
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 351
Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 646
Mark Braverman, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 505
Vladimir V. Podolskii, Alexander A. Sherstov, “Inner Product and Set Disjointness”, ACM Trans. Comput. Theory, 12, no. 4, 2020, 1
Aviad Rubinstein, Virginia Vassilevska Williams, “SETH vs Approximation”, SIGACT News, 50, no. 4, 2019, 57
Mark Braverman, Rotem Oshman, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015, 355
Andris Ambainis, Harry Buhrman, William Gasarch, Bala Kalyanasundaram, Leen Torenvliet, “The Communication Complexity of Enumeration, Elimination, and Selection”, Journal of Computer and System Sciences, 63, no. 2, 2001, 148
Mika Göös, Toniann Pitassi, Thomas Watson, “Query-to-Communication Lifting for BPP”, SIAM J. Comput., 49, no. 4, 2020, FOCS17-441