<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>wCQ: A Fast Wait-Free Queue with Bounded Memory Usage · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.02179/</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/2201.02179/feed.xml" rel="self" type="application/rss+xml" /><item><title>wCQ: A Fast Wait-Free Queue with Bounded Memory Usage — mentioned by duped</title><link>https://news.ycombinator.com/item?id=48850509</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02179:48850509</guid><pubDate>Thu, 09 Jul 2026 18:37:52 GMT</pubDate><description>&lt;p&gt;This paper [0] from 2022 is pretty good. &amp;quot;Low complexity&amp;quot; it is not, though. [0] https://arxiv.org/pdf/2201.02179&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02179/"&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>
