Author:
Andoni Alexandr,Nguyễn Huy L.,Polyanskiy Yury,Wu Yihong
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Andoni, A., Krauthgamer, R., Onak, K.: Streaming algorithms from precision sampling. In: Proceedings of the Symposium on Foundations of Computer Science, FOCS (2011), Full version appears on arXiv:1011.1263
2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comp. Sys. Sci. 58, 137–147 (1999), Previously appeared in STOC 1996
3. Bar-Yossef, Z.: The complexity of massive data set computations. PhD thesis, UC Berkeley (2002)
4. Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 708–713 (2006)
5. 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)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Arithmetic Sketching;Advances in Cryptology – CRYPTO 2023;2023
3. On Approximating Matrix Norms in Data Streams;SIAM Journal on Computing;2019-01
4. Streaming symmetric norms via measure concentration;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
5. The Simultaneous Communication of Disjointness with Applications to Data Streams;Automata, Languages, and Programming;2015