The Distributed Complexity of Large-scale Graph Processing

[1]  Graham Cormode,et al.  Robust lower bounds for communication and stream computation , 2008, Theory Comput..

[2]  Din J. Wasem,et al.  Mining of Massive Datasets , 2014 .

[3]  Danupon Nanongkai,et al.  Distributed approximation algorithms for weighted shortest paths , 2014, STOC.

[4]  David P. Woodruff,et al.  When distributed computation is communication expensive , 2013, Distributed Computing.

[5]  Jennifer Widom,et al.  GPS: a graph processing system , 2013, SSDBM.

[6]  Mark Braverman,et al.  From information to exact communication , 2013, STOC '13.

[7]  M. G. Lattanzi,et al.  The APACHE Project , 2013, 1303.1275.

[8]  Isabelle Stanton,et al.  Streaming Balanced Graph Partitioning for Random Graphs , 2012, ArXiv.

[9]  Gabriel Kliot,et al.  Streaming graph partitioning for large distributed graphs , 2012, KDD.

[10]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[11]  Kang-Won Lee,et al.  Minimum congestion mapping in a cloud , 2011, PODC '11.

[12]  Silvio Lattanzi,et al.  Filtering: a method for solving graph problems in MapReduce , 2011, SPAA '11.

[13]  Toniann Pitassi,et al.  The story of set disjointness , 2010, SIGA.

[14]  Joseph M. Hellerstein,et al.  GraphLab: A New Framework For Parallel Machine Learning , 2010, UAI.

[15]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[16]  Jimmy J. Lin,et al.  Book Reviews: Data-Intensive Text Processing with MapReduce by Jimmy Lin and Chris Dyer , 2010, CL.

[17]  Sergei Vassilvitskii,et al.  A model of computation for MapReduce , 2010, SODA '10.

[18]  Danupon Nanongkai,et al.  Fast distributed random walks , 2009, PODC '09.

[19]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[20]  Sandeep Sen,et al.  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.

[21]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[22]  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..

[23]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[24]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[25]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[26]  Pierre Kelsen,et al.  On the parallel complexity of computing a maximal independent set in a hypergraph , 1992, STOC '92.

[27]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[28]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[29]  Peter Frankl,et al.  Complexity classes in communication complexity theory (preliminary version) , 1986, IEEE Annual Symposium on Foundations of Computer Science.

[30]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.