Daniel Lemire | DeepAI

DeepAI AI Chat

Featured Co-authors

Xiaodan Zhu
54 publications
Edmon Begoli
8 publications
Jesús Camacho Rodríguez
6 publications
Michael J. Mior
6 publications
Peter Turney
5 publications
Wojciech Muła
4 publications
Nathan Kurz
3 publications
Owen Kaser
3 publications
Thomas Mueller Graf
3 publications
Julian Hyde
2 publications
Luca Deri
2 publications

∙ 03/25/2023

Exact Short Products From Truncated Multipliers

We sometimes need to compute the most significant digits of the product ...

0 Daniel Lemire, et al. ∙

∙ 12/13/2022

Fast Number Parsing Without Fallback

In recent work, Lemire (2021) presented a fast algorithm to convert numb...

0 Noble Mushtak, et al. ∙

∙ 12/09/2022

Transcoding Unicode Characters with AVX-512 Instructions

Intel includes on its recent processors a powerful set of instructions c...

0 Robert Clausecker, et al. ∙

∙ 01/04/2022

Binary Fuse Filters: Fast and Smaller Than Xor Filters

Bloom and cuckoo filters provide fast approximate set membership while u...

0 Thomas Mueller Graf, et al. ∙

∙ 11/14/2021

Unicode at Gigabytes per Second

We often represent text using Unicode formats (UTF-8 and UTF-16). The UT...

0 Daniel Lemire, et al. ∙

∙ 09/21/2021

Transcoding Billions of Unicode Characters per Second with SIMD Instructions

In software, text is often represented using Unicode formats (UTF-8 and ...

0 Daniel Lemire, et al. ∙

∙ 01/11/2021

Number Parsing at a Gigabyte per Second

With disks and networks providing gigabytes per second, parsing decimal ...

0 Daniel Lemire, et al. ∙

∙ 12/22/2020

Integer Division by Constants: Optimal Bounds

The integer division of a numerator n by a divisor d gives a quotient q ...

0 Daniel Lemire, et al. ∙

∙ 10/06/2020

Validating UTF-8 In Less Than One Instruction Per Byte

The majority of text is stored in UTF-8, which must be validated on inge...

0 John Keiser, et al. ∙

∙ 12/17/2019

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters

The Bloom filter provides fast approximate set membership while using li...

0 Thomas Mueller Graf, et al. ∙

∙ 11/07/2019

Efficient Computation of Positional Population Counts Using SIMD Instructions

In several fields such as statistics, machine learning, and bioinformati...

0 Marcus D. R. Klarqvist, et al. ∙

∙ 10/02/2019

Base64 encoding and decoding at almost the speed of a memory copy

Many common document formats on the Internet are text-only such as email...

0 Wojciech Muła, et al. ∙

∙ 02/22/2019

Parsing Gigabytes of JSON per Second

JavaScript Object Notation or JSON is a ubiquitous data exchange format ...

0 Geoff Langdale, et al. ∙

∙ 02/05/2019

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries

On common processors, integer multiplication is many times faster than i...

0 Daniel Lemire, et al. ∙

∙ 10/12/2018

Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity

L'Ecuyer & Simard's Big Crush statistical test suite has revealed statis...

0 Daniel Lemire, et al. ∙

∙ 05/28/2018

Fast Random Integer Generation in an Interval

In simulations, probabilistic algorithms and statistical tests, we often...

0 Daniel Lemire, et al. ∙

∙ 02/28/2018

Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources

Apache Calcite is a foundational software framework that provides query ...

0 Edmon Begoli, et al. ∙

∙ 09/25/2017

Stream VByte: Faster Byte-Oriented Integer Compression

Arrays of integers are often compressed in search engines. Though there ...

0 Daniel Lemire, et al. ∙

∙ 09/22/2017

Roaring Bitmaps: Implementation of an Optimized Software Library

Compressed bitmap indexes are used in systems such as Git or Oracle to a...

0 Daniel Lemire, et al. ∙

∙ 03/30/2017

Faster Base64 Encoding and Decoding Using AVX2 Instructions

Web developers use base64 formats to include images, fonts, sounds and o...

0 Wojciech Muła, et al. ∙

∙ 01/26/2015

Measuring academic influence: Not all citations are equal

The importance of a research article is routinely measured by counting h...

0 Xiaodan Zhu, et al. ∙

∙ 11/20/2008

Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound

The Dynamic Time Warping (DTW) is a popular similarity measure between t...

0 Daniel Lemire, et al. ∙

∙ 05/24/2006

A Better Alternative to Piecewise Linear Time Series Segmentation

Time series are difficult to monitor, summarize and predict. Segmentatio...

0 Daniel Lemire, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world