Author:
Draisma Jan,Kushilevitz Eyal,Weinreb Enav
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. M. Ajtai, T.S. Jayram, R. Kumar, D. Sivakumar, Approximate counting of inversions in a data stream, in: STOC, 2002, pp. 370–379.
2. The space complexity of approximating the frequency moments;Alon;J. Comput. Syst. Sci.,1999
3. L. Babai, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, in: Proc. of the 21st ACM Symp. on the Theory of Computing, 1989, pp. 1–11.
4. An information statistics approach to data stream and communication complexity;Bar-Yossef;J. Comput. Syst. Sci.,2004
5. Algebraic Complexity Theory;Bürgisser,1997
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献