Author:
Ergun Funda,Jowhari Hossein,Sağlam Mert
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Alon, N., Matias, Y., Szegedy, M.: Space complexity of approximating the frequency moments. In: STOC 1996 (1996)
2. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: SODA 2000 (2000)
3. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling algorithms: lower bounds and applications. In: CCC 2002 (2002)
4. Berinde, R., Cormode, G., Indyk, P., Strauss, M.: Space-optimal heavy hitters with strong error bounds. In: PODS 2009 (2009)
5. Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: SODA 2006 (2006)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PeriodicSketch: Finding Periodic Items in Data Streams;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
2. Small-space and streaming pattern matching with $k$ edits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. Streaming k-mismatch with error correcting and applications;Information and Computation;2020-04
4. A Survey on Entropy and Economic Behaviour;Entropy;2020-01-29
5. Periodicity in Data Streams with Wildcards;Theory of Computing Systems;2019-12-20