273 citations to 10.1016/0304-3975(92)90260-M (Crossref Cited-By Service)
  1. Madhav Jha, Sofya Raskhodnikova, “Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy”, SIAM J. Comput., 42, № 2, 2013, 700  crossref
  2. Sudipto Guha, Piotr Indyk, Andrew McGregor, 4539, Learning Theory, 2007, 424  crossref
  3. R. Jain, J. Radhakrishnan, Sen P, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, 220  crossref
  4. Amit Chakrabarti, Oded Regev, “An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance”, SIAM J. Comput., 41, № 5, 2012, 1299  crossref
  5. François Le Gall, Daiki Suruga, 13568, LATIN 2022: Theoretical Informatics, 2022, 641  crossref
  6. H. Buhrman, R. Cleve, R. De Wolf, C. Zalka, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 358  crossref
  7. François Le Gall, Frédéric Magniez, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018, 337  crossref
  8. R. Shaltiel, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 107  crossref
  9. Rahul Jain, Shengyu Zhang, “New bounds on classical and quantum one-way communication complexity”, Theoretical Computer Science, 410, № 26, 2009, 2463  crossref
  10. Keren Censor-Hillel, Michal Dory, “Fast distributed approximation for TAP and 2-edge-connectivity”, Distrib. Comput., 33, № 2, 2020, 145  crossref
Предыдущая
1
14
15
16
17
18
19
20
28
Следующая