<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2302.03317/</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/2302.03317/feed.xml" rel="self" type="application/rss+xml" /><item><title>Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place — mentioned by orlp</title><link>https://news.ycombinator.com/item?id=40621111</link><guid isPermaLink="false">urn:hackerpapers:mention:2302.03317:40621111</guid><pubDate>Sun, 09 Jun 2024 00:38:04 GMT</pubDate><description>&lt;p&gt;I found another in-place approach which also does a higher-base version described here: https://arxiv.org/pdf/2302.03317, with an open source implementation: https://crates.io/crates/rip_shuffle. Might want to compare it with your version.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2302.03317/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
