<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bicriteria data compression · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1307.3872/</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/1307.3872/feed.xml" rel="self" type="application/rss+xml" /><item><title>Bicriteria data compression — mentioned by ot</title><link>https://news.ycombinator.com/item?id=7894945</link><guid isPermaLink="false">urn:hackerpapers:mention:1307.3872:7894945</guid><pubDate>Sun, 15 Jun 2014 10:25:07 GMT</pubDate><description>&lt;p&gt;It looks like the authors just looked at DEFLATE and tweaked it mainly by better engineering and taking into account modern hardware specifications (larger window size, ...), but largely ignoring the theoretical research that has been carried out on LZ77 in the last few years. For example a paper from last SODA [1] shows that by using a better optimization algorithm and just simple universal codes instead of Huffman, it is possible to beat zlib in space and compete with Snappy in decompression speed (and I&amp;#x27;m sure that the decoder can be further optimized). This is just the last one on the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1307.3872/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
