Hartmut Klauck, Robert Špalek, Ronald de Wolf, “Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs”, SIAM J. Comput., 36, no. 5, 2007, 1472
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 281
Taisuke IZUMI, “Distributed Graph Algorithms and their Complexity: An Introduction”, IIS, 21, no. 4, 2015, 351
Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, D. Sivakumar, “An information statistics approach to data stream and communication complexity”, Journal of Computer and System Sciences, 68, no. 4, 2004, 702
Andris Ambainis, Encyclopedia of Algorithms, 2008, 696
Shengyu Zhang, 6755, Automata, Languages and Programming, 2011, 49
Suman K. Bera, C. Seshadhri, Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, 457
Andris Ambainis, Encyclopedia of Algorithms, 2016, 1656
Mika Göös, Toniann Pitassi, Thomas Watson, “The Landscape of Communication Complexity Classes”, comput. complex., 27, no. 2, 2018, 245
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar, “Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond”, comput. complex., 31, no. 2, 2022, 9