15 citations · 16 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
The Story of HyperLogLog: How Flajolet Processed Streams with Coin Flips
Jérémie O. Lumbroso
This article is a historical introduction to data streaming algorithms that was written as a companion piece to the talk "How Philippe Flipped Coins to Count Data", given on Decemb…
cs.DS2015
MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm
Axel Bacher, Olivier Bodini, Alexandros Hollender +1
This article introduces an algorithm, MergeShuffle, which is an extremely efficient algorithm to generate random permutations (or to randomly permute an existing array). It is easy…
cs.DS2013★ 15 cited
Optimal Discrete Uniform Generation from Coin Flips, and Applications
Jérémie Lumbroso
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to imple…