Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin, 13892, Structural Information and Communication Complexity, 2023, 427
Hartmut Klauck, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 189
Changsheng Wang, Xudong Wu, Penghui Yao, “Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model”, SPIN, 11, no. 03, 2021, 2140007
Ronald de Wolf, “Nondeterministic Quantum Query and Communication Complexities”, SIAM J. Comput., 32, no. 3, 2003, 681
Fabian Kuhn, Thomas Locher, Stefan Schmid, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008, 15
Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah, 7434, Computing and Combinatorics, 2012, 458
Gopal Pandurangan, Peter Robinson, Michele Scquizzato, “A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees”, ACM Trans. Algorithms, 16, no. 1, 2020, 1
Thomas Watson, “Communication Complexity with Small Advantage”, comput. complex., 29, no. 1, 2020, 2
Mika Göös, Toniann Pitassi, “Communication Lower Bounds via Critical Block Sensitivity”, SIAM J. Comput., 47, no. 5, 2018, 1778
Juraj Hromkovič, 2264, Stochastic Algorithms: Foundations and Applications, 2001, 1