10 citations · 34 across the 19 of their papers we have counts for
22 papers
Fine-Grained Analysis of SIMD-Based Hash Table Implementations
Cyril Nicaud, Pablo Rotondo
In recent years, several variants of classical hash table schemes have been developed by engineers in order to take advantage of the processor's internal parallelism using SIMD ins…
Weakly-unambiguous Parikh automata and their link to holonomic series
Alin Bostan, Arnaud Carayol, Florent Koechlin +1
We investigate the connection between properties of formal languages and properties of their generating series, with a focus on the class of holonomic power series. We first prove…
The average-case complexity of the Word Problem for groups of matrices over~ is linear
Frédérique Bassino, Cyril Nicaud, Vincent Jugé +1
We show that the Word Problem in finitely generated subgroups of can be solved in linear average-case complexity, both when the input words are chosen u…
Silhouettes and generic properties of subgroups of the modular group
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show that the probability for a finitely generated subgroup of the modular group, of size , to be almost malnormal or non-parabolic, tends to 0 as tends to infinity -- wh…
Random generation of subgroups of the modular group with a fixed isomorphism type
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group of a given isomorphism type. The me…
Mathematical Models to Analyze Lua Hybrid Tables and Why They Need a Fix
Conrado Martínez, Cyril Nicaud, Pablo Rotondo
Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mech…