Author:
Ahn Kook Jin,Guha Sudipto
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
2. Benczúr, A.A., Karger, D.R.: Approximating s-t minimum cuts in O(n2) time. In: STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 47–55. ACM, New York (1996)
3. Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 324–333. Society for Industrial and Applied Mathematics (1997)
4. Chernoff, H.: A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23, 493–509 (1952)
5. Demetrescu, C., Finocchi, I., Ribichini, A.: Trading off space for passes in graph streaming problems. In: SODA, pp. 714–723 (2006)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Additive Sparsification of CSPs;ACM Transactions on Algorithms;2023-11-13
2. Streaming Euclidean Max-Cut: Dimension vs Data Reduction;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Motif Cut Sparsifiers;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Sparsification of Binary CSPs;SIAM Journal on Discrete Mathematics;2020-01
5. Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time;ACM Transactions on Algorithms;2018-06-04