Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
暂无分享,去创建一个
[1] A. Razborov. Communication Complexity , 2011 .
[2] Christoph Lenzen,et al. Algebraic methods in the congested clique , 2015, Distributed Computing.
[3] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[4] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[5] Jon Howell,et al. Flat Datacenter Storage , 2012, OSDI.
[6] Roger Wattenhofer,et al. Time Lower Bounds for Distributed Distance Oracles , 2014, OPODIS.
[7] Boaz Patt-Shamir,et al. The round complexity of distributed sorting: extended abstract , 2011, PODC '11.
[8] Sriram V. Pemmaraju,et al. Lessons from the Congested Clique applied to MapReduce , 2015, Theor. Comput. Sci..
[9] Hartmut Klauck,et al. The Distributed Complexity of Large-scale Graph Processing , 2013, ArXiv.
[10] Aart J. C. Bik,et al. Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.
[11] Christoph Lenzen,et al. Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique , 2014, ArXiv.
[12] Christoph Lenzen,et al. Efficient distributed source detection with limited bandwidth , 2013, PODC '13.
[13] Peter Frankl,et al. Complexity classes in communication complexity theory (preliminary version) , 1986, IEEE Annual Symposium on Foundations of Computer Science.
[14] Hartmut Klauck,et al. Distributed Computation of Large-scale Graph Problems , 2015, SODA.
[15] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[16] Marina Blanton,et al. Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.
[17] Noam Nisan,et al. Economic efficiency requires interaction , 2013, STOC.
[18] Christoph Lenzen,et al. Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.
[19] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[20] Danupon Nanongkai,et al. Distributed approximation algorithms for weighted shortest paths , 2014, STOC.
[21] Sriram V. Pemmaraju,et al. Near-Constant-Time Distributed Algorithms on a Congested Clique , 2014, DISC.
[22] Boaz Patt-Shamir,et al. MST construction in O(log log n) communication rounds , 2003, SPAA '03.
[23] Ami Paz,et al. Computing Exact Distances in the Congested Clique , 2014, ArXiv.
[24] Roger Wattenhofer,et al. Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.
[25] Fabian Kuhn,et al. On the power of the congested clique model , 2014, PODC.
[26] Stephan Holzer. Distance computation, information dissemination, and wireless capacity in networks , 2014 .
[27] Roger Wattenhofer,et al. Networks cannot compute their diameter in sublinear time , 2012, SODA.
[28] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[29] Roger Wattenhofer,et al. Principles of Distributed Computing , 2014 .
[30] 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..