<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Concurrent Disjoint Set Union · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2003.01203/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2003.01203/feed.xml" rel="self" type="application/rss+xml" /><item><title>Concurrent Disjoint Set Union — mentioned by moab</title><link>https://news.ycombinator.com/item?id=24762848</link><guid isPermaLink="false">urn:hackerpapers:mention:2003.01203:24762848</guid><pubDate>Tue, 13 Oct 2020 06:29:55 GMT</pubDate><description>&lt;p&gt;Yes, there&amp;#x27;s a few papers over the last few years on this, starting with this paper: https://www.cis.upenn.edu/~sanjeev/papers/soda14_disjoint_se... Here is a more recent paper (from this year) analyzing concurrent union find with random linking: https://arxiv.org/pdf/2003.01203.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2003.01203/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
