Publisher
Society for Industrial and Applied Mathematics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Streaming Euclidean k-median and k-means with o(log n) Space;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. A Framework for Adversarially Robust Streaming Algorithms;Journal of the ACM;2022-01-31
3. Three‐wise independent random walks can be slightly unbounded;Random Structures & Algorithms;2022-01-03
4. Approximate Set Union via Approximate Randomization;Lecture Notes in Computer Science;2020
5. Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019