23 citations · 40 across the 18 of their papers we have counts for
5 papers · 1 filter
A bijective study of Basketball walks
Jérémie Bettinelli, Éric Fusy, Cécile Mailler +1
The Catalan numbers count many classes of combinatorial objects. The most emblematic such objects are probably the Dyck walks and the binary trees, and, whenever another class of c…
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
Antoine Genitrini, Cécile Mailler
This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What…
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus +1
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tr…
Associative and commutative tree representations for Boolean functions
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus +1
Since the 90's, several authors have studied a probability distribution on the set of Boolean functions on variables induced by some probability distributions on formulas built…
Catalan satisfiability problem
Antoine Genitrini, Cécile Mailler
An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and th…