暂无分享,去创建一个
[1] Sudipto Guha,et al. Graph sketches: sparsification, spanners, and subgraphs , 2012, PODS.
[2] Sudipto Guha,et al. Graph Sparsification in the Semi-streaming Model , 2009, ICALP.
[3] Andrew Chi-Chih Yao. Lower bounds to randomized algorithms for graph properties , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[5] Ran Raz,et al. Exponential separations for one-way quantum communication complexity, with applications to cryptography , 2006, STOC '07.
[6] Seshadhri Comandur,et al. Combinatorial Approximation Algorithms for MaxCut using Random Walks , 2010, ICS.
[7] Alan M. Frieze,et al. The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[8] David P. Woodruff,et al. Spanners and sparsifiers in dynamic streams , 2014, PODC.
[9] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[10] Sudipto Guha,et al. Linear programming in the semi-streaming model with application to the maximum matching problem , 2011, Inf. Comput..
[11] Wei Yu,et al. The streaming complexity of cycle counting, sorting by reversals, and other problems , 2011, SODA '11.
[12] Ashish Goel,et al. On the communication and streaming complexity of maximum bipartite matching , 2012, SODA.
[13] R. Durrett. Random Graph Dynamics: References , 2006 .
[14] Claire Mathieu,et al. Yet another algorithm for dense max cut: go greedy , 2008, SODA '08.
[15] Rick Durrett,et al. Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics) , 2006 .
[16] Luca Trevisan,et al. Max cut and the smallest eigenvalue , 2008, STOC '09.
[17] Mikhail Kapralov,et al. Better bounds for matchings in the streaming model , 2012, SODA.
[18] Sudipto Guha,et al. Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints , 2015, SPAA.
[19] Sudipto Guha,et al. Analyzing graph structure via linear measurements , 2012, SODA.
[20] Jonathan A. Kelner,et al. Spectral Sparsification in the Semi-streaming Setting , 2012, Theory of Computing Systems.
[21] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.
[22] Wenceslas Fernandez de la Vega,et al. MAX-CUT has a randomized approximation scheme in dense graphs , 1996, Random Struct. Algorithms.
[23] Qin Zhang,et al. Communication Complexity of Approximate Maximum Matching in Distributed Graph Data , 2013 .
[24] Venkatesan Guruswami,et al. Superlinear Lower Bounds for Multipass Graph Processing , 2012, Algorithmica.
[25] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[26] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[27] Noga Alon,et al. Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..
[28] Robert Krauthgamer,et al. Sketching Cuts in Graphs and Hypergraphs , 2014, ITCS.
[29] Noga Alon,et al. The Space Complexity of Approximating the Frequency Moments , 1999 .