Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. Network decomposition and locality in distributed computation;Awerbuch,1989
2. A fast and simple randomized parallel algorithm for the maximal indepedent set problem;Alon;J. Algorithms,1986
3. Simulating (logc n)-wise independence in NC;Berger,1989
4. Parallel merge sort;Cole;SIAM J. Comput.,1988
5. Parallelism in random access machines;Fortune,1978
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Brief Announcement: Massively Parallel Ruling Set Made Deterministic;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27
3. Deterministic Massively Parallel Connectivity;SIAM Journal on Computing;2023-10-27
4. Node and edge averaged complexities of local graph problems;Distributed Computing;2023-07-05
5. Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17