15 citations · 16 across the 5 of their papers we have counts for
10 papers
Cybernetic and Epistemic: A Missing Vocabulary for Trustworthy Agentic Delegation
Jérémie Lumbroso
As code generation is increasingly delegated to AI systems, the bottleneck is shifting from writing code to supervising the systems that write it --- a shift CS-education researche…
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…
Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs
Maryam Bahrani, Jérémie Lumbroso
In this paper, we build on recent results by Chauve et al. (2014) and Bahrani and Lumbroso (2017), which combined the split-decomposition, as exposed by Gioan and Paul, with analyt…
Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition
Maryam Bahrani, Jérémie Lumbroso
Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative p…
An Exact Enumeration of Distance-Hereditary Graphs
Cédric Chauve, Éric Fusy, Jérémie Lumbroso
Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomp…
Taming Reluctant Random Walks in the Positive Quadrant
Jeremie Lumbroso, Marni Mishna, Yann Ponty
A lattice walk model is said to be reluctant if the defining step set has a strong drift towards the boundaries. We describe efficient random generation strategies for these walks.
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…
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…
Analytic Samplers and the Combinatorial Rejection Method
Olivier Bodini, Jérémie Lumbroso, Nicolas Rolin
Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic meth…
Optimal Partial Tiling of Manhattan Polyominoes
Olivier Bodini, Jérémie Lumbroso
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi…