Non-Blocking Doubly-Linked Lists with Good Amortized Complexity · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1408.1935/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTNon-Blocking Doubly-Linked Lists with Good Amortized Complexity — HN submissionhttps://news.ycombinator.com/item?id=8783403urn:hackerpapers:submission:1408.1935:8783403Mon, 22 Dec 2014 15:32:04 GMT<p>Non-Blocking Doubly-Linked Lists with Good Amortized Complexity</p><p></p><p>1 point; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1408.1935/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DCNon-Blocking Doubly-Linked Lists with Good Amortized Complexity — HN submissionhttps://news.ycombinator.com/item?id=8162719urn:hackerpapers:submission:1408.1935:8162719Mon, 11 Aug 2014 10:21:32 GMT<p>Non-Blocking Doubly-Linked Lists with Good Amortized Complexity</p><p></p><p>25 points; 1 discussion reply on HN. <a href="https://hackerpaper.kaipfister.de/p/1408.1935/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DC