<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Splay-List: A Distribution-Adaptive Concurrent Skip-List · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2008.01009/</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/2008.01009/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Splay-List: A Distribution-Adaptive Concurrent Skip-List — mentioned by mncharity</title><link>https://news.ycombinator.com/item?id=41852254</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.01009:41852254</guid><pubDate>Tue, 15 Oct 2024 19:32:15 GMT</pubDate><description>&lt;p&gt;Vitaly Aksenov (an author) gave a Google Tech Talk in July: Is it possible to make self-adjusting data structures concurrent?[1]. I didn&amp;#x27;t find paper-associated code. Fwiw, there&amp;#x27;s an earlier 2020 Aksenov splay-list paper with a repo.[2] Authors&amp;#x27; 2024 The Next 700 Benchmarking Frameworks for Concurrent Data Structures is inaccessible (ACM paywall), but 2023 Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures[3] looks cute. Aksenov has a home page[4] with pre-2024 pdfs. I didn&amp;#x27;t see homes for the other authors. [1] https://www.youtube.com/watch?v=A7DaSVMm0To [2]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.01009/"&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>
