273 citations to 10.1016/0304-3975(92)90260-M (Crossref Cited-By Service)
  1. Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi, “Communication Requirements and Informative Signaling in Matching Markets”, SSRN Journal, 2017  crossref
  2. Harry Buhrman, Richard Cleve, Serge Massar, Ronald de Wolf, “Nonlocality and communication complexity”, Rev. Mod. Phys., 82, no. 1, 2010, 665  crossref
  3. Ying Yan, Jiaxing Zhang, Bojun Huang, Xuzhan Sun, Jiaqi Mu, Zheng Zhang, Thomas Moscibroda, Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015, 3  crossref
  4. Henning Wunderlich, “On a Theorem of Razborov”, comput. complex., 21, no. 3, 2012, 431  crossref
  5. Sudipto Guha, Piotr Indyk, Andrew McGregor, “Sketching information divergences”, Mach Learn, 72, no. 1-2, 2008, 5  crossref
  6. Jeff M. Phillips, Elad Verbin, Qin Zhang, “Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy”, SIAM J. Comput., 45, no. 1, 2016, 174  crossref
  7. Dmitry Gavinsky, “Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity”, IEEE Trans. Inform. Theory, 67, no. 10, 2021, 6583  crossref
  8. Alexander A. Sherstov, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 64  crossref
  9. Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi, “On the Parameterized Complexity of Approximating Dominating Set”, J. ACM, 66, no. 5, 2019, 1  crossref
  10. Mark Braverman, “Interactive Information Complexity”, SIAM J. Comput., 44, no. 6, 2015, 1698  crossref
Previous
1
9
10
11
12
13
14
15
28
Next