Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang, “Graph Distances in the Data-Stream Model”, SIAM J. Comput., 38, no. 5, 2009, 1709
Alexander A. Sherstov, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 294
Anup Rao, Amir Yehudayoff, Communication Complexity, 2020
Mohammad Bavarian, Thomas Vidick, Henry Yuen, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 303
Amir Abboud, Aviad Rubinstein, Ryan Williams, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 25
Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 151
Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi, “Upper and Lower Bounds on the Power of Advice”, SIAM J. Comput., 45, no. 4, 2016, 1412
Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018, 153
Juraj Hromkovič, Georg Schnitger, “On the power of randomized multicounter machines”, Theoretical Computer Science, 330, no. 1, 2005, 135
Troy Lee, Adi Shraibman, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 351