273 citations to 10.1016/0304-3975(92)90260-M (Crossref Cited-By Service)
  1. Andris Ambainis, Encyclopedia of Algorithms, 2015, 1  crossref
  2. Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016, 371  crossref
  3. Sudipto Guha, Andrew McGregor, 5125, Automata, Languages and Programming, 2008, 760  crossref
  4. J. Korner, A. Orlitsky, “Zero-error information theory”, IEEE Trans. Inform. Theory, 44, no. 6, 1998, 2207  crossref
  5. Alexander A. Sherstov, “The unbounded-error communication complexity of symmetric functions”, Combinatorica, 31, no. 5, 2011, 583  crossref
  6. Alexander A. Sherstov, “Separating ${AC}^0$ from Depth-2 Majority Circuits”, SIAM J. Comput., 38, no. 6, 2009, 2113  crossref
  7. Mert Saglam, Gabor Tardos, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, 678  crossref
  8. Eyal Kushilevitz, Enav Weinreb, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, 63  crossref
  9. Amir Abboud, Vincent Cohen-Addad, Philip N. Klein, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 996  crossref
  10. Gábor Braun, Sebastian Pokutta, “Common Information and Unique Disjointness”, Algorithmica, 76, no. 3, 2016, 597  crossref
Previous
1
2
3
4
5
6
28
Next