Huffman's algorithm for computing minimum-redundancy prefix-free codes has almost
legendary status in the computing disciplines. Its elegant blend of simplicity and applicability …

The data structure at the core of large-scale search engines is the inverted index, which is
essentially a collection of sorted integer sequences called inverted lists. Because of the …

We propose the first practical learned lossless image compression system, L3C, and show
that it outperforms the popular engineered codecs, PNG, WebP and JPEG 2000. At the core …

Over recent years, deep learning-based computer vision systems have been applied to
images at an ever-increasing pace, oftentimes representing the only type of consumption for …

Lattice-based digital signature schemes following the hash-and-sign design paradigm of
Gentry, Peikert and Vaikuntanathan (GPV) tend to offer an attractive level of efficiency …

We propose the signature scheme Hawk, a concrete instantiation of proposals to use the
Lattice Isomorphism Problem (LIP) as a foundation for cryptography that focuses on …

Modern key-value stores typically rely on an LSM-tree in storage (SSD) to handle writes and
Bloom filters in memory (DRAM) to optimize reads. With ongoing advances in SSD …

Brotli is an open source general-purpose data compressor introduced by Google in late
2013 and now adopted in most known browsers and Web servers. It is publicly available on …

An update on the JPEG XL standardization effort: JPEG XL is a practical approach focused
on scalable web distribution and efficient compression of high-quality images. It will provide …

General-purpose lossless data compression and decompression ("(de) compression") are
used widely in hyperscale systems and are key" datacenter taxes". However, designing …