<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Approaching Optimal Duplicate Detection in a Sliding Window · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2005.04740/</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/2005.04740/feed.xml" rel="self" type="application/rss+xml" /><item><title>Approaching Optimal Duplicate Detection in a Sliding Window — HN submission</title><link>https://news.ycombinator.com/item?id=23732981</link><guid isPermaLink="false">urn:hackerpapers:submission:2005.04740:23732981</guid><pubDate>Sat, 04 Jul 2020 15:38:51 GMT</pubDate><description>&lt;p&gt;Approaching Optimal Duplicate Detection in a Sliding Window [pdf]&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/2005.04740/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
