1. Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
2. Dan Alistarh , Alexander Fedorov , and Nikita Koval . 2019 . In Search of the Fastest Concurrent Union-Find Algorithm. In 23rd International Conference on Principles of Distributed Systems, OPODIS 2019 , December 17-19, 2019, Neuchâtel, Switzerland (LIPIcs , Vol. 153), Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15:1--15: 16 . https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 10.4230/LIPIcs.OPODIS.2019.15 Dan Alistarh, Alexander Fedorov, and Nikita Koval. 2019. In Search of the Fastest Concurrent Union-Find Algorithm. In 23rd International Conference on Principles of Distributed Systems, OPODIS 2019, December 17-19, 2019, Neuchâtel, Switzerland (LIPIcs, Vol. 153), Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15:1--15:16. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15
3. Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
4. Internally deterministic parallel algorithms can be fast
5. Guy Blelloch , Jeremy Fineman , and Julian Shun . 2012a. Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR , Vol. abs/ 1202 .3205 (02 2012 ). https://doi.org/10.1145/2312005.2312058 10.1145/2312005.2312058 Guy Blelloch, Jeremy Fineman, and Julian Shun. 2012a. Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR, Vol. abs/1202.3205 (02 2012). https://doi.org/10.1145/2312005.2312058