Author:
Arackaparambil Chrisil,Brody Joshua,Chakrabarti Amit
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999);
2. Preliminary version In: Proc. 28th Annu. ACM Symp. Theory Comput., pp. 20–29 (1996)
3. Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proc. Annual ACM SIGMOD Conference, pp. 28–39 (2003)
4. Bhuvanagiri, L., Ganguly, S.: Estimating entropy over data streams. In: Proc. 14th Annual European Symposium on Algorithms, pp. 148–159 (2006)
5. Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1076–1085 (2008)
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Model Counting Meets
F
0
Estimation;ACM Transactions on Database Systems;2023-08-09
2. Towards Optimal Moment Estimation in Streaming and Distributed Models;ACM Transactions on Algorithms;2023-06-24
3. Model Counting meets F
0
Estimation;Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2021-06-20
4. Finding Persistent Items in Distributed Datasets;IEEE/ACM Transactions on Networking;2020-02
5. A survey of challenges for runtime verification from advanced application domains (beyond software);Formal Methods in System Design;2019-11