Author:
Kerenidis Iordanis,Laurière Mathieu,Xiao David
Publisher
Springer International Publishing
Reference22 articles.
1. Ada, A., Chattopadhyay, A., Cook, S., Fontes, L., Koucký, M., Pitassi, T.: The Hardness of Being Private. In: 27th Annual IEEE Conference on Computational Complexity, CCC’12, pp. 192–202 (2012)
2. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: Proceedings of the 42nd STOC, pp. 67–76 (2010)
3. Brody, J., Buhrman, H., Koucky, M., Loff, B., Speelman, F., Vereshchagin, N.: Towards a reverse Newman’s theorem in interactive information complexity, CCC (2013)
4. Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication, In: STOC, pp. 151–160 (2013)
5. Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: Information lower bounds via self-reducibility. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 183–194. Springer, Heidelberg (2013)