<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Exact String Matching Problem: a Comprehensive Experimental Evaluation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1012.2547/</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/1012.2547/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Exact String Matching Problem: a Comprehensive Experimental Evaluation — mentioned by MrYellowP</title><link>https://news.ycombinator.com/item?id=24565634</link><guid isPermaLink="false">urn:hackerpapers:mention:1012.2547:24565634</guid><pubDate>Wed, 23 Sep 2020 11:23:09 GMT</pubDate><description>&lt;p&gt;Ruban shared links that lead to dead ends, but I&amp;#x27;ve found the document talking about EPSM. https://arxiv.org/pdf/1012.2547v1.pdf It contains lots of benchmark results, but I don&amp;#x27;t understand how they can be useful for me, as I can&amp;#x27;t reproduce their way of benchmarking or how big the haystack really is. In fact, I don&amp;#x27;t really understand any of this. What&amp;#x27;s making matters worse, HyperScan has no binary for windows. I&amp;#x27;d have to compile it myself, using cygwin. I can&amp;#x27;t find a precompiled binary. It irritates me that there is no easily available windows version for what&amp;#x27;s supposed to be the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1012.2547/"&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>
