Funder
Science and Technology Commission of Shanghai Municipality
National Natural Science Foundation of China
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference37 articles.
1. Ahn, K.J., Guha, S.: Laminar families and metric embeddings: non-bipartite maximum matching problem in the semi-streaming model. CoRR arXiv:1104.4058 (2011)
2. Ahn, K.J., Guha, S.: Linear programming in the semi-streaming model with application to the maximum matching problem. Inf. Comput. 222, 59–79 (2013)
3. Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’12, pp. 459–467 (2012)
4. Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS’12, pp. 5–14 (2012)
5. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nearly Optimal Communication and Query Complexity of Bipartite Matching;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. The communication complexity of multiparty set disjointness under product distributions;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15