47 citations to 10.1016/0020-0190(93)90041-7 (Crossref Cited-By Service)
  1. R. Beigel, A. Maciel, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 149  crossref
  2. László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam, “Communication Complexity of Simultaneous Messages”, SIAM J. Comput., 33, no. 1, 2003, 137  crossref
  3. Vladimir V. Podolskii, Alexander A. Sherstov, “Inner Product and Set Disjointness”, ACM Trans. Comput. Theory, 12, no. 4, 2020, 1  crossref
  4. Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia, “On the relationship between energy complexity and other boolean function measures”, J Comb Optim, 43, no. 5, 2022, 1470  crossref
  5. Giancarlo Mauri, Alberto Leporati, 2747, Mathematical Foundations of Computer Science 2003, 2003, 92  crossref
  6. Emanuele Viola, Avi Wigderson, “One-way multiparty communication lower bound for pointer jumping with applications”, Combinatorica, 29, no. 6, 2009, 719  crossref
  7. Paul Beame, Trinh Huynh, “Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremathAC^0$”, SIAM J. Comput., 41, no. 3, 2012, 484  crossref
  8. Richard Beigel, Alexis Maciel, “Upper and lower bounds for some depth-3 circuit classes”, Comput Complexity, 6, no. 3, 1996, 235  crossref
  9. Emanuele Viola, “Guest Column”, SIGACT News, 40, no. 1, 2009, 27  crossref
  10. Emanuele Viola, Avi Wigderson, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007, 427  crossref
1
2
3
4
5
Next