https://hackerpaper.kaipfister.de/p/2304.09331/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=37829948urn:hackerpapers:mention:2304.09331:37829948Tue, 10 Oct 2023 09:09:45 GMT<p>This left me wondering if there might be a deterministic parallel algorithm for union find :) I did find this arxiv paper from April which claims to have one: https://arxiv.org/abs/2304.09331 My understanding is that they process batches of edges at a time. If they &quot;conflict&quot; (meaning they want to do different things to the data structure) then they&#x27;re processed in serial, otherwise all edges in the batch are handled sequentially. They provide a bound on how often edges should conflict, and use that to show the complexity.</p><p><a href="https://hackerpaper.kaipfister.de/p/2304.09331/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS