232 citations · 2.4k across the 65 of their papers we have counts for
65 papers
Exact Short Products From Truncated Multipliers
Daniel Lemire
We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., ) or an ir…
Fast Number Parsing Without Fallback
Noble Mushtak, Daniel Lemire
In recent work, Lemire (2021) presented a fast algorithm to convert number strings into binary floating-point numbers. The algorithm has been adopted by several important systems:…
Transcoding Unicode Characters with AVX-512 Instructions
Robert Clausecker, Daniel Lemire
Intel includes in its recent processors a powerful set of instructions capable of processing 512-bit registers with a single instruction (AVX-512). Some of these instructions have…
Binary Fuse Filters: Fast and Smaller Than Xor Filters
Thomas Mueller Graf, Daniel Lemire
Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk and network accesses. The recently introduced…
Unicode at Gigabytes per Second
Daniel Lemire
We often represent text using Unicode formats (UTF-8 and UTF-16). The UTF-8 format is increasingly popular, especially on the web (XML, HTML, JSON, Rust, Go, Swift, Ruby). The UTF-…
Transcoding Billions of Unicode Characters per Second with SIMD Instructions
Daniel Lemire, Wojciech Muła
In software, text is often represented using Unicode formats (UTF-8 and UTF-16). We frequently have to convert text from one format to the other, a process called transcoding. Popu…