6 citations · 10 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021★ 1 cited
Isomorphic unordered labeled trees up to substitution ciphering
Florian Ingels, Romain Azaïs
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the…
math.ST2021★ 1 cited
Maximum likelihood estimation for spinal-structured trees
Romain Azaïs, Benoît Henry
We investigate some aspects of the problem of the estimation of birth distributions (BD) in multi-type Galton-Watson trees (MGW) with unobserved types. More precisely, we consider…