Superlinear Lower Bounds for Multipass Graph Processing
暂无分享,去创建一个
[1] Ran Raz,et al. Probabilistic communication complexity of Boolean relations , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[3] Leah Epstein,et al. Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model , 2009, SIAM J. Discret. Math..
[4] A. Kemper,et al. On Graph Problems in a Semi-streaming Model , 2015 .
[5] A. Razborov. Communication Complexity , 2011 .
[6] Ashish Goel,et al. On the communication and streaming complexity of maximum bipartite matching , 2012, SODA.
[7] Graham Cormode,et al. Robust lower bounds for communication and stream computation , 2008, Theory Comput..
[8] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[9] Jaikumar Radhakrishnan,et al. Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.
[11] Andrew Chi-Chih Yao,et al. Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Mariano Zelke,et al. Weighted Matching in the Semi-Streaming Model , 2007, Algorithmica.
[13] Noam Nisan,et al. Rounds in communication complexity revisited , 1991, STOC '91.
[14] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[15] Iordanis Kerenidis,et al. Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[16] Iordanis Kerenidis,et al. Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, SIAM J. Comput..
[17] Anand Srivastav,et al. Bipartite Matching in the Semi-streaming Model , 2012, Algorithmica.
[18] Ran Raz,et al. Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) , 1989, IEEE Annual Symposium on Foundations of Computer Science.
[19] Mikhail Kapralov. Improved lower bounds for matchings in the streaming model , 2012, ArXiv.
[20] Rahul Jain,et al. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity , 2012, Algorithmica.
[21] Claire Mathieu,et al. Maximum Matching in Semi-streaming with Few Passes , 2011, APPROX-RANDOM.
[22] Mikhail Kapralov,et al. Better bounds for matchings in the streaming model , 2012, SODA.
[23] Sudipto Guha,et al. Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams , 2009, SIAM J. Comput..
[24] Joan Feigenbaum,et al. Graph Distances in the Data-Stream Model , 2008, SIAM J. Comput..
[25] Mark Braverman,et al. A Discrepancy Lower Bound for Information Complexity , 2015, Algorithmica.
[26] Braverman Mark,et al. A Discrepancy Lower Bound for Information Complexity , 2012 .
[27] Rahul Jain,et al. A direct product theorem for bounded-round public-coin randomized communication complexity , 2012, ArXiv.
[28] Jaikumar Radhakrishnan,et al. The Communication Complexity of Pointer Chasing , 2001, J. Comput. Syst. Sci..
[29] Jaikumar Radhakrishnan,et al. A Direct Sum Theorem in Communication Complexity via Message Compression , 2003, ICALP.
[30] J. Feigenbaum,et al. Graph Distances in the DataStream Model , 2015 .
[31] Sudipto Guha,et al. Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination , 2008, ICALP.
[32] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[33] Jirí Sgall,et al. Some bounds on multiparty communication complexity of pointer jumping , 1998, computational complexity.
[34] Venkatesan Guruswami,et al. Superlinear Lower Bounds for Multipass Graph Processing , 2013, Computational Complexity Conference.
[35] Mark Braverman,et al. Information Equals Amortized Communication , 2011, IEEE Transactions on Information Theory.
[36] Sreenivas Gollapudi,et al. Estimating PageRank on graph streams , 2008, PODS.
[37] Xi Chen,et al. How to compress interactive communication , 2010, STOC '10.
[38] Prabhakar Raghavan,et al. Computing on data streams , 1999, External Memory Algorithms.
[39] Leah Epstein,et al. Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model , 2010, STACS.
[40] Mark Braverman. Interactive information complexity , 2012, STOC '12.
[41] Amit Chakrabarti,et al. Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming , 2012, APPROX-RANDOM.
[42] Sudipto Guha,et al. Linear programming in the semi-streaming model with application to the maximum matching problem , 2011, Inf. Comput..