Brigitte Chauvin

Learn More
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in the external nodes, and many different trees can represent the same function, so that a fundamental question is related to the so-called complexity of a boolean function: L(f) :=(More)
The purpose of this article is to show that the distribution of the longest fragment in the random multisection problem after k steps and the height of m-ary search trees (and some extensions) are not only closely related in a formal way but both can be asymptotically described with the same distribution function that has to be shifted in a proper way(More)
We define a probability distribution over the set of Boolean functions of k variables induced by the tree representation of Boolean expressions. The law we are interested in is inspired by the growth model of Binary Search Trees: we call it the growing trees law. We study it over different logical systems and compare the results we obtain to already known(More)
Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a log n height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to log n. Both are built from VLMC (Variable Length Markov Chain)(More)
  • 1