Turnstile streaming algorithms might as well be linear sketches-Reference-Cited by-同舟云学术

Turnstile streaming algorithms might as well be linear sketches

Published:2014-05-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-sixth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Li Yi¹,Nguyen Huy L.²,Woodruff David P.³

Affiliation:

1. Max-Planck Institute for Informatics

2. Princeton University

3. IBM Research, Almaden

Funder

Division of Computing and Communication Foundations

Siebel Scholarship

International Business Machines Corporation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2591796.2591812

Reference39 articles.

1. The Space Complexity of Approximating the Frequency Moments

2. A. Andoni. High frequency moment via max stability. Available at http://web.mit.edu/andoni/www/papers/fkStable.pdf. A. Andoni. High frequency moment via max stability. Available at http://web.mit.edu/andoni/www/papers/fkStable.pdf.

3. Streaming Algorithms via Precision Sampling

4. Tight Lower Bound for Linear Sketches of Moments

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Multi-pass Lower Bounds for MST in Dynamic Streams;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Sketching Approximability of All Finite CSPs;Journal of the ACM;2024-04-12

3. Krylov Methods are (nearly) Optimal for Low-Rank Approximation;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Enhancing Visibility in Nighttime Haze Images Using Guided APSF and Gradient Adaptive Convolution;Proceedings of the 31st ACM International Conference on Multimedia;2023-10-26