<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Selection Algorithms with Small Groups · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1409.3600/</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/1409.3600/feed.xml" rel="self" type="application/rss+xml" /><item><title>Selection Algorithms with Small Groups — mentioned by danlark</title><link>https://news.ycombinator.com/item?id=41069150</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.3600:41069150</guid><pubDate>Thu, 25 Jul 2024 14:33:14 GMT</pubDate><description>&lt;p&gt;3 and 4 elements will fail to prove the complexity is linear You still can do 3 or 4 but with slight modifications https://arxiv.org/abs/1409.3600 For example, for 4 elements, it&amp;#x27;s advised to take lower median for the first half and upper median for the second half. Then the complexity will be linear&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.3600/"&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>
