1. Dan Alistarh Alexander Fedorov and Nikita Koval. 2019. In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs/1911.06347 (2019). arXiv:1911.06347 http://arxiv.org/abs/1911.06347 Dan Alistarh Alexander Fedorov and Nikita Koval. 2019. In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs/1911.06347 (2019). arXiv:1911.06347 http://arxiv.org/abs/1911.06347
2. Wait-free parallel algorithms for the union-find problem
3. David A. Bader and Paul Burkhardt . 2019 . A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges. CoRR abs/1908.03473 (2019). arXiv:1908.03473 http://arxiv.org/abs/1908.03473 David A. Bader and Paul Burkhardt. 2019. A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges. CoRR abs/1908.03473 (2019). arXiv:1908.03473 http://arxiv.org/abs/1908.03473
4. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (extended abstract )
5. On the Architectural Requirements for Efficient Execution of Graph Algorithms