<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.04400/</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/2012.04400/feed.xml" rel="self" type="application/rss+xml" /><item><title>An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels — HN submission</title><link>https://news.ycombinator.com/item?id=25359330</link><guid isPermaLink="false">urn:hackerpapers:submission:2012.04400:25359330</guid><pubDate>Wed, 09 Dec 2020 15:17:59 GMT</pubDate><description>&lt;p&gt;An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2012.04400/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels — mentioned by NieDzejkob</title><link>https://news.ycombinator.com/item?id=25357380</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.04400:25357380</guid><pubDate>Wed, 09 Dec 2020 11:02:48 GMT</pubDate><description>&lt;p&gt;I haven&amp;#x27;t exactly read many this year, but I really liked &amp;quot;An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels&amp;quot; [1]. It describes many interesting algorithmic tricks to establish a lower bound for an easy to understand problem. Not exactly immediately practical, but still very interesting. Note that it has been published on arXiv just yesterday; I helped review an earlier draft. [1]: https://arxiv.org/abs/2012.04400&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.04400/"&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>
