Author:
Bury Marc,Schwiegelshohn Chris
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Lecture Notes in Computer Science;K. Ahn,2009
2. Ahn, K., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: SODA, pp. 459–467 (2012)
3. Ahn, K., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: PODS, pp. 5–14 (2012)
4. Lecture Notes in Computer Science;K. Ahn,2013
5. Assadi, S., Khanna, S., Li, Y., Yaroslavtsev, G.: Tight bounds for linear sketches of approximate matchings. CoRR, abs/1505.01467 (2015)
Cited by
24 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. Improved Bounds for Matching in Random-Order Streams;Theory of Computing Systems;2023-12-12
3. 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
4. (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Streaming Euclidean MST to a Constant Factor;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02