Mark Braverman, Ankur Moitra, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 161
Juraj Hromkovič, Georg Schnitger, “On probabilistic pushdown automata”, Information and Computation, 208, no. 8, 2010, 982
Itai Dinur, 12106, Advances in Cryptology – EUROCRYPT 2020, 2020, 433
Andris Ambainis, “Quantum Lower Bounds by Quantum Arguments”, Journal of Computer and System Sciences, 64, no. 4, 2002, 750
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 85
Gopal Pandurangan, David Peleg, Michele Scquizzato, “Message lower bounds via efficient network synchronization”, Theoretical Computer Science, 810, 2020, 82
Ronald de Wolf, “Quantum communication and complexity”, Theoretical Computer Science, 287, no. 1, 2002, 337
Orr Fischer, Rotem Oshman, “A distributed algorithm for directed minimum-weight spanning tree”, Distrib. Comput., 36, no. 1, 2023, 57
Vignesh Manoharan, Vijaya Ramachandran, 14662, Structural Information and Communication Complexity, 2024, 420
Siddharth Iyer, Anup Rao, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 652