Author:
Brody Joshua,Chakrabarti Amit,Kondapally Ranganath,Woodruff David P.,Yaroslavtsev Grigory
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference51 articles.
1. Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theor. Comput. Sci. 175(2), 139–159 (1996)
2. Ada, A., Chattopadhyay, A., Cook, S.A., Fontes, L., Koucký, M., Pitassi, T.: The hardness of being private. ACM Trans. Comput. Theory 6(1), 1:1–1:24 (2014)
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. System Sci. 58(1), 137–147 (1999). Preliminary version. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 20–29 (1996)
4. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702–732 (2004)
5. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. SIAM J. Comput. 42(3), 1327–1363 (2013). Preliminary version. In: Proceedings of the 41st Annual ACM Symposium on the Theory of Computing, pp. 67–76 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献