Author:
Coppersmith Don,Raghavan Prabhakar,Tompa Martin
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
2. Tight Analysis of Parallel Randomized Greedy MIS;ACM Transactions on Algorithms;2020-01-11
3. Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers;The 31st ACM Symposium on Parallelism in Algorithms and Architectures;2019-06-17
4. Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23
5. On the Average Case Complexity of Some P-complete Problems;RAIRO - Theoretical Informatics and Applications;1999-01