Madhav Jha, Sofya Raskhodnikova, “Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy”, SIAM J. Comput., 42, no. 2, 2013, 700
Sudipto Guha, Piotr Indyk, Andrew McGregor, 4539, Learning Theory, 2007, 424
R. Jain, J. Radhakrishnan, Sen P, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, 220
Amit Chakrabarti, Oded Regev, “An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance”, SIAM J. Comput., 41, no. 5, 2012, 1299
François Le Gall, Daiki Suruga, 13568, LATIN 2022: Theoretical Informatics, 2022, 641
H. Buhrman, R. Cleve, R. De Wolf, C. Zalka, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 358
François Le Gall, Frédéric Magniez, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018, 337
R. Shaltiel, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 107
Rahul Jain, Shengyu Zhang, “New bounds on classical and quantum one-way communication complexity”, Theoretical Computer Science, 410, no. 26, 2009, 2463
Keren Censor-Hillel, Michal Dory, “Fast distributed approximation for TAP and 2-edge-connectivity”, Distrib. Comput., 33, no. 2, 2020, 145