Author:
Brandt Sebastian,Fischer Manuela,Uitto Jara
Publisher
Springer International Publishing
Reference38 articles.
1. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)
2. Andoni, A., Stein, C., Song, Z., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In: The Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 674–685 (2018)
3. Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 574–583 (2014)
4. Assadi, S., Sun, X., Weinstein, O.: Massively parallel algorithms for finding well-connected components in sparse graphs. arXiv e-prints (2018)
5. Assadi, S.: Simple round compression for parallel vertex cover. arXiv preprint: 1709.04599 (2017). http://arxiv.org/abs/1709.04599
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Time-optimal construction of overlay networks;Distributed Computing;2023-02-15
3. Time-Optimal Construction of Overlay Networks;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21
4. Massively Parallel Algorithms for Minimum Cut;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31
5. Unconditional Lower Bounds for Adaptive Massively Parallel Computation;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06