Keren Censor-Hillel, Michal Dory, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018, 139
Troy Lee, Gideon Schechtman, Adi Shraibman, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 254
Sepehr Assadi, Yu Chen, Sanjeev Khanna, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 265
Mika Göös, Thomas Watson, “A Lower Bound for Sampling Disjoint Sets”, ACM Trans. Comput. Theory, 12, no. 3, 2020, 1
A. Ambainis, H. Buhrman, W. Gasarch, B. Kalyanasundaram, L. Torenvliet, Proceedings 15th Annual IEEE Conference on Computational Complexity, 2000, 44
Andris Ambainis, “Superlinear Advantage for Exact Quantum Algorithms”, SIAM J. Comput., 45, no. 2, 2016, 617
Benjamin Plaut, Tim Roughgarden, “Communication Complexity of Discrete Fair Division”, SIAM J. Comput., 49, no. 1, 2020, 206
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 389
Troy Lee, Adi Shraibman, “Around the log-rank conjecture”, Isr. J. Math., 256, no. 2, 2023, 441
Hartmut Klauck, 3328, FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004, 384