Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
暂无分享,去创建一个
Ronitt Rubinfeld | Mohsen Ghaffari | Themis Gouleakis | Slobodan Mitrovic | R. Rubinfeld | M. Ghaffari | Slobodan Mitrovic | Themis Gouleakis
[1] Boaz Patt-Shamir,et al. The round complexity of distributed sorting: extended abstract , 2011, PODC '11.
[2] Sriram V. Pemmaraju,et al. Lessons from the Congested Clique applied to MapReduce , 2015, Theor. Comput. Sci..
[3] Sriram V. Pemmaraju,et al. Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST , 2015, PODC.
[4] Janne H. Korhonen. Deterministic MST Sparsification in the Congested Clique , 2016, ArXiv.
[5] Andrew Berns,et al. Super-Fast Distributed Algorithms for Metric Facility Location , 2012, ICALP.
[6] Boaz Patt-Shamir,et al. MST construction in O(log log n) communication rounds , 2003, SPAA '03.
[7] Sudipto Guha,et al. Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints , 2015, SPAA.
[8] Danupon Nanongkai,et al. Distributed approximation algorithms for weighted shortest paths , 2014, STOC.
[9] Sriram V. Pemmaraju,et al. Near-Constant-Time Distributed Algorithms on a Congested Clique , 2014, DISC.
[10] Leonid Barenboim,et al. The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[11] Ivan Rapaport,et al. Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast , 2015, PODC.
[12] Fabian Kuhn,et al. On the power of the congested clique model , 2014, PODC.
[13] Alexandr Andoni,et al. Parallel algorithms for geometric graph problems , 2013, STOC.
[14] Tomasz Jurdzinski,et al. MST in O(1) Rounds of Congested Clique , 2018, SODA.
[15] Manuela Fischer,et al. Tight Analysis of Parallel Randomized Greedy MIS , 2017, SODA.
[16] Scott Shenker,et al. Spark: Cluster Computing with Working Sets , 2010, HotCloud.
[17] Krzysztof Onak,et al. Round compression for parallel matching algorithms , 2017, STOC.
[18] Sudipto Guha,et al. Correlation Clustering in Data Streams , 2015, ICML.
[19] Boaz Patt-Shamir,et al. Distributed approximate matching , 2007, PODC '07.
[20] Silvio Lattanzi,et al. Filtering: a method for solving graph problems in MapReduce , 2011, SPAA '11.
[21] Sepehr Assadi,et al. Randomized Composable Coresets for Matching and Vertex Cover , 2017, SPAA.
[22] Mohsen Ghaffari. Distributed MIS via All-to-All Communication , 2017, PODC.
[23] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[24] Christoph Lenzen,et al. Algebraic methods in the congested clique , 2015, Distributed Computing.
[25] Guy E. Blelloch,et al. Greedy sequential maximal independent set and matching are parallel on average , 2012, SPAA '12.
[26] Nathan Linial,et al. Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[27] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[28] Amos Israeli,et al. An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..
[29] Mohammad Taghi Hajiaghayi,et al. Brief Announcement: Semi-MapReduce Meets Congested Clique , 2018, ArXiv.
[30] Yuan Yu,et al. Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.
[31] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[32] Boaz Patt-Shamir,et al. The Round Complexity of Distributed Sorting , 2011 .
[33] Gregory Schwartzman,et al. Derandomizing local distributed algorithms under bandwidth restrictions , 2016, Distributed Computing.
[34] Monika Henzinger,et al. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths , 2015, STOC.
[35] Alon Itai,et al. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..
[36] Vahab S. Mirrokni,et al. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs , 2017, SODA.
[37] Mohsen Ghaffari,et al. An Improved Distributed Algorithm for Maximal Independent Set , 2015, SODA.
[38] Merav Parter,et al. MST in Log-Star Rounds of Congested Clique , 2016, PODC.
[39] Christoph Lenzen,et al. Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.
[40] Christoph Lenzen,et al. "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.
[41] Sergei Vassilvitskii,et al. A model of computation for MapReduce , 2010, SODA '10.
[42] Qin Zhang,et al. Sorting, Searching, and Simulation in the MapReduce Framework , 2011, ISAAC.
[43] Tom White,et al. Hadoop: The Definitive Guide , 2009 .
[44] Sepehr Assadi. Simple Round Compression for Parallel Vertex Cover , 2017, ArXiv.
[45] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.