Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Yao, A.C.C.: Some complexity questions related to distributive computing. In: 11th STOC, pp. 209–213 (1979)
2. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
3. Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.C.C.: Informational complexity and the direct sum problem for simultaneous message complexity. In: 42nd FOCS, pp. 270–278 (2001)
4. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to communication complexity and data streams. JCSS 68(4), 702–732 (2004)
5. Lipton, R., Sedgewick, R.: Lower bounds for VLSI. In: 13th STOC, pp. 300–307 (1981)