Author:
Lee Troy,Leonardos Nikos,Saks Michael,Wang Fengming
Funder
Singapore National Research Foundation
NSF
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference33 articles.
1. Lower bounds for one-way probabilistic communication complexity and their application to space complexity;Ablayev;Theor. Comput. Sci.,1996
2. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs;Babai;J. Comput. Syst. Sci.,1992
3. Information theory methods in communication complexity;Bar-Yossef,2002
4. An information statistics approach to data stream and communication complexity;Bar-Yossef;J. Comput. Syst. Sci.,2004
5. Multiparty communication complexity and threshold circuit size of AC0;Beame,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献