| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Connectivity Lower Bounds in Broadcast Congested Clique | Pai, Shreyas et al. | 2020 |
| 2 | Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model | Kothapalli, Kishore et al. | 2020 |
| 3 | The Complexity of Symmetry Breaking in Massive Graphs | Konrad, Christian et al. | 2019 |
| 4 | Large-Scale Distributed Algorithms for Facility Location with Outliers | Inamdar, Tanmay et al. | 2018 |
| 5 | Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets | Pai, Shreyas et al. | 2017 |
| 6 | Using Read-k Inequalities to Analyze a Distributed MIS Algorithm | Pemmaraju, Sriram et al. | 2017 |
| 7 | Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages | Pemmaraju, Sriram V. et al. | 2016 |
| 8 | Super-Fast 3-Ruling Sets | Kothapalli, Kishore et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |